Approximation algorithms for the fixed-topology phylogenetic number problem
UNSPECIFIED (1997) Approximation algorithms for the fixed-topology phylogenetic number problem. In: 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97), UNIV AARHUS, AARHUS, DENMARK, JUN 30-JUL 02, 1997. Published in: COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 1264 pp. 130-149.Full text not available from this repository.
In the l-phylogeny problem, one wishes to construct an evolutionary tree for a. set of species represented by characters, in which each state of each character induces no more than l connected components. We consider the fixed-topology version of this problem for fixed-topologies of arbitrary degree. This version of the problem is known to be NP-complete for l greater than or equal to 3 even for degree-3 trees in which no state labels more than l + 1 leaves (and therefore there is a trivial l + 1 phylogeny) We give a 2-approximation algorithm for all l greater than or equal to 3 for arbitrary input topologies and we give an optimal approximation algorithm that constructs a 4-phylogeny when a 3-phylogeny exists. Dynamic programming techniques, which are typically used in fixed-toplogy problems, cannot be applied to l-phylogeny problems. Our 2-approximation algorithm is the first application of linear programming to approximation algorithms for phylogeny problems. We extend our results to a related problem in which characters are polymorphic.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||COMBINATORIAL PATTERN MATCHING, PROCEEDINGS|
|Editor:||Apostolico, A and Hein, J|
|Number of Pages:||20|
|Page Range:||pp. 130-149|
|Title of Event:||8th Annual Symposium on Combinatorial Pattern Matching (CPM 97)|
|Location of Event:||UNIV AARHUS, AARHUS, DENMARK|
|Date(s) of Event:||JUN 30-JUL 02, 1997|
Actions (login required)