BOL: Related items

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

assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome

Jit — Thu, 14 Jun 2018 07:31:00 -0500

Download and install MUMmer Align your assembly to a reference genome using nucmer (from MUMmer package) $ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT Consult the MUMmer manual if you encounter problems Optional: Gzip the delta file to speed up upload (usually 2-4X faster) $ gzip OUT.delta Then use the OUT.delta.gz file for upload. Upload the .delta or delta.gz file (view example) to Assemblytics Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference. The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment. http://assemblytics.com/

Address of the bookmark: http://assemblytics.com/

Qualimap2: Evaluating next generation sequencing alignment data

Jit — Tue, 11 Sep 2018 04:44:29 -0500

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

Supported types of experiments include:

Whole-genome sequencing
Whole-exome sequencing
RNA-seq (speical mode available)
ChIP-seq

Address of the bookmark: http://qualimap.bioinfo.cipf.es/

Cactus: a reference-free whole-genome multiple alignment program

Jit — Mon, 12 Aug 2019 07:52:33 -0500

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 expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.

Address of the bookmark: https://github.com/ComparativeGenomicsToolkit/cactus

The wavefront alignment (WFA) algorithm

BioStar — Sun, 28 Jun 2020 10:17:50 -0500

The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of
homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.

Address of the bookmark: https://github.com/smarco/WFA

A web-based tool for sequence alignment statistics and innovative visualization

BioStar — Thu, 04 Apr 2024 01:44:50 -0500

AlignStatPlot, a new R package and online tool that is well-documented and easy-to usefor MSA and post-MSA analysis. This tool performs both traditional and cutting-edge analy-ses on sequencing data and generates new visualisation methods for MSA results. Whencompared to currently available tools, AlignStatPlot provides a robust ability to handle andvisualise diversity data, while the online version will save time and encourage researchersto focus on explaining their findings. It is a simple tool that can be used in conjunction withpopulation genetics software (PDF) AlignStatPlot: An R package and online tool for robust sequence alignment statistics and innovative visualization of big data.

Address of the bookmark: https://bioinformatics.um6p.ma/AlignStatPlot/

Alvis: a tool for contig and read ALignment VISualisation and chimera detection

LEGE — Wed, 08 May 2024 07:02:55 -0500

Alvis, a simple command line tool that can generate visualisations for a number of common alignment analysis tasks. Alvis is a fast and portable tool that accepts input in a variety of alignment formats and will output production ready vector images. Additionally, Alvis will highlight potentially chimeric reads or contigs, a common source of misassemblies.

More at https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-021-04056-0

Address of the bookmark: https://github.com/SR-Martin/alvis

Murasaki

Anjana — Fri, 30 Sep 2016 10:22:30 -0500

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 nodes using MPI)
memory efficient. (Even a single node with 16GB of ram can handle over 1Gbp of sequence)
unlimited by pattern length or selection
repeat tolerant

Address of the bookmark: http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki

GenomeRing: alignment visualization based on SuperGenome coordinates

Neel — Wed, 18 Jan 2017 10:24:10 -0600

The number of completely sequenced genomes is continuously rising, allowing for comparative analyses of genomic variation. Such analyses are often based on whole-genome alignments to elucidate structural differences arising from insertions, deletions or from rearrangement events. Computational tools that can visualize genome alignments in a meaningful manner are needed to help researchers gain new insights into the underlying data. Such visualizations typically are either realized in a linear fashion as in genome browsers or by using a circular approach, where relationships between genomic regions are indicated by arcs. Both methods allow for the integration of additional information such as experimental data or annotations. However, providing a visualization that still allows for a quick and comprehensive interpretation of all important genomic variations together with various supplemental data, which may be highly heterogeneous, remains a challenge.

More at https://academic.oup.com/bioinformatics/article/28/12/i7/268598/GenomeRing-alignment-visualization-based-on

Address of the bookmark: http://it.informatik.uni-tuebingen.de/?page_id=185

Synima: Synteny Imaging tool

Jit — Sun, 10 Dec 2017 17:03:48 -0600

Synteny Imaging tool (Synima) written in Perl, which uses the graphical features of R. Synima takes orthologues computed from reciprocal best BLAST hits or OrthoMCL, and DAGchainer, and outputs an overview of genome-wide synteny in PDF. Each of these programs are included with the Synima package, and a pipeline for their use. Synima has a range of graphical parameters including size, colours, order, and labels, which are specified in a config file generated by the first run of Synima – and can be subsequently edited. Synima runs quickly on a command line to generate informative and publication quality figures. Synima is open source and freely available from https://github.com/rhysf/Synima under the MIT License.

Address of the bookmark: https://github.com/rhysf/Synima