<?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/38755?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/38755?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41397/svaba-structural-variation-and-indel-detection-by-local-assembly</guid>
	<pubDate>Tue, 10 Mar 2020 07:52:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41397/svaba-structural-variation-and-indel-detection-by-local-assembly</link>
	<title><![CDATA[SvABA: Structural variation and indel detection 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>Jit</dc:creator>
</item>
<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/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</guid>
	<pubDate>Fri, 27 Mar 2020 22:49:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</link>
	<title><![CDATA[HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads]]></title>
	<description><![CDATA[<p><span>HiCanu, a significant modification of the Canu assembler designed to leverage the full potential of HiFi reads via homopolymer compression, overlap-based error correction, and aggressive false overlap filtering.&nbsp;</span></p>
<p>More at&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3?fbclid=IwAR2PaN4GLjvAZpWmCE2q0EWk2dtwY7wiKxVlXn9PPG7OBSP06PP2gcCrv3A">https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3</a></p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</guid>
	<pubDate>Fri, 20 May 2016 19:08:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</link>
	<title><![CDATA[Hagfish - assess an assembly through creative use of coverage plots]]></title>
	<description><![CDATA[<p>Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of&nbsp;<em style="font-size: 12.8px;">de novo</em>&nbsp;genome assembly or identification of structural variation in a genome re-sequencing experiment.</p>
<p>Hagfish requires a reference sequence and a&nbsp;<span>paired end</span>&nbsp;re-sequencing data set. Hagfish has more power the larger the insert size of the paired end library is.</p>
<p>Quick links:&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Install">Installation</a>,<a href="https://github.com/mfiers/hagfish/wiki/Operation">Operation</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/ReadMappers">Read mappers</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Scripts">Hagfish scripts</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Plots">Hagfish plots</a></p><p>Address of the bookmark: <a href="https://github.com/mfiers/hagfish" rel="nofollow">https://github.com/mfiers/hagfish</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</guid>
	<pubDate>Fri, 09 Jun 2017 04:43:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</link>
	<title><![CDATA[TARDIS: Toolkit for automated and rapid discovery of structural variants]]></title>
	<description><![CDATA[<p>tardis</p>
<p>Toolkit for Automated and Rapid DIscovery of Structural variants</p>
<p>Requirements</p>
<p>zlib (http://www.zlib.net)<br>mrfast (https://github.com/BilkentCompGen/mrfast)<br>htslib (included as submodule; http://htslib.org/)<br>Fetching tardis</p>
<p>git clone https://github.com/BilkentCompGen/tardis.git --recursive</p>
<p>&nbsp;</p>
<p>https://github.com/BilkentCompGen/tardis</p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/tardis" rel="nofollow">https://github.com/BilkentCompGen/tardis</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43904/jasmine-jointly-accurate-sv-merging-with-intersample-network-edges</guid>
	<pubDate>Sat, 02 Jul 2022 11:41:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43904/jasmine-jointly-accurate-sv-merging-with-intersample-network-edges</link>
	<title><![CDATA[JASMINE: Jointly Accurate Sv Merging with Intersample Network Edges]]></title>
	<description><![CDATA[<p><span>This tool is used to merge structural variants (SVs) across samples. Each sample has a number of SV calls, consisting of position information (chromosome, start, end, length), type and strand information, and a number of other values. Jasmine represents the set of all SVs across samples as a network, and uses a modified minimum spanning forest algorithm to determine the best way of merging the variants such that each merged variants represents a set of analogous variants occurring in different samples.</span></p><p>Address of the bookmark: <a href="https://github.com/mkirsche/Jasmine" rel="nofollow">https://github.com/mkirsche/Jasmine</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</guid>
	<pubDate>Sun, 22 Dec 2019 03:48:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</link>
	<title><![CDATA[SViper: Swipe your Structural Variants called on long (ONT/PacBio) reads with short exact (Illumina) reads.]]></title>
	<description><![CDATA[<p>Call sviper</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants
</code></pre>
<p>This will output a&nbsp;<code>polished_variants.vcf</code>&nbsp;file, that contains all the refined variants.</p>
<p>Sometimes it is helpful to look at the polished sequence, e.g. with the IGV browser. In that case you want SViper to output the polished and aligned sequences in a bam file via the option&nbsp;<code>--output-polished-bam</code>:</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants --output-</code>polished-bam</pre><p>Address of the bookmark: <a href="https://github.com/smehringer/SViper" rel="nofollow">https://github.com/smehringer/SViper</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</guid>
	<pubDate>Sun, 14 Apr 2019 20:35:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</link>
	<title><![CDATA[GMASS: a novel measure for genomeassembly structural similarity]]></title>
	<description><![CDATA[<div id="Abstract">
<div id="ASec3">
<p id="Par3">The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo assemblers.</p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z</a></p>
</div>
</div><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php" rel="nofollow">http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26999/discovar</guid>
	<pubDate>Mon, 18 Apr 2016 11:59:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26999/discovar</link>
	<title><![CDATA[DISCOVAR]]></title>
	<description><![CDATA[<p><strong>DISCOVAR</strong> is a new variant caller and <strong>DISCOVAR <em>de novo</em></strong> a new genome assembler, both designed for state-of-the-art data. Their inputs are chosen to optimize quality while keeping costs low. Currently it takes as input Illumina reads of length 250 or longer &mdash; produced on MiSeq or HiSeq 2500 &mdash; and from a single PCR-free library. These data enable a level of completeness and continuity that was not previously possible.</p>
<p><strong>DISCOVAR</strong> can call variants on a region by region basis, potentially tiling an entire large genome. DISCOVAR variant calling is under active development and transitioning to VCF.</p>
<p><strong>DISCOVAR <em>de novo</em></strong> can generate <em>de novo</em> assemblies for both large and small genomes. It currently does not call variants.</p>
<p>More at https://www.broadinstitute.org/software/discovar/blog/?page_id=14</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/discovar/blog/" rel="nofollow">https://www.broadinstitute.org/software/discovar/blog/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</guid>
	<pubDate>Mon, 14 May 2018 04:26:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</link>
	<title><![CDATA[LACHESIS: Genome Assembly with Hi-C-based Contact Probability Maps (LACHESIS)]]></title>
	<description><![CDATA[<p>LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale&nbsp;<em>de novo</em>&nbsp;genome assembly.</p>
<p>Further information about LACHESIS, including source code, documentation and a user's guide are available at:&nbsp;<a href="http://shendurelab.github.io/LACHESIS/">http://shendurelab.github.io/LACHESIS</a>.</p>
<p>Manuscript describing LACHESIS was published as: Burton JN#, Adey A, Patwardhan RP, Qiu R, Kitzman JO, Shendure J#.&nbsp;<em>Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions.</em>&nbsp;Nature Biotechnology 2013 Dec;31(12):1119-25. doi:&nbsp;<a href="http://dx.doi.org/10.1038/nbt.2727">10.1038/nbt.272</a>. PubMed PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24185095">24185095</a>.</p>
<p>&nbsp;</p>
<p>http://shendurelab.github.io/LACHESIS/</p><p>Address of the bookmark: <a href="http://shendurelab.github.io/LACHESIS/" rel="nofollow">http://shendurelab.github.io/LACHESIS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>