An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees

Carlos A. S. Oliveira ()
Additional contact information
Carlos A. S. Oliveira: Oklahoma State University

Journal of Combinatorial Optimization, 2005, vol. 10, issue 1, No 5, 75 pages

Abstract: Abstract We investigate the problem of reconstructing evolutionary trees with maximum likelihood (MLET). In the MLET problem, a set of genetic sequences is given and a feasible solution is sought, consisting of an evolutionary tree (where general nodes correspond to sequences and input sequences occur as leaves) along with assignments for the interior nodes. Due to the difficulty of solving the MLET directly, we consider two restricted versions of the problem: the ancestral maximum likelihood (AML) and the maximum parsimony (MP) problems. If we let d e denote the number of different characters occurring in two nodes linked by edge e, then the objective function of the AML problem is min ∑eσ E(T) H(d e /k), where H is the entropy function and k is the length of each sequence. In the MP we consider the objective function min σe∊ E(T) d e /k. Both the AML and the MP are NP-hard. We propose a new approach for computing solutions for these problems, based on genetic algorithms.

Keywords: genetic sequences; phylogenetic analysis; combinatorial optimization; genetic algorithm (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-1860-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:10:y:2005:i:1:d:10.1007_s10878-005-1860-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-1860-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().