• Login
    View Item 
    •   Digital Repository Home
    • TCNJ Scholars (Faculty and Student Research)
    • Student Research
    • MUSE (Mentored Undergraduate Summer Experience)
    • View Item
    •   Digital Repository Home
    • TCNJ Scholars (Faculty and Student Research)
    • Student Research
    • MUSE (Mentored Undergraduate Summer Experience)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Most compact parsimonious trees

    Thumbnail
    View/Open
    Poster (178.4Kb)
    Date
    2016
    Author
    Kennedy, Edward
    Ott, Jan-Lucas
    Papamichail, Dimitris
    Metadata
    Show full item record
    Abstract
    Abstract
    Phylogeny is the evolutionary history of a set of species, represented in the form of a tree. Construction of phylogenetic trees has traditionally focused on binary trees where all species appear on leaves. However, certain domains such as viral evolution, paleontology, linguistics, and stemmatics, often involve phylogeny inference where extant species are placed on internal nodes and polytomies are present. Previous work on this project involved designing and implementing algorithms to find the most compact most parsimonious trees that allow for extant ancestors and multifurcations. Our work expands upon this, investigating mixed-weight parsimony using Sankoff’s algorithm (see middle section). Our work also involved optimizing the existing codebase to collect data and apply the method to stemmatics.
    Description
    Department of Computer Science
    Rights
    File access restricted due to FERPA regulations
    Collections
    • MUSE (Mentored Undergraduate Summer Experience)

    DSpace software copyright © 2002-2016  DuraSpace
    | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    DSpace software copyright © 2002-2016  DuraSpace
    | Send Feedback
    Theme by 
    Atmire NV