On the complexity of inferring rooted evolutionary trees

Jesper Jansson

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

    60 Downloads (Pure)

    Abstract

    We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from. (form?)
    Original languageEnglish
    Title of host publicationElectronic Notes in Discrete Mathematics
    PublisherElsevier
    Pages121-125
    Volume7
    Publication statusPublished - 2001

    Publication series

    Name
    Volume7

    Subject classification (UKÄ)

    • Computer Sciences

    Cite this