An algorithm for the maximum likelihood problem on evolutionary trees

DOI10.1007/s10878-005-1860-2zbMath1080.62092OpenAlexW2086912569MaRDI QIDQ2576441

Carlos A. S. Oliveira

Publication date: 13 December 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-1860-2

zbMATH Keywords

combinatorial optimizationgenetic algorithmphylogenetic analysisgenetic sequences

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Point estimation (62F10) Problems related to evolution (92D15) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Uses Software

• Scatter Search
• LVB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of inferring rooted phylogenies by parsimony
• The Steiner problem in phylogeny is NP-complete
• Distinguishing string selection problems.
• A genetic algorithm for the weight setting problem in OSPF routing
• Optimal Solutions for the Closest-String Problem via Integer Programming

This page was built for publication: An algorithm for the maximum likelihood problem on evolutionary trees