BOL

mugsy.sourceforge.net - Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee....

github.com - Kalign is a fast multiple sequence alignment program for biological sequences. Align sequences and output the alignment in MSF format: kalign -i BB11001.tfa -f msf -o out.msf Align sequences and output the alignment in clustal format: kalign...

mulan.dcode.org - Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It...

github.com - FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes...

github.com - Filtering on quality and/or read length, and optional trimming after passing filters.Reads from stdin, writes to stdout. Intended to be used: directly after fastq extraction prior to mapping in a stream between extraction and...

TGS technologies have been used to produce highly accurate de novo assemblies of hundreds of microbial genomes and highly contiguous reconstructions of many dozens of plant and animal genomes, enabling new insights into evolution and sequence...

hal.archives-ouvertes.fr - Pros and cons of HairSplitter Limitations of HairSplitter: Not very fast: it re-polishes the whole assembly  Limited in the number of haplotypes Strengths of HairSplitter: Very modular, can be used with any assembler Naive: makes no...

github.com - Jabba is a hybrid error correction tool to correct third generation (PacBio / ONT) sequencing data, using second generation (Illumina) data. Input Jabba takes as input a concatenated de Bruijn graph and a set of sequences: the de Bruijn graph...

github.com - MARVEL consists of a set of tools that facilitate the overlapping, patching, correction and assembly of noisy (not so noisy ones as well) long reads. The assembly process can be summarized as follows: overlap patch reads overlap...

Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...