The Library
Unique perfect phylogeny is NP-hard
Tools
Habib, Michel and Stacho, Juraj (2011) Unique perfect phylogeny is NP-hard. In: Combinatorial Pattern Matching; 22nd Annual Symposium, CPM 2011, Palermo, Italy, 27-29 Jun 2011. . Published in: Lecture Notes in Computer Science, Vol.6661 pp. 132-146. doi:10.1007/978-3-642-21458-5_13 ISSN 0302-9743.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/978-3-642-21458-5_13
Abstract
We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: βIs the following problem NP -hard? Given a ternary phylogenetic X -tree T and a collection Q of quartet subtrees on X , is T the only tree that displays Q ?β [28, 29] As a particular consequence of this, we show that the unique chordal sandwich problem is also NP-hard.
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Lecture Notes in Computer Science | ||||
Publisher: | Springer | ||||
ISSN: | 0302-9743 | ||||
Book Title: | Combinatorial Pattern Matching | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Vol.6661 | ||||
Page Range: | pp. 132-146 | ||||
DOI: | 10.1007/978-3-642-21458-5_13 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | Combinatorial Pattern Matching; 22nd Annual Symposium, CPM 2011 | ||||
Type of Event: | Conference | ||||
Location of Event: | Palermo, Italy | ||||
Date(s) of Event: | 27-29 Jun 2011. |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |