A branch-and-bound algorithm for the inference of ancestral amino-acid sequences when the replacement rate varies among sites: Application to the evolution of five gene families

Tal Pupko*, Itsik Pe'er, Masami Hasegawa, Dan Graur, Nir Friedman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 replacement, or tracing the biochemical changes that occurred during the evolution of a given protein family. Results: We give an algorithm that guarantees finding the global maximum. The efficient search method makes our method applicable to datasets with large number sequences. We analyze ancestral sequences of five gene families, exploring the effect of the amount of among-site-rate-variation, and the degree of sequence divergence on the resulting ancestral states.

Original languageEnglish
Pages (from-to)1116-1123
Number of pages8
JournalBioinformatics
Volume18
Issue number8
DOIs
StatePublished - Aug 2002

Fingerprint

Dive into the research topics of 'A branch-and-bound algorithm for the inference of ancestral amino-acid sequences when the replacement rate varies among sites: Application to the evolution of five gene families'. Together they form a unique fingerprint.

Cite this