scholarly journals ViralMSA: massively scalable reference-guided multiple sequence alignment of viral genomes

2020 ◽  
Author(s):  
Niema Moshiri
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Genomic Sequence ◽  
Sequence Data ◽  
Supplementary Information ◽  
Software Project ◽  
Multiple Sequence ◽  
Viral Genomes ◽  
Algorithmic Techniques ◽  
User Friendly

Abstract Motivation In molecular epidemiology, the identification of clusters of transmissions typically requires the alignment of viral genomic sequence data. However, existing methods of multiple sequence alignment (MSA) scale poorly with respect to the number of sequences. Results ViralMSA is a user-friendly reference-guided MSA tool that leverages the algorithmic techniques of read mappers to enable the MSA of ultra-large viral genome datasets. It scales linearly with the number of sequences, and it is able to align tens of thousands of full viral genomes in seconds. However, alignments produced by ViralMSA omit insertions with respect to the reference genome. Availability and implementation ViralMSA is freely available at https://github.com/niemasd/ViralMSA as an open-source software project. Contact [email protected] Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals ViralMSA: Massively scalable reference-guided multiple sequence alignment of viral genomes

2020 ◽  
Author(s):  
Niema Moshiri
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Genomic Sequence ◽  
Sequence Data ◽  
Software Project ◽  
Multiple Sequence ◽  
Viral Genomes ◽  
Alignment Tool ◽  
Multiple Sequence Alignment Tool ◽  
Algorithmic Techniques

AbstractMotivationIn molecular epidemiology, the identification of clusters of transmissions typically requires the alignment of viral genomic sequence data. However, existing methods of multiple sequence alignment scale poorly with respect to the number of sequences.ResultsViralMSA is a user-friendly reference-guided multiple sequence alignment tool that leverages the algorithmic techniques of read mappers to enable the multiple sequence alignment of ultra-large viral genome datasets. It scales linearly with the number of sequences, and it is able to align tens of thousands of full viral genomes in seconds.AvailabilityViralMSA is freely available at https://github.com/niemasd/ViralMSA as an open-source software [email protected]

Sequoya: multiobjective multiple sequence alignment in Python

2020 ◽  
Vol 36 (12) ◽  
pp. 3892-3893
Author(s):  
Antonio Benítez-Hidalgo ◽  
Antonio J Nebro ◽  
José F Aldana-Montes
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Software Tool ◽  
Computing System ◽  
Supplementary Information ◽  
Optimization Approach ◽  
Multiple Sequence ◽  
Graphical Tool ◽  
Optimal Alignments ◽  
Python Programming

Abstract Motivation Multiple sequence alignment (MSA) consists of finding the optimal alignment of three or more biological sequences to identify highly conserved regions that may be the result of similarities and relationships between the sequences. MSA is an optimization problem with NP-hard complexity (non-deterministic polynomial-time hardness), because the time needed to find optimal alignments raises exponentially along with the number of sequences and their length. Furthermore, the problem becomes multiobjective when more than one score is considered to assess the quality of an alignment, such as maximizing the percentage of totally conserved columns and minimizing the number of gaps. Our motivation is to provide a Python tool for solving MSA problems using evolutionary algorithms, a nonexact stochastic optimization approach that has proven to be effective to solve multiobjective problems. Results The software tool we have developed, called Sequoya, is written in the Python programming language, which offers a broad set of libraries for data analysis, visualization and parallelism. Thus, Sequoya offers a graphical tool to visualize the progress of the optimization in real time, the ability to guide the search toward a preferred region in run-time, parallel support to distribute the computation among nodes in a distributed computing system, and a graphical component to assist in the analysis of the solutions found at the end of the optimization. Availability and implementation Sequoya can be freely obtained from the Python Package Index (pip) or, alternatively, it can be downloaded from Github at https://github.com/benhid/Sequoya. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Protein multiple alignments: sequence-based versus structure-based programs

