<?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/30440?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/30440?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</guid>
	<pubDate>Fri, 26 Aug 2016 07:26:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</link>
	<title><![CDATA[Gene Finding and Predictions]]></title>
	<description><![CDATA[<p><span>In this exercise, a previously annotated gene will be used to measure the accuracy of different gene finding approaches. GRAIL, GENSCAN,&nbsp;</span><tt>geneid</tt><span>, FGENESH, GenomeScan, GrailEXP and GENEWISE will be used to annotate the sequence. Both search by signal, content and homology (protein and cDNA sequences) methods will be employed in order to improve the ab initio results. Weak conservation of Start codons will lead to wrong prediction of initial exons in most cases.</span></p>
<p>http://genome.crg.es/courses/Bioinformatics2003_genefinding/</p><p>Address of the bookmark: <a href="http://genome.crg.es/courses/Bioinformatics2003_genefinding/" rel="nofollow">http://genome.crg.es/courses/Bioinformatics2003_genefinding/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28937/sushi-an-rbioconductor-package-for-visualizing-genomic-data</guid>
	<pubDate>Wed, 31 Aug 2016 08:29:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28937/sushi-an-rbioconductor-package-for-visualizing-genomic-data</link>
	<title><![CDATA[Sushi: An R/Bioconductor package for visualizing genomic data]]></title>
	<description><![CDATA[<p>Sushi: An R/Bioconductor package for visualizing genomic data</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/Sushi/inst/doc/Sushi.pdf" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/Sushi/inst/doc/Sushi.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29008/circos-visualize</guid>
	<pubDate>Fri, 02 Sep 2016 08:29:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29008/circos-visualize</link>
	<title><![CDATA[CIRCOS Visualize !!]]></title>
	<description><![CDATA[<p>Before uploading a data file, check the&nbsp;<a href="http://mkweb.bcgsc.ca/tableviewer/samples">samples gallery</a>&nbsp;to make sure that your data format is compatible.</p>
<ul>
<li>Your file must be&nbsp;<strong>plain text</strong>.</li>
<li>Your data values must be&nbsp;<strong>non-negative integers</strong>.</li>
<li>Data must be space-separated (<strong>one or more</strong>&nbsp;tab or space, which will be collapsed).</li>
<li>No two rows or columns may have the same name.</li>
<li>Column and row names must&nbsp;<strong>begin with a letter</strong>&nbsp;(e.g. 'A', 'A0', 'A-0') and can only contain letters, numbers and _. No punctuation!</li>
<li>Maximum row + column total is 150 &mdash; if exceeded, rows and columns are limited to 75.</li>
<li>If you are using order, size and color rows/columns in combination they must appear in that order.</li>
</ul>
<p>Need help? Post questions to the&nbsp;<a href="https://groups.google.com/forum/#!forum/circos-data-visualization">Circos Google Group</a>.</p>
<p>http://mkweb.bcgsc.ca/tableviewer/visualize/</p><p>Address of the bookmark: <a href="http://mkweb.bcgsc.ca/tableviewer/visualize/" rel="nofollow">http://mkweb.bcgsc.ca/tableviewer/visualize/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37840/long-read-assembly-workshop</guid>
	<pubDate>Thu, 04 Oct 2018 17:23:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37840/long-read-assembly-workshop</link>
	<title><![CDATA[Long read assembly workshop !]]></title>
	<description><![CDATA[<p>This is a tutorial for a workshop on long-read (PacBio) genome assembly.</p>
<p>It demonstrates how to use long PacBio sequencing reads to assemble a bacterial genome, and includes additional steps for circularising, trimming, finding plasmids, and correcting the assembly with short-read Illumina data.</p>
<p>&nbsp;Please comment if you know any other long read addembly tutorial.</p><p>Address of the bookmark: <a href="http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/" rel="nofollow">http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29110/structural-variants-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29110/structural-variants-ppt</link>
	<title><![CDATA[Structural variants PPT]]></title>
	<description><![CDATA[<p>1000 Genomes data tutorial at ASHG</p><p>Structural variants presentation by</p><p>Jan Korbel</p><p>European Molecular Biology Laboratory (EMBL) Heidelberg Genome Biology Research Unit</p><p>Reference:&nbsp;</p><p>https://www.genome.gov/pages/research/der/1000genomesprojecttutorials/structuralvariants-jankorbel.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29110" length="1090837" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</guid>
	<pubDate>Sat, 01 Oct 2016 14:45:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</link>
	<title><![CDATA[Nemo – A stochastic, individual-base, genetically explicit simulation platform]]></title>
	<description><![CDATA[<ul>
<li>
<p>A&nbsp;<strong>recombination map</strong>&nbsp;has been added for all multi-locus traits. The map positions (chromosomal) for neutral markers (e.g. SNPs) and loci under selection (QTLs, deleterious mutations, DMIs) can now be specified explicitly, or set at random. The map can hold an unlimited number of loci of different types jointly, at any recombination scale (cM or lower). The effects of linkage can thus be finely explored.</p>
</li>
<li>
<p>A new trait coding for (Bateson-)<strong>Dobzhansky-Muller incompatibility loci</strong>. Multiple haploid or diploid pairs of incompatible loci can be spread throughout the genome and affect individual fitness.</p>
</li>
<li>
<p><strong>Multi-type selection</strong>:&nbsp;<a href="http://nemo2.sourceforge.net/classIndividual.html" title="This class contains traits along with other individual information (sex, pedigree, etc. ).">Individual</a>&nbsp;fitness can be jointly determined by different types of loci under selectinon, such as QTLs coding for quantitative traits under spatially variable selection, universally deleterious mutations, and Dobzhansky-Muller incompatibility loci.</p>
</li>
<li>
<p><strong>An unlimited number of quantitative traits</strong>&nbsp;under different forms of selection can be modelled, based on universally pleiotropic loci with several bi- or multi-allelic models.</p>
</li>
<li>
<p><strong>Spatial and temporal variation of selection</strong>&nbsp;on quantitative traits is possible, modelling shifts of environmental conditions over time.</p>
</li>
<li>
<p>The dispersal matrix describing the movement of individuals among sub-populations can be replaced by a connectivity matrix and a reduced dispersal matrix describing migration only among the connected sub-populations. This offers a substantial gain in computing time and system memory when simulating very large grids.</p>
</li>
<li>
<p>Input parameters' arguments may be specified in separate files. This is particularly convenient when specifying large matrices.</p>
</li>
<li>
<p>Many adjustments have been made for refined control of the input of parameters and data output. See updates in the manual.</p>
</li>
</ul><p>Address of the bookmark: <a href="http://nemo2.sourceforge.net/index.html" rel="nofollow">http://nemo2.sourceforge.net/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40598/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</guid>
	<pubDate>Fri, 24 Jan 2020 04:09:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40598/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</link>
	<title><![CDATA[MitoZ: a toolkit for animal mitochondrial genome assembly, annotation and visualization]]></title>
	<description><![CDATA[<p><span>MitoZ is a Python3-based toolkit which aims to automatically filter pair-end raw data (fastq files), assemble genome, search for mitogenome sequences from the genome assembly result, annotate mitogenome (genbank file as result), and mitogenome visualization. MitoZ is available from&nbsp;</span><code>https://github.com/linzhi2013/MitoZ</code><span>.</span></p>
<p><span><a href="https://academic.oup.com/nar/article/47/11/e63/5377471">https://academic.oup.com/nar/article/47/11/e63/5377471</a></span></p><p>Address of the bookmark: <a href="https://github.com/linzhi2013/MitoZ" rel="nofollow">https://github.com/linzhi2013/MitoZ</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29628/links</guid>
	<pubDate>Fri, 04 Nov 2016 06:19:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29628/links</link>
	<title><![CDATA[LINKS]]></title>
	<description><![CDATA[<p>LINKS is a genomics application for scaffolding genome assemblies with long reads, such as those produced by Oxford Nanopore Technologies Ltd. It can be used to scaffold high-quality draft genome assemblies with any long sequences (eg. ONT reads, PacBio reads, another draft genomes, etc)</p>
<p>Paper at&nbsp;https://gigascience.biomedcentral.com/articles/10.1186/s13742-015-0076-3</p><p>Address of the bookmark: <a href="https://github.com/warrenlr/LINKS/" rel="nofollow">https://github.com/warrenlr/LINKS/</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>

</channel>
</rss>