Abstract

We introduce PASTA, a new multiple sequence alignment algorithm. PASTA uses a new technique to produce an alignment given a guide tree that enables it to be both highly scalable and very accurate. We present a study on biological and simulated data with up to 200,000 sequences, showing that PASTA produces highly accurate alignments, improving on the accuracy and scalability of the leading alignment methods (including SATé). We also show that trees estimated on PASTA alignments are highly accurate--slightly better than SATé trees, but with substantial improvements relative to other methods. Finally, PASTA is faster than SATé, highly parallelizable, and requires relatively little memory.

Keywords

ScalabilityMultiple sequence alignmentParallelizable manifoldComputer scienceSequence (biology)Alignment-free sequence analysisSequence alignmentTree (set theory)AlgorithmComputational biologyData miningBiologyMathematicsPeptide sequenceGenetics

Affiliated Institutions

Related Publications

Publication Info

Year
2014
Type
article
Volume
22
Issue
5
Pages
377-386
Citations
446
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

446
OpenAlex

Cite This

Siavash Mirarab, Nam Nguyen, Sheng Guo et al. (2014). PASTA: Ultra-Large Multiple Sequence Alignment for Nucleotide and Amino-Acid Sequences. Journal of Computational Biology , 22 (5) , 377-386. https://doi.org/10.1089/cmb.2014.0156

Identifiers

DOI
10.1089/cmb.2014.0156