BOL

www.healthcare.uiowa.edu - 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...

github.com - Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.

The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity.

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 - 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...

github.com - glia's main use is as a local realigner. It will realign reads to a set of known (or putative) variants in a VCF, both consuming and producing an ordered stream of BAM alignments.  More at https://github.com/ekg/glia glia -f...

murasaki.dna.bio.keio.ac.jp - Murasaki is an anchor alignment program that is exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes)) scalable (Arbitrarily parallelizable across multiple...