<?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/38501?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/38501?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</guid>
	<pubDate>Tue, 09 Jul 2019 13:35:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</link>
	<title><![CDATA[GffCompare: Program for processing GTF/GFF files]]></title>
	<description><![CDATA[<p>The program gffcompare can be used to compare, merge, annotate and estimate accuracy of one or more GFF files (the &ldquo;query&rdquo; files), when compared with a reference annotation (also provided as GFF).</p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/gffcompare.shtml" rel="nofollow">https://ccb.jhu.edu/software/stringtie/gffcompare.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36852/mcmctree-a-phylogenetic-program-for-bayesian-estimation-of-species-divergence-times</guid>
	<pubDate>Sat, 02 Jun 2018 07:40:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36852/mcmctree-a-phylogenetic-program-for-bayesian-estimation-of-species-divergence-times</link>
	<title><![CDATA[MCMCTREE: a phylogenetic program for Bayesian estimation of species divergence times]]></title>
	<description><![CDATA[<p><a href="http://abacus.gene.ucl.ac.uk/software/paml.html" target="_blank">MCMCTREE</a><span>&nbsp;is a phylogenetic program for Bayesian estimation of species divergence times using soft fossil constraints under various molecular clock models. This is part of the&nbsp;</span><a href="http://abacus.gene.ucl.ac.uk/software/paml.html" target="_blank">PAML</a><span>&nbsp;package. In this tutorial I will analyze an easy example modified from dataset of&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/20551041" target="_blank">Inoue et al. (2010)</a><span>. Here we conduct a commonly used time estimation method, "Approximate Likelihood Method", for the datasets including more than 10 species.</span></p><p>Address of the bookmark: <a href="http://www.fish-evol.com/mcmctreeExampleVert6/text1Eng.html" rel="nofollow">http://www.fish-evol.com/mcmctreeExampleVert6/text1Eng.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</guid>
	<pubDate>Mon, 07 Jan 2019 10:35:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</link>
	<title><![CDATA[kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data]]></title>
	<description><![CDATA[<p><strong>kallisto</strong>&nbsp;is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of&nbsp;<em>pseudoalignment</em>&nbsp;for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data,&nbsp;<strong>kallisto</strong>&nbsp;can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and&nbsp;<strong>kallisto</strong>&nbsp;is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks&nbsp;<strong>kallisto</strong>&nbsp;significantly outperforms existing tools.&nbsp;<strong>kallisto</strong>&nbsp;is described in detail in:</p>
<p>Nicolas L Bray, Harold Pimentel, P&aacute;ll Melsted and Lior Pachter,&nbsp;<a href="http://www.nature.com/nbt/journal/v34/n5/full/nbt.3519.html">Near-optimal probabilistic RNA-seq quantification</a>, Nature Biotechnology&nbsp;<strong>34</strong>, 525&ndash;527 (2016), doi:10.1038/nbt.3519</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallisto/about" rel="nofollow">https://pachterlab.github.io/kallisto/about</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39869/mfannot-a-program-for-the-annotation-of-mitochondrial-and-plastid-genomes</guid>
	<pubDate>Mon, 26 Aug 2019 11:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39869/mfannot-a-program-for-the-annotation-of-mitochondrial-and-plastid-genomes</link>
	<title><![CDATA[MFannot : a program for the annotation of mitochondrial and plastid genomes]]></title>
	<description><![CDATA[<p><span>MFannot is a program for the annotation of mitochondrial and plastid genomes</span></p>
<p>MFannot is a program for the annotation of mitochondrial and plastid genomes. It is a PERL wrapper around a set of diverse, external independent tools.</p>
<p>It makes intense use of RNA/intron detection tools including&nbsp;<a href="http://hmmer.org/">HMMER</a>,&nbsp;<a href="https://github.com/nathanweeks/exonerate">Exonerate</a>,&nbsp;<a href="https://bioinformatics.ca/links_directory/tool/9822/erpin">Erpin</a>&nbsp;and others.</p>
<p><a href="http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl">http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl</a></p><p>Address of the bookmark: <a href="https://github.com/BFL-lab/Mfannot" rel="nofollow">https://github.com/BFL-lab/Mfannot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</guid>
	<pubDate>Wed, 25 Nov 2020 19:44:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</link>
	<title><![CDATA[IRscope: an online program to visualize the junction sites of chloroplast genomes]]></title>
	<description><![CDATA[<p><span>eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.</span></p><p>Address of the bookmark: <a href="https://sites.google.com/g.hmc.edu/empress/home" rel="nofollow">https://sites.google.com/g.hmc.edu/empress/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26499/katju-lab</guid>
  <pubDate>Fri, 26 Feb 2016 03:25:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Katju Lab]]></title>
  <description><![CDATA[
<p>TheLab seek to understand the genetic factors contributing to genomic variation and phenotypic diversity.  To this end, we employ molecular and bioinformatic tools to study evolutionary processes at the level of populations, both experimental and natural, and genomes.  Our research interests encompass a wide range of topics, including the evolution of organellar and nuclear genomes, gene duplication and the origin of novel function, and the fitness and phenotypic consequences of mutation in evolution. For details regards ongoing projects, please see the Research page.</p>

<p>http://katjulab.com/research.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38668/gvolante-completeness-assessment-of-genometranscriptome-sequences</guid>
	<pubDate>Sun, 13 Jan 2019 07:03:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38668/gvolante-completeness-assessment-of-genometranscriptome-sequences</link>
	<title><![CDATA[gVolante: Completeness Assessment of Genome/Transcriptome Sequences]]></title>
	<description><![CDATA[<p><span>A brand-new web server, gVolante, which provides an online tool for (i) on-demand completeness assessment of sequence sets by means of the previously developed pipelines CEGMA and BUSCO and (ii) browsing pre-computed completeness scores for publicly available data in its database section</span></p><p>Address of the bookmark: <a href="https://gvolante.riken.jp/analysis.html" rel="nofollow">https://gvolante.riken.jp/analysis.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/44364/genbank-release-2570-is-now-available</guid>
	<pubDate>Wed, 23 Aug 2023 00:23:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44364/genbank-release-2570-is-now-available</link>
	<title><![CDATA[GenBank release 257.0 is now available!]]></title>
	<description><![CDATA[<p><span>GenBank release 257.0 is now available! This release has 25.10 trillion bases and 3.69 billion records. Learn more:&nbsp;https://ncbiinsights.ncbi.nlm.nih.gov/2023/08/21/genbank-release-257/</span><a href="https://ow.ly/zHbV50PBE5o"><br /></a></p><p><a href="https://www.ncbi.nlm.nih.gov/genbank/?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=genbank-release-20230821">GenBank</a>&nbsp;release 257.0 (8/15/2023) is now available on the&nbsp;<a href="https://ftp.ncbi.nlm.nih.gov/genbank/">NCBI FTP site</a>. This release has 25.10 trillion bases and 3.69 billion records.</p><p><strong>The current release has:</strong></p><ul>
<li>246,119,175 traditional records containing 2,112,058,517,945 base pairs of sequence data</li>
<li>2,631,493,489 WGS records containing 22,294,446,104,543 base pairs of sequence data</li>
<li>686,271,945 bulk-oriented TSA records containing 646,176,166,908 base pairs of sequence data</li>
<li>124,421,006 bulk-oriented TLS records containing 48,289,699,026 base pairs of sequence data</li>
</ul>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>