Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen: https://doi.org/10.21256/zhaw-4775
Publikationstyp: Beitrag in wissenschaftlicher Zeitschrift
Art der Begutachtung: Peer review (Publikation)
Titel: Progressive multiple sequence alignment with indel evolution
Autor/-in: Maiolo, Massimo
Zhang, Xiaolei
Gil, Manuel
Anisimova, Maria
DOI: 10.21256/zhaw-4775
10.1186/s12859-018-2357-1
Erschienen in: BMC Bioinformatics
Band(Heft): 19
Heft: 331
Erscheinungsdatum: 2018
Verlag / Hrsg. Institution: BioMed Central
ISSN: 1471-2105
Sprache: Englisch
Schlagwörter: Dynamic programming; Indel; Phylogeny; Poisson process; Probability; Sequence alignment; Algorithms; Molecular evolution; INDEL mutation
Fachgebiet (DDC): 572: Biochemie
Zusammenfassung: Background: Sequence alignment is crucial in genomics studies. However, optimal multiple sequence alignment (MSA) is NP-hard. Thus, modern MSA methods employ progressive heuristics, breaking the problem into a series of pairwise alignments guided by a phylogeny. Changes between homologous characters are typically modelled by a Markov substitution model. In contrast, the dynamics of indels are not modelled explicitly, because the computation of the marginal likelihood under such models has exponential time complexity in the number of taxa. But the failure to model indel evolution may lead to artificially short alignments due to biased indel placement, inconsistent with phylogenetic relationship. Results: Recently, the classical indel model TKF91 was modified to describe indel evolution on a phylogeny via a Poisson process, termed PIP. PIP allows to compute the joint marginal probability of an MSA and a tree in linear time. We present a new dynamic programming algorithm to align two MSAs –represented by the underlying homology paths– by full maximum likelihood under PIP in polynomial time, and apply it progressively along a guide tree. We have corroborated the correctness of our method by simulation, and compared it with competitive methods on an illustrative real dataset. Conclusions: Our MSA method is the first polynomial time progressive aligner with a rigorous mathematical formulation of indel evolution. The new method infers phylogenetically meaningful gap patterns alternative to the popular PRANK, while producing alignments of similar length. Moreover, the inferred gap patterns agree with what was predicted qualitatively by previous studies. The algorithm is implemented in a standalone C++ program.
URI: https://digitalcollection.zhaw.ch/handle/11475/14486
Volltext Version: Publizierte Version
Lizenz (gemäss Verlagsvertrag): CC BY 4.0: Namensnennung 4.0 International
Departement: Life Sciences und Facility Management
Organisationseinheit: Institut für Computational Life Sciences (ICLS)
Enthalten in den Sammlungen:Publikationen Life Sciences und Facility Management

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
2018_Maiolo_Progressive multiple sequence alignment.pdf1.89 MBAdobe PDFMiniaturbild
Öffnen/Anzeigen
Zur Langanzeige
Maiolo, M., Zhang, X., Gil, M., & Anisimova, M. (2018). Progressive multiple sequence alignment with indel evolution. BMC Bioinformatics, 19(331). https://doi.org/10.21256/zhaw-4775
Maiolo, M. et al. (2018) ‘Progressive multiple sequence alignment with indel evolution’, BMC Bioinformatics, 19(331). Available at: https://doi.org/10.21256/zhaw-4775.
M. Maiolo, X. Zhang, M. Gil, and M. Anisimova, “Progressive multiple sequence alignment with indel evolution,” BMC Bioinformatics, vol. 19, no. 331, 2018, doi: 10.21256/zhaw-4775.
MAIOLO, Massimo, Xiaolei ZHANG, Manuel GIL und Maria ANISIMOVA, 2018. Progressive multiple sequence alignment with indel evolution. BMC Bioinformatics. 2018. Bd. 19, Nr. 331. DOI 10.21256/zhaw-4775
Maiolo, Massimo, Xiaolei Zhang, Manuel Gil, and Maria Anisimova. 2018. “Progressive Multiple Sequence Alignment with Indel Evolution.” BMC Bioinformatics 19 (331). https://doi.org/10.21256/zhaw-4775.
Maiolo, Massimo, et al. “Progressive Multiple Sequence Alignment with Indel Evolution.” BMC Bioinformatics, vol. 19, no. 331, 2018, https://doi.org/10.21256/zhaw-4775.


Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt, soweit nicht anderweitig angezeigt.