BOL: Related items

MitoFinder

Neel — Tue, 29 Aug 2023 02:13:01 -0500

Allio, R., Schomaker-Bastos, A., Romiguier, J., Prosdocimi, F., Nabholz, B., & Delsuc, F. (2020) Mol Ecol Resour. 20, 892-905. (publication link)

Mitofinder is a pipeline to assemble mitochondrial genomes and annotate mitochondrial genes from trimmed read sequencing data.

MitoFinder is also designed to find and annotate mitochondrial sequences in existing genomic assemblies (generated from Hifi/PacBio/Nanopore/Illumina sequencing data...)

MitoFinder is distributed under the license.

Address of the bookmark: https://github.com/RemiAllio/MitoFinder

Peregrine & SHIMMER Genome Assembly Toolkit

Abhi — Thu, 16 Dec 2021 02:50:19 -0600

Peregrine is a fast genome assembler for accurate long reads (length > 10kb, accuracy > 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.

Address of the bookmark: https://github.com/cschin/Peregrine

CLAW: Chloroplast Long-read Assembly Workflow

LEGE — Wed, 21 Feb 2024 12:37:46 -0600

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.

Address of the bookmark: https://github.com/aaronphillips7493/CLAW

DISCO : multi threaded and multiprocess distributed memory overlap-layout-consensus (OLC) metagenome assembler

Jit — Mon, 10 Jul 2017 10:09:27 -0500

DISCO is a multi threaded and multiprocess distributed memory overlap-layout-consensus (OLC) metagenome assembler. Disco was developed as a scalable assembler to assemble large metagenomes from billions of Illumina sequencing reads of complex microbial communities. Disco was parallelized for computer clusters in a hybrid architecture that integrated shared-memory multi-threading, point-to-point message passing, and remote direct memory access. The assembly and scaffolding were performed using an iterative overlap graph approach.

Address of the bookmark: http://disco.omicsbio.org/

Want to Know which genome assembler rule the world ?

Rahul Agarwal — Sun, 11 Aug 2013 11:42:32 -0500

Assemblathon 2: evaluating de novo methods of genome assembly

http://www.gigasciencejournal.com/content/2/1/10/abstract

http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html

http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p

PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++.

Surabhi Chaudhary — Mon, 11 Jun 2018 03:08:26 -0500

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/

Address of the bookmark: http://derisilab.ucsf.edu/software/price/

The Extensive de novo TE Annotator (EDTA)

Abhimanyu Singh — Thu, 08 Aug 2019 04:05:36 -0500

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.

Address of the bookmark: https://github.com/oushujun/EDTA

LAMSA: fast split read alignment with long approximate matches

Jit — Tue, 15 May 2018 04:44:42 -0500

LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs). LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants. We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs. LAMSA is open source and free for non-commercial use. LAMSA is mainly designed by Bo Liu & Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.

Address of the bookmark: https://github.com/hitbc/LAMSA

LRCstats: Long Read Correction Statistics

Jit — Fri, 05 Jan 2018 04:04:20 -0600

LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.

Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.

https://www.healthcare.uiowa.edu/labs/au/LSC/

Address of the bookmark: https://github.com/cchauve/lrcstats

LSC: Improving PacBio Long Read Accuracy by Short Read Alignment

Abhimanyu Singh — Thu, 06 Sep 2018 16:27:35 -0500

Added Command line argument support.
Multi-stage execution modes.
Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N.
Better compressed intermediate files.
Added utilities folder.
Added support for multiple short read files.
Removed use of configuration file.

Address of the bookmark: https://www.healthcare.uiowa.edu/labs/au/LSC/