<?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/41009?offset=390</link>
	<atom:link href="https://bioinformaticsonline.com/related/41009?offset=390" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27076/ale-a-generic-assembly-likelihood-evaluation-framework-for-assessing-the-accuracy-of-genome-and-metagenome-assemblies</guid>
	<pubDate>Tue, 26 Apr 2016 03:38:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27076/ale-a-generic-assembly-likelihood-evaluation-framework-for-assessing-the-accuracy-of-genome-and-metagenome-assemblies</link>
	<title><![CDATA[ALE: a Generic Assembly Likelihood Evaluation Framework for Assessing the Accuracy of Genome and Metagenome Assemblies]]></title>
	<description><![CDATA[<p>Assembly Likelihood Evaluation (ALE) framework that overcomes these limitations, systematically evaluating the accuracy of an assembly in a reference-independent manner using rigorous statistical methods. This framework is comprehensive, and integrates read quality, mate pair orientation and insert length (for paired-end reads), sequencing coverage, read alignment and k-mer frequency. ALE pinpoints synthetic errors in both single and metagenomic assemblies, including single-base errors, insertions/deletions, genome rearrangements and chimeric assemblies presented in metagenomes. At the genome level with real-world data, ALE identifies three large misassemblies from the Spirochaeta smaragdinae finished genome, which were all independently validated by Pacific Biosciences sequencing. At the single-base level with Illumina data, ALE recovers 215 of 222 (97%) single nucleotide variants in a training set from a GC-rich Rhodobacter sphaeroides genome. Using real Pacific Biosciences data, ALE identifies 12 of 12 synthetic errors in a Lambda Phage genome, surpassing even Pacific Biosciences' own variant caller, EviCons. In summary, the ALE framework provides a comprehensive, reference-independent and statistically rigorous measure of single genome and metagenome assembly accuracy, which can be used to identify misassemblies or to optimize the assembly process.</p>
<p>More at&nbsp;http://www.ncbi.nlm.nih.gov/pubmed/23303509</p><p>Address of the bookmark: <a href="http://sc932.github.io/ALE/about.html" rel="nofollow">http://sc932.github.io/ALE/about.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27092/medea-comparative-genomic-visualization-with-adobe-flash</guid>
	<pubDate>Tue, 26 Apr 2016 12:15:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27092/medea-comparative-genomic-visualization-with-adobe-flash</link>
	<title><![CDATA[MEDEA: Comparative Genomic Visualization with Adobe Flash]]></title>
	<description><![CDATA[<p><span>As the number of sequence and annotated genomes grows larger, the need to understand, compare, and contrast the data becomes increasingly important. Using the power of the human visual system to detect trends and spot outliers is necessary in such large and complex data sets.</span></p>
<p><span>More at&nbsp;http://www.broadinstitute.org/annotation/medea/</span></p><p>Address of the bookmark: <a href="http://www.broadinstitute.org/annotation/medea/" rel="nofollow">http://www.broadinstitute.org/annotation/medea/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27216/yass-genomic-similarity-search-tool</guid>
	<pubDate>Mon, 02 May 2016 09:26:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27216/yass-genomic-similarity-search-tool</link>
	<title><![CDATA[YASS :: genomic similarity search tool]]></title>
	<description><![CDATA[<p>YASS is a genomic similarity search tool, for nucleic (DNA/RNA) sequences in fasta or plain text format (<em>it produces local pairwise alignments</em>). Like most of the heuristic pairwise local alignment tools for DNA sequences (FASTA, BLAST, PATTERNHUNTER, BLASTZ/LASTZ, LAST ...), YASS uses <em>seeds</em> to detect potential similarity regions, and then tries to extend them to local alignments. This genomic search tool uses <em>multiple transition constrained spaced seeds</em> that enable to search more fuzzy repeats, as non-coding DNA/RNA. Another simple, but interesting feature is that you can specify the seed pattern used in the search step (as provided for example by <a href="http://bioinfo.lifl.fr/yass/iedera.php">iedera</a>).</p>
<p>Main features of YASS are:</p>
<ul>
<li>multiple, possibly overlapping seeds and a new hit criterion to ensure a good sensitivity/selectivity trade-off</li>
<li>transition-constrained spaced seeds to improve sensitivity (transition mutations are purine to purine [<code>A&lt;-&gt;G</code>] or pyrimidine to pyrimidine [<code>C&lt;-&gt;T</code>])</li>
<li>using different scoring schemes with bit-score and E-value evaluated according to the sequence background frequencies</li>
<li>parameterizable <em>output</em> filter for low complexity repeats</li>
<li>reporting of various alignment statistical parameters (mutation bias along triplets, transition/transversion)</li>
<li>post-processing step to group gapped alignments</li>
</ul><p>Address of the bookmark: <a href="http://bioinfo.lifl.fr/yass/" rel="nofollow">http://bioinfo.lifl.fr/yass/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/27967/linux-command-line-exercises-for-ngs-data-processing</guid>
	<pubDate>Wed, 22 Jun 2016 07:59:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27967/linux-command-line-exercises-for-ngs-data-processing</link>
	<title><![CDATA[Linux command line exercises for NGS data processing]]></title>
	<description><![CDATA[<p>The purpose of this tutorial is to introduce students to the frequently used tools for NGS analysis as well as giving experience in writing one-liners. Copy the required files to your current directory, change directory (<code>cd</code>) to the <code>linuxTutorial</code> folder, and do all the processing inside:</p>
<pre><span>[uzi@quince-srv2 ~/]$</span> cp -r /home/opt/MScBioinformatics/linuxTutorial .
<span>[uzi@quince-srv2 ~/]$</span> cd linuxTutorial
<span>[uzi@quince-srv2 ~/linuxTutorial]$</span>
</pre>
<p>I have deliberately chosen <code>Awk</code> in the exercises as it is a language in itself and is used more often to manipulate NGS data as compared to the other command line tools such as <code>grep</code>, <code>sed</code>, <code>perl</code> etc. Furthermore, having a command on <code>awk</code> will make it easier to understand advanced tutorials such as <a href="http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/Illumina_workflow.html">Illumina Amplicons Processing Workflow</a>. <br><br> In <code>Linux</code>, we use a shell that is a program that takes your commands from the keyboard and gives them to the operating system. Most Linux systems utilize Bourne Again SHell (<code>bash</code>), but there are several additional shell programs on a typical Linux system such as <code>ksh</code>, <code>tcsh</code>, and <code>zsh</code>. To see which shell you are using, type</p>
<pre><span>[uzi@quince-srv2 ~/linuxTutorial]$</span> echo $SHELL

<span>/bin/bash
</span></pre><p>Address of the bookmark: <a href="http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/linux.html" rel="nofollow">http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/linux.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28835/a5-miseq</guid>
	<pubDate>Thu, 18 Aug 2016 04:05:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28835/a5-miseq</link>
	<title><![CDATA[A5-miseq]]></title>
	<description><![CDATA[<p><span><span>_A5-miseq_ is a pipeline for assembling DNA sequence data generated on the Illumina sequencing platform. This README will take you through the steps necessary for running _A5-miseq_. </span></span></p>
<p><span>Point to note:</span></p>
<p><span>There are many situations where A5-miseq is not the right tool for the job. In order to produce accurate results, A5-miseq requires Illumina data with certain characteristics. A5-miseq will likely not work well with Illumina reads shorter than around 80nt, or reads where the base qualities are low in all or most reads before 60nt. A5-miseq assumes it is assembling homozygous haploid genomes. Use a different assembler for metagenomes and heterozygous diploid or polyploid organisms. Use a different assembler if a tool like FastQC reports your data quality is dubious. You have been warned! Datasets consisting solely of unpaired reads are not currently supported.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ngopt/" rel="nofollow">https://sourceforge.net/projects/ngopt/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</guid>
	<pubDate>Wed, 13 Jul 2016 08:08:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</link>
	<title><![CDATA[WiseScaffolder]]></title>
	<description><![CDATA[<p>Function</p>
<p>WiseScaffolder is a stand-alone semi-automatic application for genome scaffolding of pre-assembled contigs using mate-pair data. It also produces editable scaffold maps, allowing either to build gapped scaffolds or usable as a common thread for the manual improvement of scaffolds.</p>
<p>Description&nbsp;</p>
<p>WiseScaffolder includes 4 subcommands: dumpconfig generates a configuration file that notably specifies the average insert size of the mate-pair library preprocess allows the detection and correction of chimerae, the estimation of contigs copy number and produces valuable outputs for the manual improvement of scaffolds scaffold constitutes the central scaffold-builder and comprises two modules:</p>
<p>i) the interative_scaffold_extender, which works with big, unambiguous contigs, or when they run out, single copy contigs, and</p>
<p>ii) the small_contig_inserter, which inserts the small contigs within scaffolds buildfasta converts the scaffold(s) map(s) into Fasta sequences.</p><p>Address of the bookmark: <a href="http://abims.sb-roscoff.fr/wisescaffolder" rel="nofollow">http://abims.sb-roscoff.fr/wisescaffolder</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>