A method for constructing maximum parsimony ancestral amino acid sequences on a given network

G. William Moore, John Barnabas, Morris Goodman

Research output: Contribution to journalArticle

Abstract

A solution is presented for the problem of how to find ancestral codons which minimize the number of mutations over a given network of species for which character-states of aligned amino acid sequences among the contemporary species are known. Three theorems which allow this "maximum parsimony" problem to be solved are proved; then the use of these theorems in finding maximum parsimony ancestral codons is illustrated on a network of chicken and mammalian alpha globin amino acid sequences at two alignment positions.

Original languageEnglish (US)
Pages (from-to)459-485
Number of pages27
JournalJournal of Theoretical Biology
Volume38
Issue number3
DOIs
StatePublished - 1973
Externally publishedYes

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)

Fingerprint Dive into the research topics of 'A method for constructing maximum parsimony ancestral amino acid sequences on a given network'. Together they form a unique fingerprint.

  • Cite this