<?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/43791?offset=490</link>
	<atom:link href="https://bioinformaticsonline.com/related/43791?offset=490" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38008/quast-lg-versatile-genome-assembly-evaluation</guid>
	<pubDate>Thu, 25 Oct 2018 10:46:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38008/quast-lg-versatile-genome-assembly-evaluation</link>
	<title><![CDATA[QUAST-LG: Versatile genome assembly evaluation]]></title>
	<description><![CDATA[<p>QUAST-LG-a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we introduce a concept of upper bound assembly for a given genome and set of reads, and compute theoretical limits on assembly correctness and completeness. Using QUAST-LG, we show how close the assemblies are to the theoretical optimum, and how far this optimum is from the finished reference.</p>
<h4>AVAILABILITY AND IMPLEMENTATION:</h4>
<p>http://cab.spbu.ru/software/quast-lg</p><p>Address of the bookmark: <a href="http://cab.spbu.ru/software/quast-lg/" rel="nofollow">http://cab.spbu.ru/software/quast-lg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</guid>
	<pubDate>Thu, 15 Nov 2018 12:48:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</link>
	<title><![CDATA[NovoGraph: building whole genome graphs from long-read-based de novo assemblies]]></title>
	<description><![CDATA[<p><span>NovoGraph: building whole genome graphs from long-read-based de novo assemblies</span></p>
<p><span><span>An algorithmically novel approach to construct a genome graph representation of long-read-based&nbsp;</span><em>de novo</em><span>&nbsp;sequence assemblies. We then provide a proof of principle by creating a genome graph of seven ethnically-diverse human genomes.</span></span></p>
<p>&nbsp;</p>
<p>https://f1000research.com/articles/7-1391/v1</p><p>Address of the bookmark: <a href="https://github.com/NCBI-Hackathons/NovoGraph" rel="nofollow">https://github.com/NCBI-Hackathons/NovoGraph</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</guid>
	<pubDate>Mon, 17 Dec 2018 03:17:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</link>
	<title><![CDATA[Purge Haplotigs: Pipeline to help with curating heterozygous diploid genome assemblies]]></title>
	<description><![CDATA[<p>Some parts of a genome may have a very high degree of heterozygosity. This causes contigs for both haplotypes of that part of the genome to be assembled as separate primary contigs, rather than as a contig and an associated haplotig. This can be an issue for downstream analysis whether you're working on the haploid or phased-diploid assembly.</p>
<p><span>Identify pairs of contigs that are syntenic and move one of them to the haplotig 'pool'. The pipeline uses mapped read coverage and Minimap2 alignments to determine which contigs to keep for the haploid assembly. Dotplots are optionally produced for all flagged contig matches, juxtaposed with read-coverage, to help the user determine the proper assignment of any remaining ambiguous contigs. The pipeline will run on either a haploid assembly (i.e. Canu, FALCON or FALCON-Unzip primary contigs) or on a phased-diploid assembly (i.e. FALCON-Unzip primary contigs + haplotigs). Here are&nbsp;</span><a href="https://bitbucket.org/mroachawri/purge_haplotigs/wiki/Examples">two examples</a><span>&nbsp;of how Purge Haplotigs can improve a haploid and diploid assembly.</span></p><p>Address of the bookmark: <a href="https://bitbucket.org/mroachawri/purge_haplotigs" rel="nofollow">https://bitbucket.org/mroachawri/purge_haplotigs</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38579/genomeview-genome-browser-and-annotation-editor</guid>
	<pubDate>Wed, 02 Jan 2019 04:09:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38579/genomeview-genome-browser-and-annotation-editor</link>
	<title><![CDATA[GenomeView: genome browser and annotation editor]]></title>
	<description><![CDATA[<p><span>GenomeView is a genome browser and annotation editor that displays reference sequence, annotation, multiple alignments, short read alignments and graphs. Most major data formats are supported. Local and internet files can be loaded.</span><br><span>This project has moved to GitHub:&nbsp;</span><a href="https://github.com/GenomeView/genomeview" target="_blank">https://github.com/GenomeView/genomeview</a></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genomeview/" rel="nofollow">https://sourceforge.net/projects/genomeview/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/39704/the-rogers-lab</guid>
  <pubDate>Mon, 15 Jul 2019 08:07:44 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Rogers Lab]]></title>
  <description><![CDATA[
<p>The Rogers lab studies evolution of genome structure. We explore the ways that complex mutations like duplications, deletions, rearrangements, and retrogenes can create new genetic material. We study how these new mutations are important for adaptation. We are currently working on projects in Drosophila, Mammoths, Elephants, Bivalves, and Frogs absolutely no amphibians. This multi-organism approach can help us understand when and why complex mutations are important for organism fitness.</p>

<p>More at http://evolscientist.com/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</guid>
	<pubDate>Tue, 22 Oct 2019 22:05:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</link>
	<title><![CDATA[ALF--a simulation framework for genome evolution.]]></title>
	<description><![CDATA[<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;"><span style="color: #4d4d4d; font-size: small; font-style: normal; font-weight: 400; text-align: left; background-color: #ffffff; float: none;">Artificial Life Framework (ALF)</span> simulates a root genome into a number of related genomes. Result files include the resulting gene sequences, true tree and true MSAs. A description of ALF can be found in the following article:</p>
<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;">Daniel A Dalquen, Maria Anisimova, Gaston H Gonnet, Christophe Dessimoz: ALF - A Simulation Framework for Genome Evolution.<span>&nbsp;</span><em>Mol Biol Evol</em>, 29(4):1115-1123, April 2012.<br><a href="http://mbe.oxfordjournals.org/content/29/4/1115" target="_blank">http://mbe.oxfordjournals.org/content/29/4/1115</a></p><p>Address of the bookmark: <a href="http://alfsim.org/#index" rel="nofollow">http://alfsim.org/#index</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/40881/liu-lab</guid>
  <pubDate>Tue, 04 Feb 2020 06:27:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[Liu Lab]]></title>
  <description><![CDATA[
<p>Shirley is a computational biologist with expertise in cancer epigenetics. Her research focuses on algorithm development and integrative mining from big data generated on microarrays, massively parallel sequencing, and other high throughput techniques to model the specificity and function of transcription factors, chromatin regulators and lncRNAs in tumor development, progression, drug response and resistance.</p>

<p>https://liulab-dfci.github.io/software/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41275/shinychromosomea-gui-for-the-interactive-creation-of-non-circular-whole-genome-diagrams</guid>
	<pubDate>Sat, 29 Feb 2020 00:39:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41275/shinychromosomea-gui-for-the-interactive-creation-of-non-circular-whole-genome-diagrams</link>
	<title><![CDATA[shinyChromosome:a GUI for the interactive creation of non-circular whole genome diagrams]]></title>
	<description><![CDATA[<p><code>shinyChromosome</code> is a graphical user interface for interactive creation of non-circular whole genome diagrams developed using the R <strong>Shiny</strong> package.</p>
<p>To create single-genome plot by aligning genome data along all chromosomes of a single genome, go to the <code>Single-genome plot</code> menu.</p>
<p>To cretae two-genome plot for comparison of data across two genomes, go to the <code>Two-genome plot</code> menu.</p>
<p>For the detail format of input data, check the <code>Input data format</code> submenu of the <code>Help</code> menu.</p>
<p>shinyChromosome is deployed at <a href="http://150.109.59.144:3838/shinyChromosome/" target="_blank">http://150.109.59.144:3838/shinyChromosome/</a>, <a href="http://shinyChromosome.ncpgr.cn" target="_blank">http://shinyChromosome.ncpgr.cn</a>, and <a href="https://yimingyu.shinyapps.io/shinyChromosome" target="_blank">https://yimingyu.shinyapps.io/shinyChromosome</a> for online use. The source code and manual of shinyChromosome are freely available at <a href="https://github.com/venyao/shinyChromosome" target="_blank">https://github.com/venyao/shinyChromosome</a>.</p>
<p>https://yimingyu.shinyapps.io/shinychromosome/</p>
<p>https://www.sciencedirect.com/science/article/pii/S1672022919301883</p><p>Address of the bookmark: <a href="https://yimingyu.shinyapps.io/shinychromosome/" rel="nofollow">https://yimingyu.shinyapps.io/shinychromosome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/42900/svardal-lab</guid>
  <pubDate>Sat, 20 Feb 2021 10:01:19 -0600</pubDate>
  <link></link>
  <title><![CDATA[Svardal lab]]></title>
  <description><![CDATA[
<p>In the Svardal lab they are interested how the astonishing natural diversity we see on earth came into being, by which forces it formed and how it is changing today. Hence, they are trying to understand the process of evolution, with mathematical models and through the analysis of genome sequencing data.</p>

<p>Genomes, and in particular differences between them, are a crucial source of information to understand evolution and biology in general. They provide a record of the evolutionary past of populations, their relatedness patterns, their demography, and their adaptations.</p>

<p>More at https://www.uantwerpen.be/en/staff/hannes-svardal/svardal-lab/</p>
]]></description>
</item>

</channel>
</rss>