A Fast Algorithm for Joint Reconstruction of Ancestral Amino Acid Sequences

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Tal Pupko, Itsik Pe, Ron Shamir, Dan Graur
Journal/Conference Name Molecular Biology and Evolution
Paper Category , ,
Paper Abstract A dynamic programming algorithm is developed for maximum-likelihood reconstruction of the set of all ancestral amino acid sequences in a phylogenetic tree. To date, exhaustive algorithms that find the most likely set of ancestral states (joint reconstruction) have running times that scale exponentially with the number of sequences and are thus limited to very few taxa. The time requirement of our new algorithm scales linearly with the number of sequences and is therefore applicable to practically any number of taxa. A detailed description of the new algorithm and an example of its application to cytochrome b sequences are provided.
Date of publication 2000
Code Programming Language Python
Comment

Copyright Researcher 2022