<?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/40208?</link>
	<atom:link href="https://bioinformaticsonline.com/related/40208?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Wed, 17 Apr 2019 19:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Breaking-Chimeric-Contigs">Chimeric contig correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</guid>
	<pubDate>Fri, 15 Jun 2018 04:48:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</link>
	<title><![CDATA[mScaffolder: A comparative genome scaffolding tool]]></title>
	<description><![CDATA[<p>A comparative genome scaffolding tool based on MUMmer</p>
<p>mScaffolder scaffolds a genome using an existing high quality genome as the reference. It aligns the two genomes using nucmer utility from MUMmer and then orders and orients the contigs of the candidate genome guided by their alignments to the reference genome. Please send your questions and comments to&nbsp;<a href="mailto:mchakrab@uci.edu">mchakrab@uci.edu</a>.</p>
<p><span>Citation</span><span>&nbsp;</span><a href="https://www.nature.com/articles/s41588-017-0010-y">https://www.nature.com/articles/s41588-017-0010-y</a></p><p>Address of the bookmark: <a href="https://github.com/mahulchak/mscaffolder" rel="nofollow">https://github.com/mahulchak/mscaffolder</a></p>]]></description>
	<dc:creator>Jit</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/29957/record</guid>
	<pubDate>Fri, 25 Nov 2016 08:23:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29957/record</link>
	<title><![CDATA[RECORD]]></title>
	<description><![CDATA[<p>Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome studied in the experiment and the reference genome of the species. However, in most typical protocols, this information is disregarded and the reference genome is used. Results. We provide a new approach that allows researchers to reconstruct genomes very closely related to the reference genome (e.g., mutants of the same species) directly from the reads used in the experiment. Our approach applies de novo assembly software to experimental reads and so-called pseudoreads and uses the resulting contigs to generate a modified reference sequence. In this way, it can very quickly, and at no additional sequencing cost, generate new, modified reference sequence that is closer to the actual sequenced genome and has a full coverage. In this paper, we describe our approach and test its implementation called RECORD. We evaluate RECORD on both simulated and real data. We made our software publicly available on sourceforge. Conclusion. Our tests show that on closely related sequences RECORD outperforms more general assisted-assembly software.</p>
<p>More at&nbsp;https://sourceforge.net/projects/record-genome-assembler/files/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pubmed/26558255" rel="nofollow">https://www.ncbi.nlm.nih.gov/pubmed/26558255</a></p>]]></description>
	<dc:creator>Bulbul</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36594/fragscaff-genome-assembly-with-contiguity-preserving-transposition</guid>
	<pubDate>Mon, 14 May 2018 04:28:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36594/fragscaff-genome-assembly-with-contiguity-preserving-transposition</link>
	<title><![CDATA[fragScaff: Genome Assembly with Contiguity Preserving Transposition]]></title>
	<description><![CDATA[<p>Contiguity preserving transposition and sequencing (CPT-seq) is an entirely in vitro means of generating libraries comprised of 9216 indexed pools, each of which contains thousands of sparsely sequenced long fragments ranging from 5 kilobases to &gt;1 megabase. This software, fragScaff, leverages coincidences between the content of different pools as a source of contiguity information for scaffolding de novo genome assemblies. FragScaff is complementary to Lachesis, providing midrange contiguity to support robust, accurate chromosome-scale de novo genome assemblies without the need for laborious in vivo cloning steps.</p>
<p>Further information about fragScaff, including source code, is available at:<a href="https://sourceforge.net/projects/fragscaff/files/">https://sourceforge.net/projects/fragscaff/files</a>.</p>
<p>Manuscript describing fragScaff was published as: Adey A, Kitzman JO, Burton JN, Daza R, Kumar A, Christiansen L, Ronaghi M, Amini S, L Gunderson K, Steemers FJ, Shendure J#.&nbsp;<em>In vitro, long-range sequence information for de novo genome assembly via transposase contiguity.</em>&nbsp;Genome Research 2014 Dec;24(12):2041-9. doi:&nbsp;<a href="http://dx.doi.org/10.1101/gr.178319.114">10.1101/gr.178319.114</a>. PubMed PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/25327137">25327137</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/fragscaff/files/" rel="nofollow">https://sourceforge.net/projects/fragscaff/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</guid>
	<pubDate>Tue, 05 Jun 2018 09:57:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</link>
	<title><![CDATA[PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach]]></title>
	<description><![CDATA[PERGA - Paired End Reads Guided Assembler

PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate.

The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.<p>Address of the bookmark: <a href="https://github.com/hitbio/PERGA" rel="nofollow">https://github.com/hitbio/PERGA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</guid>
	<pubDate>Thu, 26 Jul 2018 04:51:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</link>
	<title><![CDATA[Nanopolis: polish a genome assembly]]></title>
	<description><![CDATA[<p><span>Software package for signal-level analysis of Oxford Nanopore sequencing data. Nanopolish can calculate an improved consensus sequence for a draft genome assembly, detect base modifications, call SNPs and indels with respect to a reference genome and more (see Nanopolish modules, below).</span></p>
<p>Quickstart</p>
<p>http://nanopolish.readthedocs.io/en/latest/quickstart_consensus.html</p>
<p>Algorithms</p>
<p>http://simpsonlab.github.io/2017/06/30/nanopolish-v0.7.0/</p><p>Address of the bookmark: <a href="https://github.com/jts/nanopolish" rel="nofollow">https://github.com/jts/nanopolish</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</guid>
	<pubDate>Mon, 07 Jan 2019 08:40:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</link>
	<title><![CDATA[CANU genome assembly parameters !]]></title>
	<description><![CDATA[<p>Choose the appropriate parameters to run Canu and run it. The assembly will take about an hour. You can use two cores (parameter&nbsp;<code>-maxThreads=2</code>) and you would like to disable cluster option, since we compute on a single Amazon server set off the option to compute on cluster&nbsp;<code>useGrid=false</code>. This specifications should be for your project discussed with a local computing guru. The parameters that are in square brackets&nbsp;<code>[]</code>&nbsp;are optional, symbol&nbsp;<code>|</code>&nbsp;stands for "or".</p><pre><code>usage:   canu [-correct | -trim | -assemble | -trim-assemble] \
              [-s ] \
               -p  \
               -d  \
               genomeSize=[g|m|k] \
               -maxThreads=2 \
               useGrid=false \
              [other-options] \
               read_file.fastq.gz
</code></pre><p>A default&nbsp;<code>Canu</code>&nbsp;run produces usually high quality assembly, example of a command that was used for testing can be found below. However, there are still a lot of parameters that are possible to tweak. For example if we desire to assemble haplotypes separately of if we want to smash them together, we can alternate the error correction process.</p><pre><code>canu -p test_asmbl \
     -d asm_test3 \
     genomeSize=2m \
     -maxThreads=2 useGrid=false \
     -pacbio-raw \ ~/pacbio/dna/sample_reads.fastq.gz</code></pre><p>There is a brilliant&nbsp;<a href="http://canu.readthedocs.io/en/latest/faq.html#what-parameters-can-i-tweak">section in documentation</a>&nbsp;about parameter tweaking.</p><p>The output directory contains will contain many files. The most interesting ones are:</p><ul>
<li><code>*.correctedReads.fasta.gz</code>&nbsp;: file containing the input sequences after correction, trim and split based on consensus evidence.</li>
<li><code>*.trimmedReads.fastq</code>&nbsp;: file containing the sequences after correction and final trimming</li>
<li><code>*.layout</code>&nbsp;: file containing informations about read inclusion in the final assembly</li>
<li><code>*.gfa</code>&nbsp;: file containing the assembly graph by Canu</li>
<li><code>*.contigs.fasta</code>&nbsp;: file containing everything that could be assembled and is part of the primary assembly</li>
</ul><p>The basic stats of assembly can be read from reports generated by the assembler, or calculated using standard UNIX command line tools.</p><p>More at&nbsp;https://canu.readthedocs.io/en/latest/faq.html</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40994/biological-databases</guid>
	<pubDate>Wed, 12 Feb 2020 01:16:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40994/biological-databases</link>
	<title><![CDATA[Biological databases !]]></title>
	<description><![CDATA[<p>Now a days there are a lots of genomics databases available around the world. This bookmark is created to provide all links in one place ...</p>
<p>ftp://ftp.ncbi.nih.gov/genomes/</p>
<p>https://hgdownload.soe.ucsc.edu/downloads.html</p><p>Address of the bookmark: <a href="ftp://ftp.ncbi.nih.gov/genomes/" rel="nofollow">ftp://ftp.ncbi.nih.gov/genomes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>