<?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/27818?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/27818?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27035/spades</guid>
	<pubDate>Tue, 19 Apr 2016 08:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27035/spades</link>
	<title><![CDATA[SPAdes]]></title>
	<description><![CDATA[<p>SPAdes &ndash; St. Petersburg genome assembler &ndash; is intended for both standard isolates and single-cell MDA bacteria assemblies. This manual will help you to install and run SPAdes. SPAdes version 3.7.1 was released under GPLv2 on March 8, 2016 and can be downloaded from <a href="http://bioinf.spbau.ru/en/spades" target="_blank">http://bioinf.spbau.ru/en/spades</a>.</p>
<p>Manual at http://spades.bioinf.spbau.ru/release3.7.1/manual.html</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/spades" rel="nofollow">http://bioinf.spbau.ru/spades</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30074/minia</guid>
	<pubDate>Thu, 08 Dec 2016 05:07:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30074/minia</link>
	<title><![CDATA[Minia]]></title>
	<description><![CDATA[<p>Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia produces results of similar contiguity and accuracy to other de Bruijn assemblers (e.g. Velvet).</p>
<h3>Download</h3>
<p><a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-bin-Linux.tar.gz">Minia 2.0.7 Linux 64-bits binaries</a>&nbsp;(<a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-Source.tar.gz">Source code</a>)&nbsp;<span>(<a href="http://minia.genouest.org/files/minia-1.6906.tar.gz">Legacy codebase</a>)</span></p>
<h3>For the impatient</h3>
<p>A typical Minia command line looks like:</p>
<pre>./minia -in <span>reads.fa</span> -kmer-size <span>31</span> -abundance-min <span>3</span> -out <span>output_prefix</span></pre>
<p>Type</p>
<pre>./minia</pre>
<p><span>for a quick explanation of the parameters.</span></p>
<p>For more information, refer to the&nbsp;<a href="http://minia.genouest.org/files/minia.pdf">manual</a>.</p>
<p><a href="http://kmergenie.bx.psu.edu/">KmerGenie</a>&nbsp;can be used to determine the best k-mer size, minimum abundance of correct k-mers, and genome size estimation for your dataset.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://minia.genouest.org/" rel="nofollow">http://minia.genouest.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</link>
	<title><![CDATA[Cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30205/garmgenome-assembly-reconciliation-and-merging</guid>
	<pubDate>Mon, 19 Dec 2016 06:03:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30205/garmgenome-assembly-reconciliation-and-merging</link>
	<title><![CDATA[GARM:Genome Assembly, Reconciliation and Merging]]></title>
	<description><![CDATA[<p><span>The pipeline is based mainly implemented using Perl scripts and modules and third-party open source software like the AMOS (Myers et al., 2000) and MUMmer (Kurtz et al., 2004) packages. The pipeline was tested on Debian, Ubuntu, Fedora and BioLinux distributions. The method merges contigs or scaffolds from different assemblers using the same or different sequencing technologies. When scaffolds are provided, a process of finding probable compressions or extensions (CE) problems in the assemblies can be per-formed; contigs are joined back into scaffolds after gap recalculation</span></p><p>Address of the bookmark: <a href="http://garm-meta-assem.sourceforge.net/" rel="nofollow">http://garm-meta-assem.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30216/quickmerge-a-simple-and-fast-metassembler-and-assembly-gap-filler-designed-for-long-molecule-based-assemblies</guid>
	<pubDate>Mon, 19 Dec 2016 10:23:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30216/quickmerge-a-simple-and-fast-metassembler-and-assembly-gap-filler-designed-for-long-molecule-based-assemblies</link>
	<title><![CDATA[quickmerge: A simple and fast metassembler and assembly gap filler designed for long molecule based assemblies.]]></title>
	<description><![CDATA[<p><span>quickmerge uses a simple concept to improve contiguity of genome assemblies based on long molecule sequences, often with dramatic outcomes. The program uses information from assemblies made with illumina short reads and PacBio long reads to improve contiguities of an assembly generated with PacBio long reads alone. This is counterintuitive because illumina short reads are not typically considered to cover genomic regions which PacBio long reads cannot. Although we have not evaluated this program for assemblies generated with Oxford nanopore sequences, the program should work with ONP-assemblies too.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/mahulchak/quickmerge" rel="nofollow">https://github.com/mahulchak/quickmerge</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</guid>
	<pubDate>Thu, 02 Aug 2018 07:39:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</link>
	<title><![CDATA[LSC :a long read error correction tool]]></title>
	<description><![CDATA[<h2>Getting Started</h2>
<p>These simple steps will help you integrate LSC into your transcriptomics analysis pipeline.</p>
<ul>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_requirements.asp">LSC_requirements</a>&nbsp;for running LSC.</li>
<li><a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_download.asp">Download</a>&nbsp;and set-up the LSC package.</li>
<li>Follow the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_tutorial.asp">tutorial</a>&nbsp;to see how LSC works on some example data.</li>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_manual.asp">manual</a>&nbsp;if anything is unclear.</li>
<li>You're ready, Happy LSCing!</li>
</ul>
<h2>Latest publication</h2>
<p><span>Kin Fai Au, Jason Underwood, Lawrence Lee and Wing Hung Wong&nbsp;</span><br><strong>Improving PacBio Long Read Accuracy by Short Read Alignment&nbsp;</strong><span>[</span><a href="http://journals.plos.org/plosone/article?id=10.1371%2Fjournal.pone.0046679">Manuscript</a><span>]&nbsp;</span><br><em>PLoS ONE</em><span>&nbsp;2012. 7(10): e46679. doi:10.1371/journal.pone.0046679</span></p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28807/organellargenomedraw</guid>
	<pubDate>Tue, 16 Aug 2016 08:13:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28807/organellargenomedraw</link>
	<title><![CDATA[OrganellarGenomeDRAW]]></title>
	<description><![CDATA[<p><span>O</span><span>rganellar</span><span>G</span><span>enome</span><span>DRAW</span><span>&nbsp;is dedicated to convert genetic information stored in GenBank entries to graphical maps. The input text file has to be in GenBank flat file format, whereas the output format can be chosen among several formats. The application is especially optimized and adapted for the creation of high-quality, detailed circular maps of organellar genomes like the plastid genome (plastome) or the mitochondrial genome (chondriome). Nevertheless, you can upload any GenBank entry. The workflow is devided into three steps.&nbsp;</span></p>
<p><span>More at&nbsp;http://ogdraw.mpimp-golm.mpg.de/cgi-bin/ogdraw.pl</span></p><p>Address of the bookmark: <a href="http://ogdraw.mpimp-golm.mpg.de/index.shtml" rel="nofollow">http://ogdraw.mpimp-golm.mpg.de/index.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28844/teannot</guid>
	<pubDate>Thu, 18 Aug 2016 10:02:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28844/teannot</link>
	<title><![CDATA[TEannot]]></title>
	<description><![CDATA[<p>We advise to run first the TEdenovo pipeline but it is not compulsory. We suppose you begin by running the TEannot pipeline on the example provided in the directory "db/" rather than directly on your own genomic sequences. Thus, from now on, the project name is "DmelChr4".</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto" rel="nofollow">https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>