bix.ucsd.edu - BLASR (Basic Local Alignment with Successive Refinement) for mapping Single Molecule Sequencing (SMS) reads that are thousands to tens of thousands of bases long with divergence between the read and genome dominated by insertion and deletion...
github.com - AnchorWave (Anchored Wavefront Alignment) identifies collinear regions via conserved anchors (full-length CDS and full-length exon have been implemented currently) and breaks collinear regions into shorter fragments, i.e., anchor and inter-anchor...
metagraph.ethz.ch - The MetaGraph framework is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle,...
github.com - Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in...
github.com - 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...
qualimap.bioinfo.cipf.es - Qualimap 2 is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like...
github.com - Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111
Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should...
github.com - The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage ofhomologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in...
pbil.univ-lyon1.fr - DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.Ancestral genes or domains are deduced from...
github.com - MALVA is able to genotype multi-allelic SNPs and indels without mapping reads
MALVA calls correctly more indels than the most widely adopted genotyping pipelines
Mapping-free approaches are as accurate as alignment-based ones, while being...