.png){kind=icon}
.png){kind=icon}
Return
Large multiple sequence alignments with a root-to-leaf regressive method
.png){kind=icon}
OA
AI
DOI：10.1038/s41587-019-0333-6.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiple sequence alignments (MSAs) are used for structural(1,2) and evolutionary predictions(1,2), but the complexity of aligning large datasets requires the use of approximate solutions(3), including the progressive algorithm(4). Progressive MSA methods start by aligning the most similar sequences and subsequently incorporate the remaining sequences, from leaf to root, based on a guide tree. Their accuracy declines substantially as the number of sequences is scaled up(5). We introduce a regressive algorithm that enables MSA of up to 1.4 million sequences on a standard workstation and substantially improves accuracy on datasets larger than 10,000 sequences. Our regressive algorithm works the other way around from the progressive algorithm and begins by aligning the most dissimilar sequences. It uses an efficient divide-and-conquer strategy to run third-party alignment methods in linear time, regardless of their original complexity. Our approach will enable analyses of extremely large genomic datasets such as the recently announced Earth BioGenome Project, which comprises 1.5 million eukaryotic genomes(6).
Keywords:
MAFFT
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
41.7
Papers:
1.2W
Citations:
10.1W
View more organizations