<?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/34235?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/34235?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42139/mixtures-a-novel-tool-for-bacterial-strain-reconstruction-from-reads</guid>
	<pubDate>Fri, 21 Aug 2020 08:23:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42139/mixtures-a-novel-tool-for-bacterial-strain-reconstruction-from-reads</link>
	<title><![CDATA[mixtureS: a novel tool for bacterial strain reconstruction from reads]]></title>
	<description><![CDATA[<div>
<p>mixtureS that can de novo identify bacterial strains from shotgun reads of a clonal or metagenomic sample, without prior knowledge about the strains and their variations. Tested on 243 simulated datasets and 195 experimental datasets, mixtureS reliably identified the strains, their numbers and their abundance. Compared with three tools, mixtureS showed better performance in almost all simulated datasets and the vast majority of experimental datasets.</p>
</div>
<div>
<div>Availability</div>
<p>The source code and tool mixtureS is available at&nbsp;<a href="http://www.cs.ucf.edu/~xiaoman/mixtureS/" target="_blank">http://www.cs.ucf.edu/&tilde;xiaoman/mixtureS/</a>.</p>
</div><p>Address of the bookmark: <a href="http://www.cs.ucf.edu/~xiaoman/mixtureS/" rel="nofollow">http://www.cs.ucf.edu/~xiaoman/mixtureS/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44171/hairsplitter-assembling-long-reads-in-an-unknown-number-of-haplotypes</guid>
	<pubDate>Wed, 07 Dec 2022 00:13:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44171/hairsplitter-assembling-long-reads-in-an-unknown-number-of-haplotypes</link>
	<title><![CDATA[HairSplitter: assembling long reads in an unknown number of haplotypes]]></title>
	<description><![CDATA[<p>Pros and cons of HairSplitter Limitations of HairSplitter:</p>
<p>Not very fast: it re-polishes the whole assembly&nbsp;</p>
<p>Limited in the number of haplotypes</p>
<p>Strengths of HairSplitter:</p>
<p>Very modular, can be used with any assembler</p>
<p>Naive: makes no assumption on ploidy, parameter-free</p>
<p>Safe: won&rsquo;t artificially duplicate contigs</p>
<p>&nbsp;</p>
<p>HairSplitter splits collapsed assemblies from &ldquo;draft&rdquo; assemblies obtained by any means</p>
<p>HairSplitter can recover haplotypes and distinguish repeated elements</p>
<p>Only needs sequencing reads, potentially error-prone</p>
<p>HairSplitter splits collapsed assemblies from &ldquo;draft&rdquo; assemblies obtained by any means</p>
<p>HairSplitter can recover haplotypes and distinguish repeated elements</p>
<p>Only needs sequencing reads, potentially error-prone</p>
<p>Not really available yet (github.com/RolandFaure/HairSplitter)</p>
<p>https://hal.archives-ouvertes.fr/hal-03864075/file/RolandFaure_presentation_SeqBIM_2022.pdf</p><p>Address of the bookmark: <a href="https://hal.archives-ouvertes.fr/hal-03817928/document" rel="nofollow">https://hal.archives-ouvertes.fr/hal-03817928/document</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26453/stacks</guid>
	<pubDate>Wed, 24 Feb 2016 15:52:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26453/stacks</link>
	<title><![CDATA[Stacks]]></title>
	<description><![CDATA[<p>Stacks is a software pipeline for building loci from short-read sequences, such as those generated on the Illumina platform. Stacks was developed to work with restriction enzyme-based data, such as RAD-seq, for the purpose of building genetic maps and conducting population genomics and phylogeography.</p>
<p>More at http://catchenlab.life.illinois.edu/stacks/</p><p>Address of the bookmark: <a href="http://catchenlab.life.illinois.edu/stacks/" rel="nofollow">http://catchenlab.life.illinois.edu/stacks/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</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/29912/maq-mapping-and-assembly-with-quality</guid>
	<pubDate>Tue, 22 Nov 2016 04:51:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29912/maq-mapping-and-assembly-with-quality</link>
	<title><![CDATA[Maq: Mapping and Assembly with Quality]]></title>
	<description><![CDATA[<p><strong>Maq</strong>&nbsp;stands for&nbsp;<em>Mapping and Assembly with Quality</em>&nbsp;It builds assembly by mapping short reads to reference sequences. Maq is a project hosted by&nbsp;<a href="http://sourceforge.net/">SourceForge.net</a>. The project page is available at<a href="http://sourceforge.net/projects/maq/">http://sourceforge.net/projects/maq/</a>. Maq is previously known as mapass2.</p>
<h2>Run Maq Now</h2>
<p>Follow these steps to try Maq. All you need is a reference sequence file in the FASTA format.</p>
<ol>
<li>Prepare a reference sequence (ref.fasta). Better a bacterial genome.</li>
<li>Download maq, maq-data and maqview at the&nbsp;<a href="http://sourceforge.net/project/showfiles.php?group_id=191815">download page</a>.</li>
<li>Copy maq, maq.pl and maq_eval.pl to the $PATH or to the same directory.</li>
<li>Simulate diploid reference and read sequences, map reads, call variants and evaluate the results in one go:
<pre>maq.pl demo ref.fasta calib-30.dat
</pre>
where&nbsp;<em>calib-30.dat</em>&nbsp;is contained in maq-data.</li>
<li>View the alignment:
<pre>cd maqdemo/easyrun;
maqindex -i -c consensus.cns all.map;
maqview -c consensus.cns all.map</pre>
</li>
</ol>
<p><strong>Even for advanced maq users, running `maq.pl demo' is recommended. You may find something helpful.</strong></p><p>Address of the bookmark: <a href="http://maq.sourceforge.net" rel="nofollow">http://maq.sourceforge.net</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31714/krona</guid>
	<pubDate>Wed, 22 Mar 2017 04:47:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31714/krona</link>
	<title><![CDATA[Krona]]></title>
	<description><![CDATA[<p>Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an <a href="https://github.com/marbl/Krona/wiki/ExcelTemplate">Excel template</a> or <a href="https://github.com/marbl/Krona/wiki/KronaTools">KronaTools</a>, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see <a href="https://github.com/marbl/Krona/wiki/Browser%20support">Browser support</a>).</p>
<p><a href="http://marbl.github.io/Krona/img/screen_mgrast.png"><img src="https://camo.githubusercontent.com/27b71b1f1832523723c3d14dec764e7ad098438c/687474703a2f2f6d6172626c2e6769746875622e696f2f4b726f6e612f696d672f7468756d625f6d67726173742e706e67" width="210" height="167" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marbl/Krona/wiki" rel="nofollow">https://github.com/marbl/Krona/wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44593/bear-better-emulation-for-artificial-reads</guid>
	<pubDate>Sat, 06 Jul 2024 04:27:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44593/bear-better-emulation-for-artificial-reads</link>
	<title><![CDATA[BEAR: Better Emulation for Artificial Reads]]></title>
	<description><![CDATA[<p dir="auto">Created by Stephen Johnson, Brett Trost, Dr. Jeffrey R. Long, Dr. Anthony Kusalik University of Saskatchewan, Department of Computer Science</p>
<p dir="auto">BEAR is intended to be an easy-to-use collection of scripts for generating simulated WGS metagenomic reads with read lengths, quality scores, error profiles, and species abundances derived from real user-supplied WGS data.</p><p>Address of the bookmark: <a href="https://github.com/sej917/BEAR" rel="nofollow">https://github.com/sej917/BEAR</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>