TY - GEN

T1 - On the complexity of inferring rooted evolutionary trees

AU - Jansson, Jesper Andreas

PY - 2001/12/1

Y1 - 2001/12/1

N2 - We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from [3].

AB - We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from [3].

UR - http://www.scopus.com/inward/record.url?scp=34247107276&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

VL - 7

T3 - Electronic Notes in Discrete Mathematics

SP - 50

EP - 53

BT - Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001)

A2 - Szwarcfiter, Jayme Luiz

T2 - Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001)

Y2 - 17 March 2001 through 19 March 2001

ER -