<?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/37221?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/37221?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38804/grabb-selective-assembly-of-genomic-regions-a-new-niche-for-genomic-research</guid>
	<pubDate>Sat, 26 Jan 2019 18:58:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38804/grabb-selective-assembly-of-genomic-regions-a-new-niche-for-genomic-research</link>
	<title><![CDATA[GRAbB: Selective Assembly of Genomic Regions, a New Niche for Genomic Research]]></title>
	<description><![CDATA[<p><span>GRAbB is shown to be more efficient than MITObim in terms of speed, memory and disk usage. The other functionalities (handling multiple targets simultaneously and extracting homologous regions) of the new program are not matched by other programs. The program is available with explanatory documentation at&nbsp;</span><a href="https://github.com/b-brankovics/grabb">https://github.com/b-brankovics/grabb</a><span>. GRAbB has been tested on Ubuntu (12.04 and 14.04), Fedora (23), CentOS (7.1.1503) and Mac OS X (10.7). Furthermore, GRAbB is available as a docker repository: brankovics/grabb (</span><a href="https://hub.docker.com/r/brankovics/grabb/">https://hub.docker.com/r/brankovics/grabb/</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/b-brankovics/grabb" rel="nofollow">https://github.com/b-brankovics/grabb</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40940/consed-a-finishing-package-bam-file-viewer-assembly-editor-autofinish-autoreport-autoedit-and-align-reads-to-reference-sequence</guid>
	<pubDate>Fri, 07 Feb 2020 07:16:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40940/consed-a-finishing-package-bam-file-viewer-assembly-editor-autofinish-autoreport-autoedit-and-align-reads-to-reference-sequence</link>
	<title><![CDATA[Consed--A Finishing Package (BAM File Viewer, Assembly Editor, Autofinish, Autoreport, Autoedit, and Align Reads To Reference Sequence)]]></title>
	<description><![CDATA[<ul>
<li>Supports Illumina, 454, other Next-Gen and Sanger Reads and allows mixtures of these read types</li>
<li>Consed includes BamScape which can view bam files with unlimited numbers of reads. BamScape can bring up consed to edit reads and the reference sequence in targeted regions.</li>
<li>Consed is compatible with Newbler, Cross_match, Phrap, MIRA, Velvet and PCAP output.</li>
<li>Quickly takes the user to each variant site for viewing (also available as an automated report)</li>
<li>Overview of assembly can help detect and fix misassemblies</li>
<li>Editing time reduced by the program's ability to pin-point problem areas</li>
<li>Editing is guided by error probabilities</li>
</ul><p>Address of the bookmark: <a href="http://www.phrap.org/consed/consed.html" rel="nofollow">http://www.phrap.org/consed/consed.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44366/mitofinder</guid>
	<pubDate>Tue, 29 Aug 2023 02:13:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44366/mitofinder</link>
	<title><![CDATA[MitoFinder]]></title>
	<description><![CDATA[<p dir="auto">Allio, R., Schomaker-Bastos, A., Romiguier, J., Prosdocimi, F., Nabholz, B., &amp; Delsuc, F. (2020) Mol Ecol Resour. 20, 892-905. (<a href="https://doi.org/10.1111/1755-0998.13160">publication link</a>)</p>
<p dir="auto" style="text-align: center;"><a href="https://github.com/RemiAllio/MitoFinder/blob/master/image/logo.png" target="_blank"><img src="https://github.com/RemiAllio/MitoFinder/raw/master/image/logo.png" alt="Drawing" width="250" style="border: 0px;"></a></p>
<p dir="auto"><span>Mitofinder</span>&nbsp;is a pipeline to&nbsp;<span>assemble</span>&nbsp;mitochondrial genomes and&nbsp;<span>annotate</span>&nbsp;mitochondrial genes from trimmed read sequencing data.</p>
<p dir="auto"><span>MitoFinder</span>&nbsp;is also designed to&nbsp;<span>find</span>&nbsp;and&nbsp;<span>annotate</span>&nbsp;mitochondrial sequences in existing genomic assemblies (generated from Hifi/PacBio/Nanopore/Illumina sequencing data...)</p>
<p dir="auto"><span>MitoFinder</span>&nbsp;is distributed under the&nbsp;<a href="https://github.com/RemiAllio/MitoFinder/blob/master/License/LICENSE">license</a>.</p><p>Address of the bookmark: <a href="https://github.com/RemiAllio/MitoFinder" rel="nofollow">https://github.com/RemiAllio/MitoFinder</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43652/peregrine-shimmer-genome-assembly-toolkit</guid>
	<pubDate>Thu, 16 Dec 2021 02:50:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43652/peregrine-shimmer-genome-assembly-toolkit</link>
	<title><![CDATA[Peregrine &amp; SHIMMER Genome Assembly Toolkit]]></title>
	<description><![CDATA[<p><span>Peregrine is a fast genome assembler for accurate long reads (length &gt; 10kb, accuracy &gt; 99%). It can assemble a human genome from 30x reads within 20 cpu hours from reads to polished consensus. It uses Sparse HIereachical MimiMizER (SHIMMER) for fast read-to-read overlaping without quadratic comparisions used in other OLC assemblers.</span></p><p>Address of the bookmark: <a href="https://github.com/cschin/Peregrine" rel="nofollow">https://github.com/cschin/Peregrine</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44474/claw-chloroplast-long-read-assembly-workflow</guid>
	<pubDate>Wed, 21 Feb 2024 12:37:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44474/claw-chloroplast-long-read-assembly-workflow</link>
	<title><![CDATA[CLAW: Chloroplast Long-read Assembly Workflow]]></title>
	<description><![CDATA[<p dir="auto">CLAW (Chloroplast Long-read Assembly Workflow) is an mostly-automated Snakemake-based workflow for the assembly of chloroplast genomes. CLAW uses chloroplast long-reads, which are baited out of larger read libraries (e.g., an Oxford Nanopore Technologies MinION read library derived from photosynthetic tissue), for assembly with Flye and/or Unicycler. CLAW was designed with the novice bioinformatician in mind - it is easy to install and easy to use, requiring only minimal user input.</p><p>Address of the bookmark: <a href="https://github.com/aaronphillips7493/CLAW" rel="nofollow">https://github.com/aaronphillips7493/CLAW</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1926</guid>
	<pubDate>Sun, 11 Aug 2013 11:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1926</link>
	<title><![CDATA[Want to Know which genome assembler rule the world ?]]></title>
	<description><![CDATA[<p><span><strong>Assemblathon 2</strong>: evaluating de novo methods of genome assembly&nbsp;</span></p><p><span><a href="http://www.gigasciencejournal.com/content/2/1/10/abstract">http://www.gigasciencejournal.com/content/2/1/10/abstract</a></span></p><p><span><a href="http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html">http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html</a></span></p><p><a href="http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p">http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</guid>
	<pubDate>Mon, 11 Jun 2018 03:08:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</link>
	<title><![CDATA[PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++.]]></title>
	<description><![CDATA[We are pleased to release PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++. Its name describes the strategy that it implements for genome assembly: PRICE uses paired-read information to iteratively increase the size of existing contigs. Initially, those contigs can be individual reads from a subset of the paired-read dataset, non-paired reads from sequencing technologies that provide non-paired data, or contigs that were output from a prior run of PRICE or any other assembler.

http://derisilab.ucsf.edu/software/price/<p>Address of the bookmark: <a href="http://derisilab.ucsf.edu/software/price/" rel="nofollow">http://derisilab.ucsf.edu/software/price/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</guid>
	<pubDate>Fri, 19 Oct 2018 08:48:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</link>
	<title><![CDATA[Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2 is able to assemble the human and even the 32Gb&nbsp;</span><a href="https://www.nature.com/articles/nature25458">Axolotl</a><span>&nbsp;genome at a speed tens of times faster than&nbsp;</span><a href="https://github.com/marbl/canu">CANU</a><span>&nbsp;and&nbsp;</span><a href="https://github.com/PacificBiosciences/FALCON">FALCON</a><span>while producing contigs of comparable base accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39830/the-extensive-de-novo-te-annotator-edta</guid>
	<pubDate>Thu, 08 Aug 2019 04:05:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39830/the-extensive-de-novo-te-annotator-edta</link>
	<title><![CDATA[The Extensive de novo TE Annotator (EDTA)]]></title>
	<description><![CDATA[<p><span>The EDTA package was designed to filter out false discoveries in raw TE candidates and generate a high-quality non-redundant TE library for whole-genome TE annotations. Selection of initial search programs were based on benckmarkings on the annotation performance using a manually curated TE library in the rice genome.</span></p><p>Address of the bookmark: <a href="https://github.com/oushujun/EDTA" rel="nofollow">https://github.com/oushujun/EDTA</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>