## On The Computational Complexity of Inferring Evolutionary Trees (1993)

Citations: | 20 - 5 self |

### BibTeX

@MISC{Wareham93onthe,

author = {Harold Todd Wareham},

title = {On The Computational Complexity of Inferring Evolutionary Trees},

year = {1993}

}

### OpenURL

### Abstract

The process of reconstructing evolutionary trees can be viewed formally as an optimization problem. Recently, decision problems associated with the most commonly used approaches to reconstructing such trees have been shown to be NP-complete [Day87, DJS86, DS86, DS87, GF82, Kri88, KM86]. In this thesis, a framework is established that incorporates all such problems studied to date. Within this framework, the NP-completeness results for decision problems are extended by applying theorems from [CT91, Gas86, GKR92, JVV86, KST89, Kre88, Sel91] to derive bounds on the computational complexity of several functions associated with each of these problems, namely ffl evaluation functions, which return the cost of the optimal tree(s), ffl solution functions, which return an optimal tree, ffl spanning functions, which return the number of optimal trees, ffl enumeration functions, which systematically enumerate all optimal trees, and ffl random-selection functions, which return a random...