Search‐based optimization
Published in Cladistics • Aug 1, 2003
Authors:
Ward C. Wheeler
Abstract
The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include p...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!