<?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/32709?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/32709?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/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/43736/odgi-optimized-dynamic-genomegraph-implementation</guid>
	<pubDate>Tue, 01 Feb 2022 23:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</link>
	<title><![CDATA[odgi: optimized dynamic genome/graph implementation]]></title>
	<description><![CDATA[<p dir="auto"><code>odgi</code>&nbsp;provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.</p>
<p dir="auto">Careful encoding of graph entities allows&nbsp;<code>odgi</code>&nbsp;to efficiently compute and transform&nbsp;<a href="https://pangenome.github.io/">pangenomes</a>&nbsp;with minimal overheads.&nbsp;<code>odgi</code>&nbsp;implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.</p>
<p dir="auto">The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.</p>
<p dir="auto">The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.</p><p>Address of the bookmark: <a href="https://github.com/pangenome/odgi" rel="nofollow">https://github.com/pangenome/odgi</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26325/crossmap</guid>
	<pubDate>Mon, 08 Feb 2016 15:47:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26325/crossmap</link>
	<title><![CDATA[CrossMap]]></title>
	<description><![CDATA[<p>CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between <em>different assemblies</em> (such as Human <a href="http://www.ncbi.nlm.nih.gov/assembly/2928/">hg18 (NCBI36)</a> &lt;&gt; <a href="http://www.ncbi.nlm.nih.gov/assembly/2758/">hg19 (GRCh37)</a>, Mouse <a href="http://www.ncbi.nlm.nih.gov/assembly/165668/">mm9 (MGSCv37)</a> &lt;&gt; <a href="http://www.ncbi.nlm.nih.gov/assembly/327618/">mm10 (GRCm38)</a>).</p>
<p>It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.</p>
<p>CrossMap is designed to liftover genome coordinates between assemblies. It&rsquo;s <em>not</em> a program for aligning sequences to reference genome.</p>
<p>We <em>do not</em> recommend using CrossMap to convert genome coordinates between species.</p>
<p>More at http://crossmap.sourceforge.net/</p><p>Address of the bookmark: <a href="http://crossmap.sourceforge.net/" rel="nofollow">http://crossmap.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</guid>
	<pubDate>Fri, 29 Apr 2016 05:49:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</link>
	<title><![CDATA[Easyfig]]></title>
	<description><![CDATA[<p>Easyfig has moved to github, for newer releases of Easyfig please visit our new webpage - https://mjsull.github.io/Easyfig.&nbsp; Easyfig is a Python application for creating linear comparison figures of multiple genomic loci with an easy-to-use graphical user interface (GUI).</p>
<p>More at http://easyfig.sourceforge.net/</p><p>Address of the bookmark: <a href="http://easyfig.sourceforge.net/" rel="nofollow">http://easyfig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</guid>
	<pubDate>Tue, 10 May 2016 07:46:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</link>
	<title><![CDATA[BUSCO: Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs]]></title>
	<description><![CDATA[<ul>
<li><span>High-throughput genomics has revolutionized biological research, however, while the number of sequenced genomes grows by the day, quality assessment of the resulting assembled sequences remains complicated and mostly limited to technical measures like N50.&nbsp;</span></li>
<li></li>
<li><span>BUSCO provides measures for quantitative assessment of genome assembly, gene set, and transcriptome completeness based on evolutionarily informed expectations of gene content from near-universal single-copy orthologs selected from&nbsp;</span><a href="http://orthodb.org/">OrthoDB</a><span>.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments are implemented in open-source software, with comprehensive lineage-specific sets of Benchmarking Universal Single-Copy Orthologs for arthropods, vertebrates, metazoans, fungi, eukaryotes, and bacteria.&nbsp;</span></li>
<li></li>
<li><span>These conserved orthologs are ideal candidates for large-scale phylogenomics studies, and the annotated BUSCO gene models built during genome assessments provide a comprehensive gene predictor training set for use as part of genome annotation pipelines.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments offer intuitive metrics, based on evolutionarily informed expectations of gene content from hundreds of species, to gauge completeness of rapidly accumulating genomic data and satisfy an Iberian's quest for quality - "Busco calidad/qualidade".</span></li>
</ul><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27806/blobology</guid>
	<pubDate>Mon, 13 Jun 2016 10:18:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27806/blobology</link>
	<title><![CDATA[Blobology]]></title>
	<description><![CDATA[<p><span>Tools for making blobplots or Taxon-Annotated-GC-Coverage plots (TAGC plots) to visualise the contents of genome assembly data sets as a QC step</span></p>
<p>Blaxter Lab, Institute of Evolutionary Biology, University of Edinburgh</p>
<p><span>Goal</span>: To create blobplots or Taxon-Annotated-GC-Coverage plots (TAGC plots) to visualise the contents of genome assembly data sets as a QC step.</p>
<p>This repository accompanies the paper:<br><span>Blobology: exploring raw genome data for contaminants, symbionts and parasites using taxon-annotated GC-coverage plots.</span>&nbsp;<em>Sujai Kumar, Martin Jones, Georgios Koutsovoulos, Michael Clarke, Mark Blaxter</em><br>(submitted 2013-10-01 to&nbsp;<em>Frontiers in Bioinformatics and Computational Biology special issue : Quality assessment and control of high-throughput sequencing data</em>).</p>
<p>It contains bash/perl/R scripts for running the analysis presented in the paper to create a preliminary assembly, and to create and collate GC content, read coverage and taxon annotation for the preliminary assembly, which can be visualised, such as Figure 2a from the paper showing TAGC plots/blobplots for&nbsp;<em>Caenorhabditis</em>&nbsp;sp. 5:&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/blaxterlab/blobology" rel="nofollow">https://github.com/blaxterlab/blobology</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29995/hga</guid>
	<pubDate>Tue, 29 Nov 2016 07:25:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29995/hga</link>
	<title><![CDATA[HGA]]></title>
	<description><![CDATA[<p>HGA tool version 1.0 This tool helps to apply the Hierarchical Genome Assembly (HGA) method. The tool will apply: 1. Partitioning a given reads dataset into a given number of partitions. 2. Assembling each partitions using a pre-specified assembler (Velvet or SPAdes in this version) and using a given kmer size. 3. Merging all the assemblies of the partition. 4. Combining all the assemblies of the partition (using velvet with kmer value of 31). 5. Finaly, re-assembling the whole dataset with the merged contigs or the combined contigs, using a given kmer size.</p>
<p>https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</p><p>Address of the bookmark: <a href="https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA" rel="nofollow">https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>