2019 ◽  
Vol 35 (20) ◽  
pp. 3970-3980 ◽  
Author(s):  
Mathilde Carpentier ◽  
Jacques Chomilier
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Added Value ◽  
Supplementary Information ◽  
Supplementary Data ◽  
Sequence Structure ◽  
Multiple Sequence ◽  
Sequence Identity ◽  
Multiple Alignments ◽  
Low Levels

Abstract Motivation Multiple sequence alignment programs have proved to be very useful and have already been evaluated in the literature yet not alignment programs based on structure or both sequence and structure. In the present article we wish to evaluate the added value provided through considering structures. Results We compared the multiple alignments resulting from 25 programs either based on sequence, structure or both, to reference alignments deposited in five databases (BALIBASE 2 and 3, HOMSTRAD, OXBENCH and SISYPHUS). On the whole, the structure-based methods compute more reliable alignments than the sequence-based ones, and even than the sequence+structure-based programs whatever the databases. Two programs lead, MAMMOTH and MATRAS, nevertheless the performances of MUSTANG, MATT, 3DCOMB, TCOFFEE+TM_ALIGN and TCOFFEE+SAP are better for some alignments. The advantage of structure-based methods increases at low levels of sequence identity, or for residues in regular secondary structures or buried ones. Concerning gap management, sequence-based programs set less gaps than structure-based programs. Concerning the databases, the alignments of the manually built databases are more challenging for the programs. Availability and implementation All data and results presented in this study are available at: http://wwwabi.snv.jussieu.fr/people/mathilde/download/AliMulComp/. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals MAFFT online service: multiple sequence alignment, interactive sequence choice and visualization

2017 ◽  
Vol 20 (4) ◽  
pp. 1160-1166 ◽  
Author(s):  
Kazutaka Katoh ◽  
John Rozewicki ◽  
Kazunori D Yamada
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Sequence Data ◽  
Large Data ◽  
Relevant Information ◽  
Data Sets ◽  
Online Service ◽  
Multiple Sequence ◽  
Biologically Relevant ◽  
Sequencing Technologies

Abstract This article describes several features in the MAFFT online service for multiple sequence alignment (MSA). As a result of recent advances in sequencing technologies, huge numbers of biological sequences are available and the need for MSAs with large numbers of sequences is increasing. To extract biologically relevant information from such data, sophistication of algorithms is necessary but not sufficient. Intuitive and interactive tools for experimental biologists to semiautomatically handle large data are becoming important. We are working on development of MAFFT toward these two directions. Here, we explain (i) the Web interface for recently developed options for large data and (ii) interactive usage to refine sequence data sets and MSAs.

scholarly journals An Evaluation of Phylogenetic Workflows in Viral Molecular Epidemiology

2020 ◽  
Author(s):  
Colin Young ◽  
Sarah Meng ◽  
Niema Moshiri
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Sequence Data ◽  
Phylogenetic Inference ◽  
The Other ◽  
Computational Techniques ◽  
Viral Sequence ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Branch Lengths

AbstractThe use of computational techniques to analyze viral sequence data and ultimately inform public health intervention has become increasingly common in the realm of epidemiology. These methods typically attempt to make epidemiological inferences based on multiple sequence alignments and phylogenies estimated from the raw sequence data. Like all estimation techniques, multiple sequence alignment and phylogenetic inference tools are error-prone, and the impacts of such imperfections on downstream epidemiological inferences are poorly understood. To address this, we executed multiple commonly-used workflows for conducting viral phylogenetic analyses on simulated viral sequence data modeling HIV, HCV, and Ebola, and we computed multiple methods of accuracy motivated by transmission clustering techniques. For multiple sequence alignment, MAFFT consistently outperformed MUSCLE and Clustal Omega in both accuracy and runtime. For phylogenetic inference, FastTree 2, IQ-TREE, RAxML-NG, and PhyML had similar topological accuracies, but branch lengths and pairwise distances were consistently most accurate in phylogenies inferred by RAxML-NG. However, FastTree 2 was orders of magnitude faster than the other tools, and when the other tools were used to optimize branch lengths along a fixed topology provided by FastTree 2 (i.e., no tree search), the resulting phylogenies had accuracies that were indistinguishable from their original counterparts, but with a fraction of the runtime. Our results indicate that an ideal workflow for viral phylogenetic inference is to (1) use MAFFT to perform MSA, (2) use FastTree 2 under the GTR model with discrete gamma-distributed site-rate heterogeneity to quickly obtain a reasonable tree topology, and (3) use RAxML-NG to optimize branch lengths along the fixed FastTree 2 topology.

