<?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/42354?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/42354?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36806/manta-rapid-detection-of-structural-variants-and-indels-for-germline-and-cancer-sequencing-applications</guid>
	<pubDate>Mon, 28 May 2018 09:41:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36806/manta-rapid-detection-of-structural-variants-and-indels-for-germline-and-cancer-sequencing-applications</link>
	<title><![CDATA[Manta: rapid detection of structural variants and indels for germline and cancer sequencing applications.]]></title>
	<description><![CDATA[Manta calls structural variants (SVs) and indels from mapped paired-end sequencing reads. It is optimized for analysis of germline variation in small sets of individuals and somatic variation in tumor/normal sample pairs. Manta discovers, assembles and scores large-scale SVs, medium-sized indels and large insertions within a single efficient workflow.<p>Address of the bookmark: <a href="https://github.com/Illumina/manta" rel="nofollow">https://github.com/Illumina/manta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</guid>
	<pubDate>Mon, 21 Jan 2019 17:58:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</link>
	<title><![CDATA[SvABA: Genome-wide detection of structural variants and indels by local assembly]]></title>
	<description><![CDATA[<p><span>SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of&nbsp;</span><a href="https://github.com/jts/sga">SGA</a><span>&nbsp;(String Graph Assembler) by Jared Simpson, and&nbsp;</span><a href="https://github.com/lh3/bwa">BWA-MEM</a><span>&nbsp;by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using&nbsp;</span><a href="https://github.com/walaj/VariantBam">VariantBam</a><span>&nbsp;rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.</span></p><p>Address of the bookmark: <a href="https://github.com/walaj/svaba" rel="nofollow">https://github.com/walaj/svaba</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42148/chromatiblock-scalable-whole-genome-visualisation-of-structural-changes-in-prokaryotes</guid>
	<pubDate>Sat, 22 Aug 2020 05:17:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42148/chromatiblock-scalable-whole-genome-visualisation-of-structural-changes-in-prokaryotes</link>
	<title><![CDATA[chromatiblock: Scalable, whole-genome visualisation of structural changes in prokaryotes]]></title>
	<description><![CDATA[<p>To create a fresh environment for chromatiblock to run in do:</p>
<pre><code>conda create --name chromatiblock
conda activate chromatiblock
conda install chromatiblock --channel conda-forge --channel bioconda
</code></pre>
<p>Then in future to run chromatiblock you can reactivate this environemtn using&nbsp;<code>conda activate chromatiblock</code></p>
<h4><a href="https://github.com/mjsull/chromatiblock#direct-download"></a>Direct download:</h4>
<p>Alternatively you can download and run the script from&nbsp;<a href="https://github.com/mjsull/chromatiblock/releases/download/v0.4.1/chromatiblock">here</a>.</p><p>Address of the bookmark: <a href="https://github.com/mjsull/chromatiblock" rel="nofollow">https://github.com/mjsull/chromatiblock</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44499/severus-a-somatic-structural-variation-sv-caller-for-long-reads</guid>
	<pubDate>Sun, 31 Mar 2024 02:41:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44499/severus-a-somatic-structural-variation-sv-caller-for-long-reads</link>
	<title><![CDATA[Severus: a somatic structural variation (SV) caller for long reads]]></title>
	<description><![CDATA[<p dir="auto">Severus is a somatic structural variation (SV) caller for long reads (both PacBio and ONT). It is designed for matching tumor/normal analysis, supports multiple tumor samples, and produces accurate and complete somatic and germline calls. Severus takes advantage of long-read phasing and uses the breakpoint graph framework to model complex chromosomal rearrangements.</p>
<p dir="auto">If you use Severus, please cite&nbsp;<a href="https://www.medrxiv.org/content/10.1101/2024.03.22.24304756v1">https://www.medrxiv.org/content/10.1101/2024.03.22.24304756v1</a></p><p>Address of the bookmark: <a href="https://github.com/KolmogorovLab/Severus" rel="nofollow">https://github.com/KolmogorovLab/Severus</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41941/svengine-allele-specific-and-haplotype-aware-structural-variants-simulator</guid>
	<pubDate>Sat, 04 Jul 2020 05:52:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41941/svengine-allele-specific-and-haplotype-aware-structural-variants-simulator</link>
	<title><![CDATA[SVEngine: Allele Specific and Haplotype Aware Structural Variants Simulator]]></title>
	<description><![CDATA[<p>SVEngine (Structural Variants Engine)</p>
<ul>
<li>SVEngine is a multi-purpose and self-contained simulator for whole genome scale spike-in of thousands of SV events of various types in both single-sample and matched sample scenarios.</li>
<li>SVEngine takes as input reference contigs in FASTA files, variant meta distribution as specified in META files (see Manual) or specific variant information as specified in VAR files (see Manual) and NEWICK files for specifying clonal phylogenetic trees in cancer.</li>
<li>SVEngine outpus alterred contigs in FASTA files, spiked-in variants in VAR files (see Manual), simulated short read in FASTQ files and aligned short reads in BAM files.</li>
</ul>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://bitbucket.org/charade/svengine/src/master/" rel="nofollow">https://bitbucket.org/charade/svengine/src/master/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<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/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>