<?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/34718?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/34718?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</guid>
	<pubDate>Fri, 04 May 2018 19:18:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</link>
	<title><![CDATA[The MARVEL assembler]]></title>
	<description><![CDATA[<p><span>MARVEL consists of a set of tools that facilitate the overlapping, patching, correction and assembly of noisy (not so noisy ones as well) long reads.</span></p>
<p>The assembly process can be summarized as follows:</p>
<ol>
<li>overlap</li>
<li>patch reads</li>
<li>overlap (again)</li>
<li>scrubbing</li>
<li>assembly graph construction and touring</li>
<li>optional read correction</li>
<li>fasta file creation</li>
</ol><p>Address of the bookmark: <a href="https://github.com/schloi/MARVEL" rel="nofollow">https://github.com/schloi/MARVEL</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39903/integrative-meta-assembly-pipeline-imap-chromosome-level-genome-assembler-combining-multiple-de-novo-assemblies</guid>
	<pubDate>Sat, 31 Aug 2019 11:30:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39903/integrative-meta-assembly-pipeline-imap-chromosome-level-genome-assembler-combining-multiple-de-novo-assemblies</link>
	<title><![CDATA[Integrative Meta-Assembly Pipeline (IMAP): Chromosome-level genome assembler combining multiple de novo assemblies]]></title>
	<description><![CDATA[<p><span>Chromosome-level genome assembler combining multiple de novo assemblies</span></p>
<p><span><a href="https://github.com/jkimlab/IMAP">https://github.com/jkimlab/IMAP</a></span></p><p>Address of the bookmark: <a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0221858" rel="nofollow">https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0221858</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40895/tadpole-an-assembler-error-corrector-and-read-extender</guid>
	<pubDate>Tue, 04 Feb 2020 23:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40895/tadpole-an-assembler-error-corrector-and-read-extender</link>
	<title><![CDATA[Tadpole: an assembler, error-corrector, and read-extender]]></title>
	<description><![CDATA[<p><span>Tadpole is a kmer-based assembler, with additional capabilities of error-correcting and extending reads. It does not do any complicated graph analysis or scaffolding, and therefore, is not particularly good for diploid organisms.&nbsp;</span><span>Tadpole is very conservative and optimized for correctness rather than length; which is to say, it stops at every branch, and condenses every repeat. Also, it does not currently do scaffolding.</span></p>
<p>&nbsp;</p>
<p><span><span>To error-correct reads:</span><br><strong>tadpole.sh in=reads.fq out=corrected.fq mode=correct</strong><br><br><span>To extend reads by 50bp in each direction:</span><br><strong>tadpole.sh in=reads.fq out=extended.fq mode=extend el=50 er=50</strong><br><br><span>To error-correct and extend at the same time, using a kmer length of 62:</span><br><strong>tadpole.sh in=reads.fq out=extended.fq mode=extend el=50 er=50 k=62 ecc=t</strong></span></p>
<p>&nbsp;</p>
<p>More at&nbsp;<a href="http://seqanswers.com/forums/showthread.php?t=61445">http://seqanswers.com/forums/showthread.php?t=61445</a></p><p>Address of the bookmark: <a href="https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/tadpole-guide/" rel="nofollow">https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/tadpole-guide/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</guid>
	<pubDate>Thu, 27 Sep 2018 07:08:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</link>
	<title><![CDATA[HaploMerger2: rebuilding both haploid sub-assemblies from high-heterozygosity diploid genome assembly]]></title>
	<description><![CDATA[<p><span><span>HM2 can process any diploid assemblies, but it is especially suitable for diploid assemblies with high heterozygosity (&ge;3%), which can be difficult for other tools. This pipeline also implements flexible and sensitive assembly error detection, a hierarchical scaffolding procedure and a reliable gap-closing method for haploid sub-assemblies.</span></span></p>
<p><span>Source code, executables and the testing dataset are freely available at&nbsp;</span><a href="https://github.com/mapleforest/HaploMerger2/releases/" target="">https://github.com/mapleforest/HaploMerger2/releases/</a><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/mapleforest/HaploMerger2/releases/" rel="nofollow">https://github.com/mapleforest/HaploMerger2/releases/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2699/translational-bioinformatics-transforming-300-billion-points-of-data</guid>
	<pubDate>Tue, 20 Aug 2013 19:03:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2699/translational-bioinformatics-transforming-300-billion-points-of-data</link>
	<title><![CDATA[Translational Bioinformatics: Transforming 300 Billion Points of Data]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/o4KNG7nd938" frameborder="0" allowfullscreen></iframe>Translational Bioinformatics: Transforming 300 Billion Points of Data into Diagnostics, Therapeutics, and New Insights into Disease      
      
Air date:  Wednesday, June 20, 2012, 3:00:00 PM
Time displayed is Eastern Time, Washington DC Local  
 
Description:  There is an urgent need to translate genome-era discoveries into clinical utility, but the difficulties in making bench-to-bedside translations haven't been well described. The nascent field of translational bioinformatics may help. Dr. Butte's lab at Stanford University builds and applies tools that convert more than 300 billion points of molecular, clinical, and epidemiological data (measured by researchers and clinicians over the past decade) into diagnostics, therapeutics, and new insights into disease. Dr. Butte, a bioinformatician and pediatric endocrinologist, will highlight his lab's work on using publicly available molecular measurements to find new uses for drugs, discovering new treatable mechanisms of disease in type 2 diabetes, and evaluating patients presenting with whole genomes sequenced. 

The NIH Wednesday Afternoon Lecture Series includes weekly scientific talks by some of the top researchers in the biomedical sciences worldwide. 

For more information, visit: 
The NIH Director's Wednesday Afternoon Lecture Series  
Author:  Atul Butte, M.D., Ph.D., Stanford University  
Runtime:  01:07:42  
Permanent link:  http://videocast.nih.gov/launch.asp?17321]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32851/anges-reconstructing-ancestral-genomes-maps</guid>
	<pubDate>Thu, 18 May 2017 05:27:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32851/anges-reconstructing-ancestral-genomes-maps</link>
	<title><![CDATA[ANGES: reconstructing ANcestral GEnomeS maps]]></title>
	<description><![CDATA[<p>This page contains the software ANGES 1.01, that aims at reconstucting ancestral genome maps from homologous markers in extant related genomes.</p>
<h3>Download</h3>
<ul>
<li><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/anges_1.01.tar.gz">Program, version 1.01</a>&nbsp;(July 10, 2012, documentation updated in August 2014)</li>
<li><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/anges_1.01_examples_with_results.tar.gz">Examples with results (featured ancestors: boreoeutherian, amniote, yeasts, Burkholderia, monocots)</a>; please refer to the documentation of the distribution above.</li>
</ul><p>Address of the bookmark: <a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" rel="nofollow">http://paleogenomics.irmacs.sfu.ca/ANGES/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40385/598-indian-genomes-from-55-ethnic-groups-sequenced</guid>
	<pubDate>Fri, 13 Dec 2019 20:31:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40385/598-indian-genomes-from-55-ethnic-groups-sequenced</link>
	<title><![CDATA[598 Indian Genomes from 55 ethnic groups Sequenced]]></title>
	<description><![CDATA[<ul>
<li><strong>This study reports sequence from 1,267 individuals that includes 598 individuals representing 55 ethnic groups that span the major language groups across India.</strong></li>
</ul><ul>
<li><strong>Importantly, this study found many large population groups from India in which individuals were more related to each other by descent. These groups are similar to the Finnish population group where many disease gene discoveries were made. The Finnish-equivalent Indian groups are going to be a great resource for disease gene discovery and they will aid in target identification, drug development and disease management.</strong><strong style="font-size: 12.8px;">&nbsp;</strong></li>
</ul><ul>
<li><strong>This study has identified many genetic variants that are specific to Indian population groups that were previously not known. Some of these are common variants in the Indian groups, but when first identified by previous studies from India involving smaller sample size, they were thought to be disease causing (for example in diabetes) as they were not represented in the Eurocentric variant database.&nbsp;</strong></li>
</ul><p><strong><img src="https://media.springernature.com/full/springer-static/image/art%3A10.1038%2Fs41586-019-1793-z/MediaObjects/41586_2019_1793_Fig1_HTML.png" alt="image" style="border: 0px;"></strong></p><ul>
<li><strong>Several variants that pre-dispose individuals to higher cancer risk were identified in this study. Once this part of the work is expanded, the data from this can be used to screen individuals to understand the disease risk and provide appropriate monitoring and proactive treatment. Similarly, variants linked to increase in adverse effect in individuals for certain drugs were found. Understanding this will allow doctors to provide alternate safer drugs to such patients.</strong></li>
</ul><p><strong>More at&nbsp;<a href="https://www.nature.com/articles/s41586-019-1793-z">https://www.nature.com/articles/s41586-019-1793-z</a></strong></p><p><strong><a href="https://www.nature.com/nature/volumes/576/issues/7785">https://www.nature.com/nature/volumes/576/issues/7785</a></strong></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44635/1000-genomes-chile-project</guid>
	<pubDate>Thu, 08 Aug 2024 01:24:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44635/1000-genomes-chile-project</link>
	<title><![CDATA[1000 Genomes Chile Project]]></title>
	<description><![CDATA[<p>Welcome to Chile Sequence to Chile: A Genomic Exploration Project for the Future Genomics, the science that deciphers the complexity of DNA, immerses us in the world of life at its most basic level. On this journey into the depths of genetic information, we find the 1000 Genomes Chile Project, an initiative that seeks to explore and understand the genetic wealth of our country.</p>
<p>Deciphering Life at the Molecular Level DNA sequencing is the key that opens the door to invaluable knowledge. By understanding the genes that make up Chilean species, we unravel the secrets of their evolution, their resistance and their adaptation to the environment. In a world where biodiversity faces constant threats, sequencing becomes crucial for the conservation and understanding of our natural heritage.</p>
<p>Involving Everyone: A Nationwide Effort The 1000 Genomes Chile Project is not just a task for scientists. It is a country-wide effort that seeks the participation of everyone: from citizens to the government to the private sector. We believe in the importance of sharing knowledge, involving society in the selection of species to sequence, in monitoring progress and in applying the results to preserve our environment.</p><p>Address of the bookmark: <a href="https://1000genomas.cl/" rel="nofollow">https://1000genomas.cl/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</guid>
	<pubDate>Fri, 10 Nov 2017 03:58:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</link>
	<title><![CDATA[Unicycler: Hybrid assembly pipeline for bacterial genomes]]></title>
	<description><![CDATA[<p><span>Unicycler is an assembly pipeline for bacterial genomes. It can assemble&nbsp;</span><a href="http://www.illumina.com/">Illumina</a><span>-only read sets where it functions as a&nbsp;</span><a href="http://cab.spbu.ru/software/spades/">SPAdes</a><span>-optimiser. It can also assembly long-read-only sets (</span><a href="http://www.pacb.com/">PacBio</a><span>&nbsp;or&nbsp;</span><a href="https://nanoporetech.com/">Nanopore</a><span>) where it runs a&nbsp;</span><a href="https://github.com/lh3/miniasm">miniasm</a><span>+</span><a href="https://github.com/isovic/racon">Racon</a><span>&nbsp;pipeline. For the best possible assemblies, give it both Illumina reads&nbsp;</span><em>and</em><span>&nbsp;long reads, and it will conduct a hybrid assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/rrwick/Unicycler" rel="nofollow">https://github.com/rrwick/Unicycler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>