scholarly journals Gotree/Goalign : Toolkit and Go API to facilitate the development of phylogenetic workflows

2021 ◽  
Author(s):  
Frederic Lemoine ◽  
Olivier Gascuel
Keyword(s):  
Phylogenetic Analysis ◽  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Phylogenetic Analyses ◽  
Bootstrap Support ◽  
Complex Task ◽  
Important Data ◽  
Multiple Sequence ◽  
Tree Comparison ◽  
User Friendly

Besides computer intensive steps, phylogenetic analysis workflows are usually composed of many small, reccuring, but important data manipulations steps. Among these, we can find file reformatting, sequence renaming, tree re-rooting, tree comparison, bootstrap support computation, etc. These are often performed by custom scripts or by several heterogeneous tools, which may be error prone, uneasy to maintain and produce results that are challenging to reproduce. For all these reasons, the development and reuse of phylogenetic workflows is often a complex task. We identified many operations that are part of most phylogenetic analyses, and implemented them in a toolkit called Gotree/Goalign. The Gotree/Goalign toolkit implements more than 120 user-friendly commands and an API dedicated to multiple sequence alignment and phylogenetic tree manipulations. It is developed in Go, which makes executables efficient, easily installable, integrable in workflow environments, and parallelizable when possible. This toolkit is freely available on most platforms (Linux, MacOS and Windows) and most architectures (amd64, i386). Sources and binaries are available on GitHub at https://github.com/evolbioinfo/{gotree|goalign} , Bioconda, and DockerHub.

scholarly journals Recursive MAGUS: Scalable and accurate multiple sequence alignment

2021 ◽  
Vol 17 (10) ◽  
pp. e1008950
Author(s):  
Vladimir Smirnov
Keyword(s):  
Open Source ◽  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
State Of The Art ◽  
Sequence Data ◽  
Large Datasets ◽  
Alignment Accuracy ◽  
Multiple Sequence ◽  
Large Numbers ◽  
Source Form

Multiple sequence alignment tools struggle to keep pace with rapidly growing sequence data, as few methods can handle large datasets while maintaining alignment accuracy. We recently introduced MAGUS, a new state-of-the-art method for aligning large numbers of sequences. In this paper, we present a comprehensive set of enhancements that allow MAGUS to align vastly larger datasets with greater speed. We compare MAGUS to other leading alignment methods on datasets of up to one million sequences. Our results demonstrate the advantages of MAGUS over other alignment software in both accuracy and speed. MAGUS is freely available in open-source form at https://github.com/vlasmirnov/MAGUS.

scholarly journals Multiple Sequence Alignment Averaging Improves Phylogeny Reconstruction

2018 ◽  
Vol 68 (1) ◽  
pp. 117-130 ◽  
Author(s):  
Haim Ashkenazy ◽  
Itamar Sela ◽  
Eli Levy Karin ◽  
Giddy Landan ◽  
Tal Pupko
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Sequence Data ◽  
Phylogenetic Signal ◽  
Large Set ◽  
Multiple Sequence ◽  
Extra Effort ◽  
Alignment Algorithms ◽  
Tree Inference ◽  
Alignment Errors

