Show simple item record

dc.contributor.authorKennedy, Edward
dc.contributor.authorOtt, Jan-Lucas
dc.contributor.authorPapamichail, Dimitris
dc.date.accessioned2017-01-18T00:17:52Z
dc.date.available2017-01-18T00:17:52Z
dc.date.issued2016
dc.descriptionDepartment of Computer Scienceen_US
dc.description.abstractPhylogeny 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.en_US
dc.description.sponsorshipCollege of New Jersey (Ewing, N.J.). Office of Academic Affairsen_US
dc.description.sponsorshipMUSE (Mentored Undergraduate Summer Experience)en_US
dc.language.isoen_USen_US
dc.rightsFile access restricted due to FERPA regulations
dc.titleMost compact parsimonious treesen_US
dc.typePosteren_US
dc.typePresentationen_US
dc.typeTexten_US
dc.identifier.handlehttps://dr.tcnj.edu/handle/2900/740


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record