<?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/37223?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/37223?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/2518/genome-browsers</guid>
	<pubDate>Fri, 16 Aug 2013 19:04:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/2518/genome-browsers</link>
	<title><![CDATA[Genome Browsers]]></title>
	<description><![CDATA[<p>Genome Browser is the platform/database used for searching and retreiving sequences and annotation of genomes belong to various eukaryotes, prokaryotes, etc.</p><p>Following are the weblink for different available browsers:</p><p><a href="http://www.ensembl.org/index.html">http://www.ensembl.org/index.html</a></p><p><a href="http://ensemblgenomes.org/">http://ensemblgenomes.org/</a></p><p><a href="http://genome.ucsc.edu/">http://genome.ucsc.edu/</a></p><p><a href="http://www.ncbi.nlm.nih.gov/genome">http://www.ncbi.nlm.nih.gov/genome</a></p><p><a href="http://www.ebi.ac.uk/genomes/">http://www.ebi.ac.uk/genomes/</a></p><p><a href="http://flybase.org/">http://flybase.org/</a></p><p><a href="http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi">http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi</a></p><p><a href="http://www.sanger.ac.uk/resources/databases/">http://www.sanger.ac.uk/resources/databases/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28870/genemania</guid>
	<pubDate>Mon, 22 Aug 2016 09:55:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28870/genemania</link>
	<title><![CDATA[GeneMANIA]]></title>
	<description><![CDATA[<p>Faster, more accurate algorithms function prediction "GeneMANIA (Multiple Association Network Integration Algorithm)" have however been developed in recent years and are publicly available on the web, indicating the future direction of function prediction.</p><p>Address of the bookmark: <a href="http://genemania.org/" rel="nofollow">http://genemania.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38515/genome-annotation-using-maker-tutorial</guid>
	<pubDate>Thu, 20 Dec 2018 17:39:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38515/genome-annotation-using-maker-tutorial</link>
	<title><![CDATA[Genome Annotation using MAKER tutorial !]]></title>
	<description><![CDATA[<p><a href="http://www.yandell-lab.org/software/maker.html">MAKER</a><span>&nbsp;is a great tool for annotating a reference genome using empirical and&nbsp;</span><em>ab initio</em><span>gene predictions.&nbsp;</span><a href="http://gmod.org/wiki/Main_Page">GMOD</a><span>, the umbrella organization that includes MAKER, has some nice tutorials online for running MAKER. However, these were quite simplified examples and it took a bit of effort to wrap my head completely around everything. Here I will describe a&nbsp;</span><em>de novo</em><span>&nbsp;genome annotation for&nbsp;</span><em>Boa constrictor</em><span>&nbsp;in detail, so that there is a record and that it is easy to use this as a guide to annotate any genome.</span></p><p>Address of the bookmark: <a href="https://www.biostars.org/p/261203/" rel="nofollow">https://www.biostars.org/p/261203/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41571/wego-simple-but-useful-tool-for-visualizing-comparing-and-plotting-go-gene-ontology-annotation-results</guid>
	<pubDate>Sun, 12 Apr 2020 10:02:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41571/wego-simple-but-useful-tool-for-visualizing-comparing-and-plotting-go-gene-ontology-annotation-results</link>
	<title><![CDATA[WEGO : simple but useful tool for visualizing, comparing and plotting GO (Gene Ontology) annotation results]]></title>
	<description><![CDATA[<p><span>WEGO (Web Gene Ontology Annotation Plot) is a simple but useful tool for visualizing, comparing and plotting GO (Gene Ontology) annotation results. As the GO vocabulary became more and more popular, WEGO was widely adopted and used in many researches. Therefore we have updated WEGO 2.0 in 2018. Here are some changes we&rsquo;ve made:</span><br><span>1. The limit of input file numbers was cancelled. Now the users could upload as many files as they want with one operation.</span><br><span>2. We have added the reference data of 9 species for users selection.</span><br><span>3. Besides the traditional WEGO histogram, WEGO 2.0 outputs an additional type of bar graph showing GO terms with significant gene number differences.</span></p><p>Address of the bookmark: <a href="http://wego.genomics.org.cn/" rel="nofollow">http://wego.genomics.org.cn/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36456/alpaca-a-hybrid-strategy-for-assembly-of-genomic-dna-shotgun-sequencing-reads</guid>
	<pubDate>Mon, 30 Apr 2018 04:38:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36456/alpaca-a-hybrid-strategy-for-assembly-of-genomic-dna-shotgun-sequencing-reads</link>
	<title><![CDATA[ALPACA: A hybrid strategy for assembly of genomic DNA shotgun sequencing reads.]]></title>
	<description><![CDATA[<p><span>ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.&nbsp;</span></p>
<p><span>Detail paper at&nbsp;https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8</span></p><p>Address of the bookmark: <a href="https://github.com/VicugnaPacos/ALPACA" rel="nofollow">https://github.com/VicugnaPacos/ALPACA</a></p>]]></description>
	<dc:creator>Seema Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</guid>
	<pubDate>Tue, 03 Jul 2018 04:09:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</link>
	<title><![CDATA[ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly]]></title>
	<description><![CDATA[With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries.

Texas A&amp;M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory.

Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice.

Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.<p>Address of the bookmark: <a href="http://faculty.cse.tamu.edu/shsze/asplice/" rel="nofollow">http://faculty.cse.tamu.edu/shsze/asplice/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</guid>
	<pubDate>Thu, 14 May 2020 15:09:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</link>
	<title><![CDATA[LR_Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly]]></title>
	<description><![CDATA[<p>LR_Gapcloser is a gap closing tool using long reads from studied species. The long reads could be downloaed from public read archive database (for instance, NCBI SRA database ) or be your own data. Then they are fragmented and aligned to scaffolds using BWA mem algorithm in BWA package. In the package, we provided a compiled bwa, so the user needn't to install bwa. LR_Gapcloser uses the alignments to find the bridging that cross the gap, and then fills the long read original sequence into the genomic gaps.</p><p>Address of the bookmark: <a href="https://github.com/CAFS-bioinformatics/LR_Gapcloser" rel="nofollow">https://github.com/CAFS-bioinformatics/LR_Gapcloser</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38413/genobuntu-a-software-package-containing-more-than-70-software-and-packages-oriented-towards-ngs-and-genome-assembly</guid>
	<pubDate>Tue, 11 Dec 2018 05:15:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38413/genobuntu-a-software-package-containing-more-than-70-software-and-packages-oriented-towards-ngs-and-genome-assembly</link>
	<title><![CDATA[Genobuntu: A software package containing more than 70 software and packages oriented towards NGS and genome assembly]]></title>
	<description><![CDATA[<p><span>Genobuntu is a software package containing more than 70 software and packages oriented towards NGS. In its current version, Genobuntu supports pre assembly tools, genome assemblers as well as post assembly tools.&nbsp;</span><br><br><span>Commonly used biological software and example script files for different assembly pipelines have also been provided, where the example script files can be updated to suit one&rsquo;s experimental needs. Genobuntu attempts to reduce the amount of time and energy needed to build software workstations and it can also act as a good teaching source for a class room setting.&nbsp;</span></p>
<p>https://sourceforge.net/projects/genobuntu/</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genobuntu/" rel="nofollow">https://sourceforge.net/projects/genobuntu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38735/genome-assembly-tutorial-genome-assembly-for-short-and-long-reads</guid>
	<pubDate>Sat, 19 Jan 2019 17:29:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38735/genome-assembly-tutorial-genome-assembly-for-short-and-long-reads</link>
	<title><![CDATA[Genome assembly tutorial &quot;Genome Assembly for short and long reads&quot;]]></title>
	<description><![CDATA[<p>In this lab we will perform de novo genome assembly of a bacterial genome. You will be guided through the genome assembly starting with data quality control, through to building contigs and analysis of the results. At the end of the lab you will know:</p>
<ol>
<li>How to perform basic quality checks on the input data</li>
<li>How to run a short read assembler on Illumina data</li>
<li>How to run a long read assembler on Pacific Biosciences or Oxford Nanopore data</li>
<li>How to improve the accuracy of a long read assembly using short reads</li>
<li>How to assess the quality of an assembly</li>
</ol>
<p>https://bioinformaticsdotca.github.io/high-throughput_biology_2017</p><p>Address of the bookmark: <a href="https://bioinformaticsdotca.github.io/high-throughput_biology_2017_module6_lab" rel="nofollow">https://bioinformaticsdotca.github.io/high-throughput_biology_2017_module6_lab</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>