<?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/33693?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/33693?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</guid>
	<pubDate>Thu, 16 Feb 2017 11:39:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</link>
	<title><![CDATA[HivePlot]]></title>
	<description><![CDATA[<p>The&nbsp;<em>hive plot</em>&nbsp;is a rational visualization method for drawing networks. Nodes are mapped to and positioned on radially distributed linear axes &mdash; this mapping is based on network structural properties. Edges are drawn as curved links. Simple and interpretable.</p>
<p>The purpose of the hive plot is to establish a new baseline for visualization of large networks &mdash; a method that is both general and tunable and useful as a starting point in visually exploring network structure.</p>
<p>More at&nbsp;http://www.hiveplot.com/</p><p>Address of the bookmark: <a href="http://www.hiveplot.com/" rel="nofollow">http://www.hiveplot.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34678/svfinder-tool-for-detecting-genomic-rearrangement-form-dna-seq-data</guid>
	<pubDate>Thu, 14 Dec 2017 15:51:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34678/svfinder-tool-for-detecting-genomic-rearrangement-form-dna-seq-data</link>
	<title><![CDATA[SVfinder: Tool for detecting genomic rearrangement form DNA-seq data]]></title>
	<description><![CDATA[<p><span>SVfinder provides genome-wide detection of structural variants from next generation paired-end sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cauyrd/SVfinder" rel="nofollow">https://github.com/cauyrd/SVfinder</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</guid>
	<pubDate>Fri, 14 Jun 2024 14:42:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</link>
	<title><![CDATA[Panacus : A Counting Tool for Pangenome Graphs]]></title>
	<description><![CDATA[<p dir="auto"><code>panacus</code>&nbsp;is a tool for calculating statistics for&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA</a>&nbsp;files. It supports GFA files with&nbsp;<code>P</code>&nbsp;and&nbsp;<code>W</code>&nbsp;lines, but requires that the graph is&nbsp;<code>blunt</code>, i.e., nodes do not overlap and consequently, each link (<code>L</code>) points from the end of one segment (<code>S</code>) to the start of another.</p>
<p dir="auto"><code>panacus</code>&nbsp;supports the following calculations:</p>
<ul dir="auto">
<li>coverage histogram</li>
<li>pangenome growth statistics</li>
<li>path-/group-resolved coverage table</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marschall-lab/panacus" rel="nofollow">https://github.com/marschall-lab/panacus</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</guid>
	<pubDate>Tue, 16 Mar 2021 05:41:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</link>
	<title><![CDATA[DAVI: Deep learning-based tool for alignment and single nucleotide variant identification]]></title>
	<description><![CDATA[<p>DAVI consists of models for both global and local alignment and for variant calling. We have evaluated the performance of DAVI against existing state-of-the-art tool sets and found that its accuracy and performance is comparable to existing tools used for bench-marking. We further demonstrate that while existing tools are based on data generated from a specific sequencing technology, the models proposed in DAVI are generic and can be used across different NGS technologies as well as across different species</p>
<p>https://iopscience.iop.org/article/10.1088/2632-2153/ab7e19/pdf</p><p>Address of the bookmark: <a href="https://github.com/gguptaiitd/NEAT" rel="nofollow">https://github.com/gguptaiitd/NEAT</a></p>]]></description>
	<dc:creator>Jit</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/34594/synima-synteny-imaging-tool</guid>
	<pubDate>Sun, 10 Dec 2017 17:03:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34594/synima-synteny-imaging-tool</link>
	<title><![CDATA[Synima: Synteny Imaging tool]]></title>
	<description><![CDATA[<p><span>Synteny Imaging tool (Synima) written in Perl, which uses the graphical features of R. Synima takes orthologues computed from reciprocal best BLAST hits or OrthoMCL, and DAGchainer, and outputs an overview of genome-wide synteny in PDF. Each of these programs are included with the Synima package, and a pipeline for their use. Synima has a range of graphical parameters including size, colours, order, and labels, which are specified in a config file generated by the first run of Synima &ndash; and can be subsequently edited. Synima runs quickly on a command line to generate informative and publication quality figures. Synima is open source and freely available from&nbsp;</span><span><a href="https://github.com/rhysf/Synima"><span>https://github.com/rhysf/Synima</span></a></span><span>&nbsp;under the MIT License.</span></p><p>Address of the bookmark: <a href="https://github.com/rhysf/Synima" rel="nofollow">https://github.com/rhysf/Synima</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35885/multi-car-a-tool-of-contig-scaffolding-using-multiple-references</guid>
	<pubDate>Tue, 06 Mar 2018 16:39:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35885/multi-car-a-tool-of-contig-scaffolding-using-multiple-references</link>
	<title><![CDATA[Multi-CAR: a tool of contig scaffolding using multiple references]]></title>
	<description><![CDATA[<p><span>we design a simple heuristic method to further revise our single reference-based scaffolding tool CAR into a new one called Multi-CAR such that it can utilize multiple complete genomes of related organisms as references to more accurately order and orient the contigs of a draft genome. In practical usage, our Multi-CAR does not require prior knowledge concerning phylogenetic relationships among the draft and reference genomes and libraries of paired-end reads. To validate Multi-CAR, we have tested it on a real dataset composed of several prokaryotic genomes and also compared its accuracy performance with other multiple reference-based scaffolding tools Ragout and MeDuSa.&nbsp;</span></p><p>Address of the bookmark: <a href="http://genome.cs.nthu.edu.tw/Multi-CAR/" rel="nofollow">http://genome.cs.nthu.edu.tw/Multi-CAR/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>