SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees - PubMed (original) (raw)
SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees
Kevin Liu et al. Syst Biol. 2012 Jan.
Abstract
Highly accurate estimation of phylogenetic trees for large data sets is difficult, in part because multiple sequence alignments must be accurate for phylogeny estimation methods to be accurate. Coestimation of alignments and trees has been attempted but currently only SATé estimates reasonably accurate trees and alignments for large data sets in practical time frames (Liu K., Raghavan S., Nelesen S., Linder C.R., Warnow T. 2009b. Rapid and accurate large-scale coestimation of sequence alignments and phylogenetic trees. Science. 324:1561-1564). Here, we present a modification to the original SATé algorithm that improves upon SATé (which we now call SATé-I) in terms of speed and of phylogenetic and alignment accuracy. SATé-II uses a different divide-and-conquer strategy than SATé-I and so produces smaller more closely related subsets than SATé-I; as a result, SATé-II produces more accurate alignments and trees, can analyze larger data sets, and runs more efficiently than SATé-I. Generally, SATé is a metamethod that takes an existing multiple sequence alignment method as an input parameter and boosts the quality of that alignment method. SATé-II-boosted alignment methods are significantly more accurate than their unboosted versions, and trees based upon these improved alignments are more accurate than trees based upon the original alignments. Because SATé-I used maximum likelihood (ML) methods that treat gaps as missing data to estimate trees and because we found a correlation between the quality of tree/alignment pairs and ML scores, we explored the degree to which SATé's performance depends on using ML with gaps treated as missing data to determine the best tree/alignment pair. We present two lines of evidence that using ML with gaps treated as missing data to optimize the alignment and tree produces very poor results. First, we show that the optimization problem where a set of unaligned DNA sequences is given and the output is the tree and alignment of those sequences that maximize likelihood under the Jukes-Cantor model is uninformative in the worst possible sense. For all inputs, all trees optimize the likelihood score. Second, we show that a greedy heuristic that uses GTR+Gamma ML to optimize the alignment and the tree can produce very poor alignments and trees. Therefore, the excellent performance of SATé-II and SATé-I is not because ML is used as an optimization criterion for choosing the best tree/alignment pair but rather due to the particular divide-and-conquer realignment techniques employed.
Similar articles
- Rapid and accurate large-scale coestimation of sequence alignments and phylogenetic trees.
Liu K, Raghavan S, Nelesen S, Linder CR, Warnow T. Liu K, et al. Science. 2009 Jun 19;324(5934):1561-4. doi: 10.1126/science.1171243. Science. 2009. PMID: 19541996 - Ancestral sequence alignment under optimal conditions.
Hudek AK, Brown DG. Hudek AK, et al. BMC Bioinformatics. 2005 Nov 17;6:273. doi: 10.1186/1471-2105-6-273. BMC Bioinformatics. 2005. PMID: 16293191 Free PMC article. - On the quality of tree-based protein classification.
Lazareva-Ulitsky B, Diemer K, Thomas PD. Lazareva-Ulitsky B, et al. Bioinformatics. 2005 May 1;21(9):1876-90. doi: 10.1093/bioinformatics/bti244. Epub 2005 Jan 12. Bioinformatics. 2005. PMID: 15647305 - Alignment methods: strategies, challenges, benchmarking, and comparative overview.
Löytynoja A. Löytynoja A. Methods Mol Biol. 2012;855:203-35. doi: 10.1007/978-1-61779-582-4_7. Methods Mol Biol. 2012. PMID: 22407710 Review. - Multiple sequence alignment: in pursuit of homologous DNA positions.
Kumar S, Filipski A. Kumar S, et al. Genome Res. 2007 Feb;17(2):127-35. doi: 10.1101/gr.5232407. Genome Res. 2007. PMID: 17272647 Review.
Cited by
- Scaling DEPP phylogenetic placement to ultra-large reference trees: a tree-aware ensemble approach.
Jiang Y, McDonald D, Perry D, Knight R, Mirarab S. Jiang Y, et al. Bioinformatics. 2024 Jun 3;40(6):btae361. doi: 10.1093/bioinformatics/btae361. Bioinformatics. 2024. PMID: 38870525 Free PMC article. - Redescription, molecular characterisation and Wolbachia endosymbionts of Mansonella (Tupainema) dunni (Mullin & Orihel, 1972) (Spirurida: Onchocercidae) from the common treeshrew Tupaia glis Diard & Duvaucel (Mammalia: Scandentia) in Peninsular Malaysia.
Mat Udin AS, Uni S, Rodrigues J, Martin C, Junker K, Agatsuma T, Low VL, Saijuntha W, Omar H, Zainuri NA, Fukuda M, Matsubayashi M, Kimura D, Takaoka H, Ramli R. Mat Udin AS, et al. Curr Res Parasitol Vector Borne Dis. 2023 Nov 23;5:100154. doi: 10.1016/j.crpvbd.2023.100154. eCollection 2024. Curr Res Parasitol Vector Borne Dis. 2023. PMID: 38193019 Free PMC article. - EMMA: a new method for computing multiple sequence alignments given a constraint subset alignment.
Shen C, Liu B, Williams KP, Warnow T. Shen C, et al. Algorithms Mol Biol. 2023 Dec 7;18(1):21. doi: 10.1186/s13015-023-00247-x. Algorithms Mol Biol. 2023. PMID: 38062452 Free PMC article. - System-wide mapping of peptide-GPCR interactions in C. elegans.
Beets I, Zels S, Vandewyer E, Demeulemeester J, Caers J, Baytemur E, Courtney A, Golinelli L, Hasakioğulları İ, Schafer WR, Vértes PE, Mirabeau O, Schoofs L. Beets I, et al. Cell Rep. 2023 Sep 26;42(9):113058. doi: 10.1016/j.celrep.2023.113058. Epub 2023 Aug 31. Cell Rep. 2023. PMID: 37656621 Free PMC article. - Leveraging protein language models for accurate multiple sequence alignments.
McWhite CD, Armour-Garb I, Singh M. McWhite CD, et al. Genome Res. 2023 Jul;33(7):1145-1153. doi: 10.1101/gr.277675.123. Epub 2023 Jul 6. Genome Res. 2023. PMID: 37414576 Free PMC article.
Publication types
MeSH terms
Substances
LinkOut - more resources
Full Text Sources
Other Literature Sources
Miscellaneous