Abstract The classic methodology of inferring a phylogenetic tree from sequence data is composed of two steps. First, a multiple sequence alignment (MSA) is computed. Then, a tree is reconstructed assuming the MSA is correct. Yet, inferred MSAs were shown to be inaccurate and alignment errors reduce tree inference accuracy. It was previously proposed that filtering unreliable alignment regions can increase the accuracy of tree inference. However, it was also demonstrated that the benefit of this filtering is often obscured by the resulting loss of phylogenetic signal. In this work we explore an approach, in which instead of relying on a single MSA, we generate a large set of alternative MSAs and concatenate them into a single SuperMSA. By doing so, we account for phylogenetic signals contained in columns that are not present in the single MSA computed by alignment algorithms. Using simulations, we demonstrate that this approach results, on average, in more accurate trees compared to 1) using an unfiltered MSA and 2) using a single MSA with weights assigned to columns according to their reliability. Next, we explore in which regions of the MSA space our approach is expected to be beneficial. Finally, we provide a simple criterion for deciding whether or not the extra effort of computing a SuperMSA and inferring a tree from it is beneficial. Based on these assessments, we expect our methodology to be useful for many cases in which diverged sequences are analyzed. The option to generate such a SuperMSA is available at http://guidance.tau.ac.il.

scholarly journals DeepMSA: constructing deep multiple sequence alignment to improve contact prediction and fold-recognition for distant-homology proteins

2019 ◽  
Vol 36 (7) ◽  
pp. 2105-2112 ◽  
Author(s):  
Chengxin Zhang ◽  
Wei Zheng ◽  
S M Mortuza ◽  
Yang Li ◽  
Yang Zhang
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Large Scale ◽  
Secondary Structure Prediction ◽  
Supplementary Information ◽  
Structure Identification ◽  
Whole Genome ◽  
Multiple Sequence ◽  
Contact Prediction ◽  
Homologous Sequences

Abstract Motivation The success of genome sequencing techniques has resulted in rapid explosion of protein sequences. Collections of multiple homologous sequences can provide critical information to the modeling of structure and function of unknown proteins. There are however no standard and efficient pipeline available for sensitive multiple sequence alignment (MSA) collection. This is particularly challenging when large whole-genome and metagenome databases are involved. Results We developed DeepMSA, a new open-source method for sensitive MSA construction, which has homologous sequences and alignments created from multi-sources of whole-genome and metagenome databases through complementary hidden Markov model algorithms. The practical usefulness of the pipeline was examined in three large-scale benchmark experiments based on 614 non-redundant proteins. First, DeepMSA was utilized to generate MSAs for residue-level contact prediction by six coevolution and deep learning-based programs, which resulted in an accuracy increase in long-range contacts by up to 24.4% compared to the default programs. Next, multiple threading programs are performed for homologous structure identification, where the average TM-score of the template alignments has over 7.5% increases with the use of the new DeepMSA profiles. Finally, DeepMSA was used for secondary structure prediction and resulted in statistically significant improvements in the Q3 accuracy. It is noted that all these improvements were achieved without re-training the parameters and neural-network models, demonstrating the robustness and general usefulness of the DeepMSA in protein structural bioinformatics applications, especially for targets without homologous templates in the PDB library. Availability and implementation https://zhanglab.ccmb.med.umich.edu/DeepMSA/. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Recursive MAGUS: scalable and accurate multiple sequence alignment

2021 ◽  
Author(s):  
Vladimir Smirnov
Keyword(s):  
Open Source ◽  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
State Of The Art ◽  
Sequence Data ◽  
Large Datasets ◽  
Alignment Accuracy ◽  
Multiple Sequence ◽  
Large Numbers ◽  
Source Form

Multiple sequence alignment tools struggle to keep pace with rapidly growing sequence data, as few methods can handle large datasets while maintaining alignment accuracy. We recently introduced MAGUS, a new state-of-the-art method for aligning large numbers of sequences. In this paper, we present a comprehensive set of enhancements that allow MAGUS to align vastly larger datasets with greater speed. We compare MAGUS to other leading alignment methods on datasets of up to one million sequences. Our results demonstrate the advantages of MAGUS over other alignment software in both accuracy and speed. MAGUS is freely available in open-source form at https://github.com/vlasmirnov/MAGUS.

Sign in / Sign up

Export Citation Format

Share Document