Please use this identifier to cite or link to this item: https://doi.org/10.21256/zhaw-4266
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaiolo, Massimo-
dc.contributor.authorZhang, Xiaolei-
dc.contributor.authorGil, Manuel-
dc.contributor.authorAnisimova, Maria-
dc.date.accessioned2018-07-09T14:04:15Z-
dc.date.available2018-07-09T14:04:15Z-
dc.date.issued2017-
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/7766-
dc.description.abstractSequence alignment lies at the heart of many evolutionary and comparative genomics studies. However, the optimal alignment of multiple sequences is NP-hard, so that exact algorithms become impractical for more than a few sequences. Thus, state of the art alignment methods employ progressive heuristics, breaking the problem into a series of pairwise alignments guided by a phylogenetic tree. Changes between homologous characters are typically modelled by a continuous-time Markov substitution model. In contrast, the dynamics of insertions and deletions (indels) are not modelled explicitly, because the computation of the marginal likelihood under such models has exponential time complexity in the number of taxa. Recently, Bouchard-Côté and Jordan [PNAS (2012) 110(4):1160-1166] have introduced a modification to a classical indel model, describing indel evolution on a phylogenetic tree as a Poisson process. The model termed PIP allows to compute the joint marginal probability of a multiple sequence alignment and a tree in linear time. Here, we present an new dynamic programming algorithm to align two multiple sequence alignments by maximum likelihood in polynomial time under PIP, and apply it a in progressive algorithm. To our knowledge, this is the first progressive alignment method using a rigorous mathematical formulation of an evolutionary indel process and with polynomial time complexity.de_CH
dc.format.extent8de_CH
dc.language.isoende_CH
dc.publisherSelbstverlagde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subject.ddc510: Mathematikde_CH
dc.subject.ddc572: Biochemiede_CH
dc.titleProgressive multiple sequence alignment with the Poisson Indel Processde_CH
dc.typeWeiteres (textuelles Material)de_CH
dcterms.typeTextde_CH
zhaw.departementLife Sciences und Facility Managementde_CH
zhaw.organisationalunitInstitut für Computational Life Sciences (ICLS)de_CH
dc.identifier.doi10.21256/zhaw-4266-
dc.identifier.doi10.1101/123513de_CH
zhaw.funding.euNode_CH
zhaw.originated.zhawYesde_CH
zhaw.publication.statussubmittedVersionde_CH
zhaw.webfeedBiomedical String Analysisde_CH
zhaw.webfeedComputational Genomicsde_CH
Appears in collections:Publikationen Life Sciences und Facility Management

Files in This Item:
File Description SizeFormat 
123513.full.pdf256.45 kBAdobe PDFThumbnail
View/Open
Show simple item record
Maiolo, M., Zhang, X., Gil, M., & Anisimova, M. (2017). Progressive multiple sequence alignment with the Poisson Indel Process. Selbstverlag. https://doi.org/10.21256/zhaw-4266
Maiolo, M. et al. (2017) Progressive multiple sequence alignment with the Poisson Indel Process. Selbstverlag. Available at: https://doi.org/10.21256/zhaw-4266.
M. Maiolo, X. Zhang, M. Gil, and M. Anisimova, Progressive multiple sequence alignment with the Poisson Indel Process. Selbstverlag, 2017. doi: 10.21256/zhaw-4266.
MAIOLO, Massimo, Xiaolei ZHANG, Manuel GIL und Maria ANISIMOVA, 2017. Progressive multiple sequence alignment with the Poisson Indel Process. Selbstverlag
Maiolo, Massimo, Xiaolei Zhang, Manuel Gil, and Maria Anisimova. 2017. Progressive Multiple Sequence Alignment with the Poisson Indel Process. Selbstverlag. https://doi.org/10.21256/zhaw-4266.
Maiolo, Massimo, et al. Progressive Multiple Sequence Alignment with the Poisson Indel Process. Selbstverlag, 2017, https://doi.org/10.21256/zhaw-4266.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.