• Login
    View Item 
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Technical Reports
    • View Item
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Maximum Agreement Subtree In a Set Of Evolutionary Trees

    Thumbnail
    View/Open
    GIT-CC-93-41.pdf (162.9Kb)
    Date
    1993
    Author
    Amir, Amihood
    Keselman, Dmitry
    Metadata
    Show full item record
    Abstract
    The maximum agreement subtree approach is one method of reconciling different evolution trees for the same set of species. Recently, dynamic programming ideas were used by Steele and Warnow to provide polynomial time algorithms for finding a maximum agreement subtree of two trees. Their methods do not generalize to sets of more than two trees. In this paper we prove that the maximum agreement subtree problem is NP-complete for three trees with unbounded degrees. We also develop a new method for finding the maximum agreement subtree of k trees of degree d. This new method enables us to find the maximum agreement subtree in time O(n[superscript d]+kn³)
    URI
    http://hdl.handle.net/1853/6773
    Collections
    • College of Computing Technical Reports [506]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology