• Admin
    UC Research Repository
    View Item 
       
    • UC Home
    • Library
    • UC Research Repository
    • College of Engineering
    • Engineering: Journal Articles
    • View Item
       
    • UC Home
    • Library
    • UC Research Repository
    • College of Engineering
    • Engineering: Journal Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of the RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    Statistics

    View Usage Statistics

    Identifying phylogenetic trees

    Thumbnail
    View/Open
    12596753_BHS05.pdf (177.4Kb)
    Author
    Bordewich, M.
    Huber, K.T.
    Semple, C.
    Date
    2005
    Permanent Link
    http://hdl.handle.net/10092/1669

    A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection C of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays C have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when C identifies an X-tree, and the second describes when a compatible subset of C is of maximum size.

    Subjects
    Fields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematics
    Collections
    • Engineering: Journal Articles [935]
    Rights
    http://library.canterbury.ac.nz/ir/rights.shtml

    UC Research Repository
    University Library
    University of Canterbury
    Private Bag 4800
    Christchurch 8140

    Phone
    364 2987 ext 8718

    Email
    ucresearchrepository@canterbury.ac.nz

    Follow us
    FacebookTwitterYoutube

    © University of Canterbury Library
    Send Feedback | Contact Us