<?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/41571?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/41571?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30680/easybuild</guid>
	<pubDate>Fri, 27 Jan 2017 16:00:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30680/easybuild</link>
	<title><![CDATA[EasyBuild]]></title>
	<description><![CDATA[<p><a href="https://github.com/hpcugent/easybuild">EasyBuild</a><span>&nbsp;is a software build and installation framework that allows you to manage (scientific) software on High Performance Computing (HPC) systems in an efficient way.</span><br><span>A full list of supported software packages is available&nbsp;</span><a href="http://easybuild.readthedocs.io/en/latest/version-specific/Supported_software.html">here</a><span>.</span></p><p>Address of the bookmark: <a href="https://hpcugent.github.io/easybuild/" rel="nofollow">https://hpcugent.github.io/easybuild/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38581/cvit-chromosome-viewing-tool</guid>
	<pubDate>Wed, 02 Jan 2019 04:10:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38581/cvit-chromosome-viewing-tool</link>
	<title><![CDATA[CViT: Chromosome Viewing Tool]]></title>
	<description><![CDATA[<p><span>CViT - Chromosome Viewing Tool. A collection of Perl scripts that enable quick visualizations of features on linkage groups, psuedochromosomes or cytogenetic maps. Intended for whole-genome views of data but can be used to create images of single chromosomes/linkage groups, contigs, or BACs, or even proteins -- any feature that has a location on a backbone. Handles most standard genetic/genomic coordinate systems. Reads GFF3 data and produces a PNG or SVG image.</span></p>
<p><span>https://www.hindawi.com/journals/ijpg/2011/373875/</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/cvit/" rel="nofollow">https://sourceforge.net/projects/cvit/</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/30002/excavator2tool</guid>
	<pubDate>Wed, 30 Nov 2016 04:09:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30002/excavator2tool</link>
	<title><![CDATA[EXCAVATOR2tool]]></title>
	<description><![CDATA[<p><span>EXCAVATOR2 is a collection of bash, R and Fortran scripts and codes that analyses Whole Exome Sequencing (WES) data to identify CNVs. EXCAVATOR2 enhances the identification of all genomic CNVs, both overlapping and non-overlapping targeted exons by integrating the analysis of In-targets and Off- targets reads. Specifically, it improves the precision of calling CNVs overlapping targeted exons from WES data and enlarges the spectrum of detectable CNVs to off-target events.</span><br><span>EXCAVATOR2 can be effectively employed for the identification of CNVs in small as well as large-scale re-sequencing population and cancer studies. Lastly, it&rsquo;s of particular interest that all WES experiments can be re-analysed using our method with the beneficial effect to identify novelCNVs in extra-exonic regions by having the full-genome CN profile.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/excavator2tool/" rel="nofollow">https://sourceforge.net/projects/excavator2tool/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</guid>
	<pubDate>Thu, 20 Jul 2017 08:02:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</link>
	<title><![CDATA[Mulan: MUltiple sequence Local AligNment and conservation visualization tool]]></title>
	<description><![CDATA[<p><span>Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It combines&nbsp;</span><a href="http://www.bx.psu.edu/miller_lab/" target="_new"><em>refine</em>&nbsp;and&nbsp;<em>tba</em></a><span>&nbsp;tools to align either "draft" or "finished" quality sequences. Mulan provides a dynamic graphical interface to align and visualize conservation profiles for evolutionarily distant and closely related species.</span><br><span></span></p>
<p><span>Input formats, automated data upload from the&nbsp;</span><a href="http://genome.ucsc.edu/" target="_new">UCSC Genome Browser</a><span>, gene annotation, annotation of repetitive elements, and progress report were previously described in the&nbsp;</span><a href="https://zpicture.dcode.org/zpInstructions.html" target="_zp">zPicture instructions</a><span>&nbsp;and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.</span><span><br></span></p><p>Address of the bookmark: <a href="https://mulan.dcode.org/mulanInstructions.php" rel="nofollow">https://mulan.dcode.org/mulanInstructions.php</a></p>]]></description>
	<dc:creator>Rahul Nayak</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>

</channel>
</rss>