Advanced

On the complexity of inferring rooted evolutionary trees

Jansson, Jesper LU (2001) 7. p.121-125
Abstract
We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from. (form?)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
Electronic Notes in Discrete Mathematics
volume
7
pages
121 - 125
publisher
Elsevier
external identifiers
  • scopus:34247107276
language
English
LU publication?
yes
id
27d6cb78-697e-45be-9de4-eee96b482c62 (old id 526582)
date added to LUP
2016-04-04 11:16:26
date last changed
2020-12-08 02:32:58
@inproceedings{27d6cb78-697e-45be-9de4-eee96b482c62,
  abstract     = {We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from. (form?)},
  author       = {Jansson, Jesper},
  booktitle    = {Electronic Notes in Discrete Mathematics},
  language     = {eng},
  pages        = {121--125},
  publisher    = {Elsevier},
  title        = {On the complexity of inferring rooted evolutionary trees},
  url          = {https://lup.lub.lu.se/search/ws/files/5735102/623755.ps},
  volume       = {7},
  year         = {2001},
}