Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Approximation algorithms for the fixed-topology phylogenetic number problem

Tools
- Tools
+ Tools

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.

Abstract

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
Publisher: SPRINGER-VERLAG BERLIN
ISBN: 3-540-63220-4
ISSN: 0302-9743
Editor: Apostolico, A and Hein, J
Date: 1997
Volume: 1264
Number of Pages: 20
Page Range: pp. 130-149
Publication Status: Published
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
URI: http://wrap.warwick.ac.uk/id/eprint/11855

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us