<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/19090?offset=1290</link>
	<atom:link href="https://bioinformaticsonline.com/related/19090?offset=1290" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43243/interactive-bioinformatics-resources</guid>
	<pubDate>Thu, 12 Aug 2021 00:09:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43243/interactive-bioinformatics-resources</link>
	<title><![CDATA[Interactive Bioinformatics Resources !]]></title>
	<description><![CDATA[<p>Learn how to use bioinformatics tools right from your browser.<br>Everything runs in a sandbox, so you can experiment all you want.</p>
<p>More at sandbox.bio</p><p>Address of the bookmark: <a href="http://sandbox.bio" rel="nofollow">http://sandbox.bio</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44279/bioinformatics-training-material</guid>
	<pubDate>Sat, 18 Mar 2023 11:26:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44279/bioinformatics-training-material</link>
	<title><![CDATA[Bioinformatics Training Material !]]></title>
	<description><![CDATA[<p><span>Glittr</span>&nbsp;is a curated list of bioinformatics training material.<br>All material is:</p>
<ul>
<li>In a GitHub or GitLab repository</li>
<li>Free to use</li>
<li>Written in markdown or similar</li>
</ul>
<p><span>NOTE:</span>&nbsp;This list of courses is selected only based on the above criteria.<br>There are no checks on quality.</p>
<p>https://glittr.org/?per_page=25&amp;sort_by=stargazers&amp;sort_direction=desc</p><p>Address of the bookmark: <a href="https://glittr.org/?per_page=25&amp;sort_by=stargazers&amp;sort_direction=desc" rel="nofollow">https://glittr.org/?per_page=25&amp;sort_by=stargazers&amp;sort_direction=desc</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44516/16srna-database-download</guid>
	<pubDate>Wed, 24 Apr 2024 04:33:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44516/16srna-database-download</link>
	<title><![CDATA[16sRNA Database Download]]></title>
	<description><![CDATA[<p>Downloading 16S rRNA databases can be crucial for various bioinformatics analyses, especially in microbiome research. However, it's important to note that databases can vary based on your specific needs, such as the taxonomic coverage you require or the type of analysis you're performing. Here's a general guideline on how you can obtain 16S rRNA databases:</p><ol>
<li>
<p><span>NCBI (National Center for Biotechnology Information)</span>:</p>
<ul>
<li>NCBI provides various databases related to genetic information, including 16S rRNA sequences.</li>
<li>You can access the 16S ribosomal RNA sequences from NCBI's Nucleotide database (<a href="https://www.ncbi.nlm.nih.gov/nucleotide/" target="_new">https://www.ncbi.nlm.nih.gov/nucleotide/</a>).</li>
<li>Perform a search using keywords like "16S rRNA" or specific bacterial names to find relevant sequences.</li>
<li>You can download sequences individually or in batches using the provided tools.</li>
</ul>
</li>
<li>
<p><span>GreenGenes</span>:</p>
<ul>
<li>GreenGenes is a widely used 16S rRNA gene sequence database.</li>
<li>You can access it at <a target="_new">http://greengenes.secondgenome.com/</a>.</li>
<li>GreenGenes provides precompiled databases for various purposes, including classification, alignment, and phylogenetic analysis.</li>
</ul>
</li>
<li>
<p><span>SILVA</span>:</p>
<ul>
<li>SILVA (<a href="https://www.arb-silva.de/" target="_new">https://www.arb-silva.de/</a>) is another comprehensive database for ribosomal RNA (rRNA) sequences.</li>
<li>It covers not only 16S rRNA but also other ribosomal RNA sequences.</li>
<li>SILVA provides precompiled databases for various purposes, including taxonomic classification and alignment.</li>
</ul>
</li>
<li>
<p><span>Ribosomal Database Project (RDP)</span>:</p>
<ul>
<li>RDP (<a target="_new">http://rdp.cme.msu.edu/</a>) is a curated database that offers 16S rRNA sequences.</li>
<li>It provides tools for sequence analysis and classification.</li>
<li>You can download sequences and taxonomy information from their website.</li>
</ul>
</li>
<li>
<p><span>QIIME (Quantitative Insights Into Microbial Ecology)</span>:</p>
<ul>
<li>QIIME (<a href="https://qiime2.org/" target="_new">https://qiime2.org/</a>) is a widely used bioinformatics platform for microbiome analysis.</li>
<li>It provides tools for analyzing microbial communities, including processing 16S rRNA sequences.</li>
<li>QIIME often includes its own preprocessed 16S rRNA databases that can be used for analysis within the platform.</li>
</ul>
</li>
</ol><p>Before downloading any database, make sure to read the terms of use and citation requirements, as some databases may have specific usage policies. Additionally, consider the compatibility of the database with your analysis pipeline and software tools.</p><p>&nbsp;</p><p>NCBI 16s RNA database location&nbsp;ftp://ftp.ncbi.nih.gov/blast/db/16SMicrobial.tar.gz</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2422/bioinformatics-codes-search</guid>
	<pubDate>Thu, 15 Aug 2013 11:08:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2422/bioinformatics-codes-search</link>
	<title><![CDATA[Bioinformatics Codes Search]]></title>
	<description><![CDATA[<p>I bet, this website will be your best friend in near future. This helps us to explore the existing open source codes and learn from it.</p>
<p>You can find some useful open source bioinformatics codes for your analysis work. You can use the left bar options to filtere out or narrow down your search result. This webpage can be an useful resource for a beginners bioinformatician as it contain several bioinformatics basics script that are commonly used by biological programmers and biologist.</p>
<p>Stand on the slumped, dandruff-covered shoulders of millions of computer nerds. _/\_</p>
<p>Enjoy the code and research work.</p>
<p>http://code.ohloh.net/search?s=bioinformatics</p><p>Address of the bookmark: <a href="http://code.ohloh.net/search?s=bioinformatics" rel="nofollow">http://code.ohloh.net/search?s=bioinformatics</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5191/programming-language-to-build-synthetic-dna</guid>
	<pubDate>Mon, 30 Sep 2013 16:37:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5191/programming-language-to-build-synthetic-dna</link>
	<title><![CDATA[Programming language to build synthetic DNA]]></title>
	<description><![CDATA[<p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;">A team led by <a href="http://homes.cs.washington.edu/~seelig/index.html">Georg Seelig</a>&nbsp;(<a href="http://homes.cs.washington.edu/~seelig/index.html">http://homes.cs.washington.edu/~seelig/index.html</a>) at&nbsp;University of Washington has developed a programming language for chemistry that it hopes will streamline efforts to design a network that can guide the behavior of chemical-reaction mixtures in the same way that embedded electronic controllers guide cars, robots and other devices. In medicine, such networks could serve as &ldquo;smart&rdquo; drug deliverers or disease detectors at the cellular level.</p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;">Reference &amp; More @</p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;"><a href="http://www.nature.com/nnano/journal/vaop/ncurrent/full/nnano.2013.189.html">http://www.nature.com/nnano/journal/vaop/ncurrent/full/nnano.2013.189.html</a></p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;"><a href="http://www.washington.edu/news/2013/09/30/uw-engineers-invent-programming-language-to-build-synthetic-dna/">http://www.washington.edu/news/2013/09/30/uw-engineers-invent-programming-language-to-build-synthetic-dna/</a></p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;">Image source:&nbsp;washington.edu</p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;"><img src="http://www.washington.edu/news/files/2013/09/Programmable-chemistry-2.jpg" alt="image" style="border: 0px; border: 0px;"></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22938/research-assistant-in-computational-biology</guid>
  <pubDate>Wed, 24 Jun 2015 07:55:16 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research assistant in computational biology]]></title>
  <description><![CDATA[
<p>http://www.au.dk/en/about/vacant-positions/scientific-positions/stillinger/Vacancy/show/743161/5283/</p>

<p>Qualifications:<br />MSc degree in computer science, engineering, genetics or similar field with a strong emphasis on computational methods.</p>

<p>Deadline<br />01.08.2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42987/public-databases-for-bioinformatics</guid>
	<pubDate>Tue, 23 Mar 2021 05:32:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42987/public-databases-for-bioinformatics</link>
	<title><![CDATA[Public Databases for Bioinformatics !]]></title>
	<description><![CDATA[<pre>https://www.nature.com/articles/s41467-020-17155-y<br><br>Server Infrastructure:

File Server:

dhara: Synology 3614 Storage Appliance
4 Core Xeon
108TB disk storage
10Gb ethernet to SCG3
Access atx: dhara:5000
Has btsync server (try it - its much better than dropbox)

Compute Servers:

nandi: Kundaje and Phi Server
24 intel cores
256GB RAM
500GB of SSD storage 
36TB RAID6 local storage
4 Intel Phi's (space for 4 more GPU's)


durga: Montgomery and sensitive data
24 intel cores
256GB RAM
500GB of SSD RAID0 storage 
60TB RAID6 local storage

mitra: Bassik and Web/DB Server
24 core
256GB RAM 
500GB of SSD RAID0 storage 
36TB RAID6 local storage

vayu: Kundaje GPU server
4 core
64GB RAM 
200GB of SSD storage 
8TB RAID10 local storage
4 Nvidia GTX 970 4GB GPUs

amold: Bickel and SGE server
32 AMD core
128GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

wotan: Bickel and SGE server
64 AMD core
256GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

Filesystem:

/users/$USER
default home directory
full backups nightly 
nfs mount to dhara
should store code, papers, and other highly processed data here

/mnt/data/
globally accessible data
should store common data here
e.g. genomes and indexes, annotations, ENCODE data  
if you dont want this to count towards your quote you must chown

/mnt/lab_data/$LAB/
lab accessible data
should store lab project data here 
e.g. ATAC-seq prediction data, enhancer prediction, motif calls

/srv/scratch/$USER
fast local storage
not backed up, but on raid and data will never be deleted
most analysis should be performed here

/srv/persistent/$USER
fast local storage
synced nightly, but not backed up
       ie if the hard drives fail or you delete something and notice 
       within 24 hours we can recover. Otherwise not. (vs home which is 
       properly backed up )  
intermediate analysis products that would be hard to recover should be stored here 
       e.g. stochastic analysis results that need to be kept so that paper 
       results can be reproduced

/srv/www/$LABNAME/
web accessible from mitra.stanford.edu
*NOT BACKED UP*

Some parallel programming patterns:

# gzip a bunch of files
parallel gzip -- *.FILESTOGZIP

# fork example in python:
(for more detailed examples look at 
 https://github.com/nboley/grit/ grit/lib/multiprocessing_utils.py)

import os
import time
import random

import multiprocessing

class ProcessSafeOPStream( object ):
    def __init__( self, writeable_obj ):
        self.writeable_obj = writeable_obj
        self.lock = multiprocessing.Lock()
        self.name = self.writeable_obj.name
        return
    
    def write( self, data ):
        self.lock.acquire()
        self.writeable_obj.write( data )
        self.writeable_obj.flush()
        self.lock.release()
        return
    
    def close( self ):
        self.writeable_obj.close()

def worker(queue, ofp):
    # Try without this
    random.seed()
    while True:
        i = queue.get()
        if i == 'FINISHED': return
        # simulate an expensive function
        x = random.random()
        time.sleep(x/10)
        print i, x
        ofp.write("%i\t%s\n" % (i, x))

NSIMS = 10000
NPROC = 25

# populate queue
todo = multiprocessing.Queue()
for i in xrange(NSIMS): todo.put(i)
for i in xrange(NPROC): todo.put('FINISHED')

ofp = ProcessSafeOPStream( open("output.txt", "w") )

pids = []
for i in xrange(NPROC):
    pid = os.fork()
    if pid == 0:
       worker(todo, ofp)
       os._exit(0)
    else:
       pids.append(pid)  

for pid in pids:
    os.waitpid(pid, 0)

ofp.close()

print "FINISHED"<br><br></pre>
<p>For use case 1 we obtained the following ENCODE and ROADMAP datasets&nbsp;<a href="https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz">https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam">https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam">https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam</a>. Blacklisted regions were obtained from&nbsp;<a href="http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz">http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz</a>. The human genome version hg38 was obtained from&nbsp;<a href="http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz">http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz</a>.</p>
<p>For use case 2 we used the set of narrowPeak files summarized in&nbsp;<a href="https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt">https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt</a>&nbsp;(archived version v1.0.1). The human genome version hg19 was obtained from&nbsp;<a href="http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz">http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz</a></p>
<p>For use case 3 we used the ENCODE datasets&nbsp;<a href="https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam">https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig">https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam">https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam</a>&nbsp;as we as the GENCODE annotation v29 from&nbsp;<a href="ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz">ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz</a>.</p><p>Address of the bookmark: <a href="http://mitra.stanford.edu/" rel="nofollow">http://mitra.stanford.edu/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</guid>
	<pubDate>Wed, 29 Nov 2017 07:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</link>
	<title><![CDATA[Ribbon: Visualizing complex genome alignments and structural variation:]]></title>
	<description><![CDATA[<p>Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.</p>
<p>Local installation:</p>
<p>You can install Ribbon locally from Github by following the instructions here:&nbsp;<a href="https://github.com/MariaNattestad/ribbon" target="_blank">https://github.com/MariaNattestad/Ribbon</a></p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>