Publication View

A Branch-and-Bound Algorithm for the Inference of Ancestral Amino-Acid Sequences When the Replacement Rate Varies Among Sites (2002)

Abstract
Motivation: We developed an algorithm to reconstruct ancestral sequences, taking into account the rate variation among sites of the protein sequences. Our algorithm maximizes the joint probability of the ancestral sequences, assuming that the rate is gamma distributed among sites. Our algorithm provably finds the global maximum. The use of joint reconstruction is motivated by studies that use the sequences at all the internal nodes in a phylogenetic tree, such as, for instance, the inference of patterns of amino-acid replacements, or tracing the biochemical changes that occurred during the evolution of a protein along a predefined lineage.

Publication details
Download http://citeseer.ist.psu.edu/533592.html
Source http://www.cs.huji.ac.il/~nirf/Papers/PPHGF1.pdf
Publisher unknown
Contributors The Pennsylvania State University CiteSeer Archives
Repository CiteSeer (United States)
Keywords Tal Pupko,Masami Hasegawa,Dan Graur,Nir Friedman A Branch-and-Bound Algorithm for the Inference of Ancestral Amino-Acid Sequences When the Replacement Rate Varies Among Sites
Language Englisch