Moore, G. William ; Barnabas, John ; Goodman, Morris (1973) A method for constructing maximum parsimony ancestral amino acid sequences on a given network Journal of Theoretical Biology, 38 (3). pp. 459-485. ISSN 0022-5193
Full text not available from this repository.
Official URL: http://linkinghub.elsevier.com/retrieve/pii/002251...
Related URL: http://dx.doi.org/10.1016/0022-5193(73)90252-X
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 2316 |
| Deposited On: | 07 Oct 2010 09:55 |
| Last Modified: | 18 Jan 2011 03:31 |
Repository Staff Only: item control page
