<?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/27328?offset=230</link>
	<atom:link href="https://bioinformaticsonline.com/related/27328?offset=230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/29500/genomescope-open-source-web-tool-to-rapidly-estimate-the-overall-characteristics-of-a-genome-including-genome-size-heterozygosity-rate-and-repeat-content-from-unprocessed-short-reads</guid>
	<pubDate>Fri, 21 Oct 2016 05:46:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29500/genomescope-open-source-web-tool-to-rapidly-estimate-the-overall-characteristics-of-a-genome-including-genome-size-heterozygosity-rate-and-repeat-content-from-unprocessed-short-reads</link>
	<title><![CDATA[GenomeScope: open-source web tool to rapidly estimate the overall characteristics of a genome, including genome size, heterozygosity rate, and repeat content from unprocessed short reads]]></title>
	<description><![CDATA[<div>
<div>
<div>
<div id="content-block-markup">
<div>
<div id="abstract-1">
<p id="p-2">Summary: GenomeScope is an open-source web tool to rapidly estimate the overall characteristics of a genome, including genome size, heterozygosity rate, and repeat content from unprocessed short reads. These features are essential for studying genome evolution, and help to choose parameters for downstream analysis. We demonstrate its accuracy on 324 simulated and 16 real datasets with a wide range in genome sizes, heterozygosity levels, and error rates. Availability and Implementation: http://qb.cshl.edu/genomescope/, https://github.com/schatzlab/genomescope.git</p>
</div>
<span></span></div>
<span></span></div>
</div>
</div>
</div><p>Address of the bookmark: <a href="http://qb.cshl.edu/genomescope/" rel="nofollow">http://qb.cshl.edu/genomescope/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</guid>
	<pubDate>Tue, 05 Mar 2019 10:00:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</link>
	<title><![CDATA[SDA: Long-read sequence and assembly of segmental duplications]]></title>
	<description><![CDATA[<p><span><span>Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.<br></span></span></p>
<p><span><span>https://github.com/mvollger/SDA</span></span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/s41592-018-0236-3" rel="nofollow">https://www.nature.com/articles/s41592-018-0236-3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</guid>
	<pubDate>Thu, 03 Nov 2016 04:55:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</link>
	<title><![CDATA[Statistics Using R   with Biological Examples]]></title>
	<description><![CDATA[<p>This book is a manifestation of my desire to teach researchers in biology a bit more about statistics than an ordinary introductory course covers and to introduce the utilization of R as a tool for analyzing their data. My goal is to reach those with little or no training in higher level statistics so that they can do more of their own data analysis, communicate more with statisticians, and appreciate the great potential statistics has to offer as a tool to answer biological questions. </p><p>This is necessary in light of the increasing use of higher level statistics in biomedical research. I hope it accomplishes this mission and encourage its free distribution and use as a course text or supplement.</p><p>K Seefeld, May 2007</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29601" length="4581031" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42166/software-for-genome-assembly</guid>
	<pubDate>Sun, 30 Aug 2020 09:51:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42166/software-for-genome-assembly</link>
	<title><![CDATA[Software for genome assembly !]]></title>
	<description><![CDATA[<p>List of bioinformatics tools/Software Website References for genome assembly:</p><p>1 Falcon&nbsp;https://github.com/PacificBiosciences/pb-assembly</p><p>2 Canu assembler http://canu.readthedocs.io/en/latest/index.html</p><p>3 Miniasm assembler https://github.com/lh3/miniasm</p><p>4 PBJelly scaffolding tool https://sourceforge.net/projects/pb-jelly/</p><p>5 ARCS scaffolding tool https://github.com/bcgsc/arcs</p><p>6 Redundans reduction and scaffolding tool https://github.com/Gabaldonlab/redundans</p><p>7 Arrow error correction https://github.com/PacificBiosciences/ GenomicConsensus</p><p>8 PILON error correction https://github.com/broadinstitute/pilon/wiki</p><p>9 BUSCO single copy gene markers http://busco.ezlab.org/</p><p>10 Bandage graph assembly viewer https://rrwick.github.io/Bandage/</p><p>11 Gepard dotter http://cube.univie.ac.at/gepard</p><p>12 MUMmer aligner and plotter http://mummer.sourceforge.net/</p>]]></description>
	<dc:creator>LEGE</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/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</guid>
	<pubDate>Mon, 24 Jul 2023 07:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</link>
	<title><![CDATA[Bioinformatics tools for genome assembly !]]></title>
	<description><![CDATA[<p>There are numerous genome assembly tools available, each with its strengths and weaknesses. Here is a list of some widely used genome assembly tools as of my last update in September 2021:</p><ol>
<li>
<p><span>SPAdes:</span> An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.</p>
</li>
<li>
<p><span>ABySS:</span> A parallelized assembler for large genomes that uses de Bruijn graphs.</p>
</li>
<li>
<p><span>Velvet:</span> Another de Bruijn graph-based assembler optimized for short-read sequencing data.</p>
</li>
<li>
<p><span>SOAPdenovo:</span> A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.</p>
</li>
<li>
<p><span>MaSuRCA:</span> A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.</p>
</li>
<li>
<p><span>Canu:</span> A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.</p>
</li>
<li>
<p><span>Flye:</span> A long-read assembler suitable for bacterial and small eukaryotic genomes.</p>
</li>
<li>
<p><span>SMARTdenovo:</span> An assembler designed for long reads, particularly suited for PacBio data.</p>
</li>
<li>
<p><span>SPAdes Long Read (SPAdesLR):</span> An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.</p>
</li>
<li>
<p><span>Minia:</span> An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.</p>
</li>
<li>
<p><span>Unicycler:</span> A hybrid assembler that combines short and long reads for circular bacterial genome assembly.</p>
</li>
<li>
<p><span>wtdbg2:</span> A de Bruijn graph assembler for long reads, efficient for very large genomes.</p>
</li>
<li>
<p><span>Shasta:</span> A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.</p>
</li>
<li>
<p><span>Sparc:</span> An assembler designed to handle noisy long reads from Nanopore sequencing.</p>
</li>
<li>
<p><span>CANA:</span> An assembler for metagenomic data, particularly for complex and diverse microbial communities.</p>
</li>
<li>
<p><span>Ra</span> Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.</p>
</li>
</ol><p>Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</guid>
	<pubDate>Mon, 19 Dec 2016 14:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</link>
	<title><![CDATA[pyScaf]]></title>
	<description><![CDATA[<p>pyScaf orders contigs from genome assemblies utilising several types of information:</p>
<ul>
<li>paired-end (PE) and/or mate-pair libraries (<a href="https://github.com/lpryszcz/pyScaf#ngs-based-scaffolding">NGS-based mode</a>)</li>
<li>long reads (<a href="https://github.com/lpryszcz/pyScaf#scaffolding-based-on-long-reads">NGS-based mode</a>)</li>
<li>synteny to the genome of some related species (<a href="https://github.com/lpryszcz/pyScaf#reference-based-scaffolding">reference-based mode</a>)</li>
</ul>
<p>Scaffolding&nbsp;</p>
<p>In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.</p>
<p>Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:</p>
<ul>
<li>matches not satisfying cut-offs (<code>--identity</code>&nbsp;and&nbsp;<code>--overlap</code>)</li>
<li>suboptimal matches (only best match of each query to reference is kept)</li>
<li>and removing overlapping matches on reference.</li>
</ul>
<p>In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on&nbsp;<em>C. parapsilosis</em>&nbsp;(13 Mb; CANPA) and&nbsp;<em>A. thaliana</em>&nbsp;(119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (<a href="https://www.dropbox.com/sh/bb7lwggo40xrwtc/AAAZ7pByVQQQ-WhUXZVeJaZVa/pyScaf?dl=0">Figures in dropbox</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=2036953672">CANPA table</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=1920757821">ARATH table</a>).<br>Runs took ~0.5 min for CANPA on&nbsp;<code>4 CPUs</code>&nbsp;and ~2 min for ARATH on&nbsp;<code>16 CPUs</code>.</p>
<p><span>Important remarks:</span></p>
<ul>
<li>Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.</li>
<li>pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no&nbsp;<em>de novo assembler</em>&nbsp;/ scaffolder is perfect...), which breaks synteny.</li>
<li>pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.</li>
<li>pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations.&nbsp;<span>Note however, this is experimental implementation!</span></li>
<li>Consider closing gaps after scaffolding.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/lpryszcz/pyScaf" rel="nofollow">https://github.com/lpryszcz/pyScaf</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>

</channel>
</rss>