<?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/31105?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/31105?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29957/record</guid>
	<pubDate>Fri, 25 Nov 2016 08:23:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29957/record</link>
	<title><![CDATA[RECORD]]></title>
	<description><![CDATA[<p>Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome studied in the experiment and the reference genome of the species. However, in most typical protocols, this information is disregarded and the reference genome is used. Results. We provide a new approach that allows researchers to reconstruct genomes very closely related to the reference genome (e.g., mutants of the same species) directly from the reads used in the experiment. Our approach applies de novo assembly software to experimental reads and so-called pseudoreads and uses the resulting contigs to generate a modified reference sequence. In this way, it can very quickly, and at no additional sequencing cost, generate new, modified reference sequence that is closer to the actual sequenced genome and has a full coverage. In this paper, we describe our approach and test its implementation called RECORD. We evaluate RECORD on both simulated and real data. We made our software publicly available on sourceforge. Conclusion. Our tests show that on closely related sequences RECORD outperforms more general assisted-assembly software.</p>
<p>More at&nbsp;https://sourceforge.net/projects/record-genome-assembler/files/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pubmed/26558255" rel="nofollow">https://www.ncbi.nlm.nih.gov/pubmed/26558255</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30090/standardized-velvet-assembly-report</guid>
	<pubDate>Fri, 09 Dec 2016 03:59:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30090/standardized-velvet-assembly-report</link>
	<title><![CDATA[Standardized velvet assembly report]]></title>
	<description><![CDATA[<p>Requirements:</p>
<ul>
<li>velvet (velveth velvetg should be in your PATH)</li>
<li>R (with Sweave)</li>
<li>pdflatex (usually part of TeTeX)</li>
<li>ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable"))</li>
<li>Perl</li>
</ul>
<p>Optional:</p>
<ul>
<li>BLAT or BLAST (to generate alignments against a reference genome). If using BLAT, add faToTwoBit,gfClient,gfServer to your PATH. If using BLAST, add blastall and formatdb.</li>
</ul>
<p>Edit permute.sh to your liking, paying particular attention to the kmer, cvCut, expCov, and other flags</p>
<p>To Run:</p>
<ol>
<li><code>perl fastaAllSize mysequences.fa &gt; mysequences.stat or gunzip -c mysequences.fa.gz | fastaAllSize &gt; mysequences.stat</code>&nbsp;Substitute fastqAllSize for fastq files.</li>
<li><code>./permute.sh mysequences</code>&nbsp;(leave out the .fa)</li>
</ol>
<p>https://github.com/leipzig/standardized-velvet-assembly-report</p><p>Address of the bookmark: <a href="https://github.com/leipzig/standardized-velvet-assembly-report" rel="nofollow">https://github.com/leipzig/standardized-velvet-assembly-report</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</guid>
	<pubDate>Wed, 14 Dec 2016 15:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</link>
	<title><![CDATA[BIMA V3: an aligner customized for mate pair library sequencing]]></title>
	<description><![CDATA[<p>Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a challenging and <br>time consuming process for most NGS alignment programs. Large insert sizes, introduction of library preparation protocol artifacts (biotin junction reads, paired-end read contamination, chimeras, etc.), and presence of structural variant breakpoints within reads increases mapping and alignment complexity. We describe an algorithm that is up to 20 times faster and 25% more accurate than popular NGS alignment programs when processing mate pair sequencing. <br>Availability: http://bioinformaticstools.mayo.edu/research/bima/ <br>Contact: vasmatzis.george@mayo.edu</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30207/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</guid>
	<pubDate>Mon, 19 Dec 2016 06:07:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30207/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</link>
	<title><![CDATA[GAM-NGS: genomic assemblies merger for next generation sequencing]]></title>
	<description><![CDATA[<p><span>GAM-NGS (Genomic Assemblies Merger for Next Generation Sequencing), whose primary goal is to merge two or more assemblies in order to enhance contiguity and correctness of both. GAM-NGS does not rely on global alignment: regions of the two assemblies representing the same genomic&nbsp;</span><em>locus</em><span>&nbsp;(called&nbsp;</span><em>blocks</em><span>) are identified through reads' alignments and stored in a&nbsp;</span><em>weighted</em><span>graph. The merging phase is carried out with the help of this weighted graph that allows an&nbsp;</span><em>optimal</em><span>&nbsp;resolution of&nbsp;</span><em>local</em><span>&nbsp;problematic regions.</span></p><p>Address of the bookmark: <a href="https://github.com/vice87/gam-ngs" rel="nofollow">https://github.com/vice87/gam-ngs</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30249/genome-assembly-tutorial</guid>
	<pubDate>Tue, 20 Dec 2016 07:56:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30249/genome-assembly-tutorial</link>
	<title><![CDATA[Genome Assembly Tutorial]]></title>
	<description><![CDATA[<p><span>If genomes were completely random sequences in a statistical sense, 'overlap-consensus-layout' method would have been enough to assemble large genomes from Sanger reads. In contrast, real genomes often have long repetitive regions, and they are hard to assemble using overlap-consensus-layout approach. De Bruijn graph-based assembly approach was originally proposed to handle the assembly of repetitive regions better.</span></p>
<p><span>More at&nbsp;http://www.homolog.us/Tutorials/index.php?p=1.4&amp;s=1</span></p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/index.php?p=1.4&amp;s=1" rel="nofollow">http://www.homolog.us/Tutorials/index.php?p=1.4&amp;s=1</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</guid>
	<pubDate>Mon, 06 Mar 2017 03:44:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</link>
	<title><![CDATA[MetaBAT:  An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities]]></title>
	<description><![CDATA[<p>MetaBAT, An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities</p>
<p>Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (&gt;200kb) in 3 hours, where 621 genome bins are &gt;50% complete with &lt;5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.</p><p>Address of the bookmark: <a href="https://bitbucket.org/berkeleylab/metabat" rel="nofollow">https://bitbucket.org/berkeleylab/metabat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30976/brig</guid>
	<pubDate>Thu, 16 Feb 2017 13:14:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30976/brig</link>
	<title><![CDATA[BRIG]]></title>
	<description><![CDATA[<p>BRIG is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The application is available at:<a href="http://sourceforge.net/projects/brig">http://sourceforge.net/projects/brig</a></p>
<p>If you have any questions or comments, post them on&nbsp;<a href="http://sourceforge.net/tracker/?group_id=328245">one of the trackers</a>&nbsp;on BRIG&rsquo;s SourceForge page:<a href="http://sourceforge.net/tracker/?group_id=328245">http://sourceforge.net/tracker/?group_id=328245</a>.</p>
<p>Features:</p>
<ul>
<li>Images show similarity between a central reference sequence and other sequences as concentric rings.</li>
<li>BRIG will perform all BLAST comparisons and file parsing automatically via a simple GUI.</li>
<li>Contig boundaries and read coverage can be displayed for draft genomes; customized graphs and annotations can be displayed.</li>
<li>Using a user-defined set of genes as input, BRIG can display gene presence, absence, truncation or sequence variation in a set of complete genomes, draft genomes or even raw, unassembled sequence data.</li>
<li>BRIG also accepts SAM-formatted read-mapping files enabling genomic regions present in unassembled sequence data from multiple samples to be compared simultaneously</li>
</ul>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://brig.sourceforge.net/" rel="nofollow">http://brig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31371/phenogram</guid>
	<pubDate>Tue, 07 Mar 2017 08:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31371/phenogram</link>
	<title><![CDATA[PhenoGram]]></title>
	<description><![CDATA[<p><span>With PhenoGram researchers can create chomosomal ideograms annotated with lines in color at specific base-pair locations, or colored base-pair to base-pair regions, with or without other annotation. PhenoGram allows for annotation of chromosomal locations and/or regions with shapes in different colors, gene identifiers, or other text. PhenoGram also allows for creation of plots showing expanded chromosomal locations, providing a way to show results for specific chromosomal regions in greater detail.</span></p><p>Address of the bookmark: <a href="http://ritchielab.psu.edu/software/phenogram-downloads" rel="nofollow">http://ritchielab.psu.edu/software/phenogram-downloads</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</guid>
	<pubDate>Fri, 05 May 2017 06:11:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</link>
	<title><![CDATA[Bacterial genome assembly !!]]></title>
	<description><![CDATA[<p>This tutorial will serve as an example of how to use free and open-source genome assembly and secondary scaffolding tools to generate high quality assemblies of&nbsp;bacterial sequence data. The bacterial sample used in this tutorial will be referred&nbsp;to simply&nbsp;as &ldquo;Species&rdquo; since it is&nbsp;live data. This data is paired-end data, meaning that there are forward and reverse reads, which we will designate as Sample_R1.fastq and Sample_R2.fastq, respectively.</p>
<p>https://github.com/jennomics/WorkflowPaper/blob/master/Genome%20Assembly%20and%20Annotation.md</p><p>Address of the bookmark: <a href="http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/" rel="nofollow">http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</guid>
	<pubDate>Mon, 15 May 2017 05:04:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</link>
	<title><![CDATA[CABOG: Celera Assembler with Best Overlap Graph]]></title>
	<description><![CDATA[<p>CABOG (Celera Assembler with Best Overlap Graph) is scientific software for&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/24/24/2818.abstract">DNA research</a>. CABOG has been a critical component of many genome sequencing projects. CABOG operates on small genomes such as bacterial as well as large genomes such as mammalian. CABOG is an extension of the Celera Assembler software that was originally developed at&nbsp;<a href="http://www.celera.com/">Celera</a>&nbsp;for the 2001 publication of the first draft human genome sequence. The software was released to the public domain in 2004. Its open source&nbsp;<a href="http://wgs-assembler.sf.net/">repository</a>&nbsp;on Source Forge is an internet resource for scientists around the world.&nbsp;</p>
<p>CABOG is one of many software programs called genome assemblers. These programs exist to overcome the fundamental limitation of all sequencing machines, namely, that they read out very few DNA letters at a time. These programs reconstruct genomes that are billions of letters long from the hundreds of letters per read that modern sequencers provide. What these programs do is often described as a scaled up version of a family solving a jigsaw puzzle.</p>
<p>The CABOG software was the first to accomplish many scientific goals. It was the first to assemble the genome of a multicellular organism (<em>Drosophila melanogaster</em>, 2000). It was the first to assemble both parental haplotypes of one human genome (J. Craig Venter, 2007). It was the first to assemble environmental sequence from the oceans (Sargasso Sea in 2004 and Global Ocean Sampling in 2007). It was first to combine reads from first-generation Sanger sequencing machines and second-generation pyrosequencing machines (Marine microbes, 2006). Today, CABOG is one of the leading assembly programs for data sets that include paired end data from the Roche 454 line of sequencing machines.</p><p>Address of the bookmark: <a href="http://www.jcvi.org/cms/research/projects/cabog/overview/" rel="nofollow">http://www.jcvi.org/cms/research/projects/cabog/overview/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>