@inproceedings{a9756fc27c364eaba2902e050930ef63,

title = "On the complexity of computing evolutionary trees",

abstract = "In this paper we study a few important tree optimization problems with applications to computational biology. These problems ask for trees that are consistent with an as large part, of the given data as possible. We show that the maximum homeomorphic agreement subtree problem cannot be approximated within a factor of Nε, where N is the input size, for any 0 ≤ ε < 1/18 in polynomial time unless P=NP, even if all the given trees are of height 2. On the other hand, we present an O(N log N)-time heuristic for the restriction of this problem to instances with O(1) trees of height O(1) yielding solutions within a constant factor of the optimum. We prove that the maximum inferred consensus tree problem is NP-complete, and we provide a simple fast heuristic for it yielding solutions within one third of the optimum. We also present a more specialized polynomial-time heuristic for the maximum inferred local consensus tree problem.",

author = "Leszek Gasieniec and Jesper Jansson and Andrzej Lingas and Anna {\"O}stlin",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 3rd Annual International Computing and Combinatorics Conference, COCOON 1997 ; Conference date: 20-08-1997 Through 22-08-1997",

year = "1997",

doi = "10.1007/bfb0045080",

language = "English (US)",

isbn = "354063357X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "134--145",

editor = "Tao Jiang and D.T. Lee",

booktitle = "Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings",

}