Abstract
We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from. (form?)
Original language | English |
---|---|
Title of host publication | Electronic Notes in Discrete Mathematics |
Publisher | Elsevier |
Pages | 121-125 |
Volume | 7 |
Publication status | Published - 2001 |
Publication series
Name | |
---|---|
Volume | 7 |
Subject classification (UKÄ)
- Computer Sciences