On the complexity of inferring rooted evolutionary trees

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

23 Citations (Scopus)

Abstract

We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from [3].
Original languageEnglish
Title of host publicationProceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001)
EditorsJayme Luiz Szwarcfiter
Pages50-53
Number of pages4
Volume7
Publication statusPublished - 1 Dec 2001
Externally publishedYes
EventProceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001) - , Brazil
Duration: 17 Mar 200119 Mar 2001

Publication series

NameElectronic Notes in Discrete Mathematics
PublisherElsevier
ISSN (Print)1571-0653

Conference

ConferenceProceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO 2001)
CountryBrazil
Period17/03/0119/03/01

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this