dc.contributor.author | Kennedy, Edward | |
dc.contributor.author | Ott, Jan-Lucas | |
dc.contributor.author | Papamichail, Dimitris | |
dc.date.accessioned | 2017-01-18T00:17:52Z | |
dc.date.available | 2017-01-18T00:17:52Z | |
dc.date.issued | 2016 | |
dc.description | Department of Computer Science | en_US |
dc.description.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. | en_US |
dc.description.sponsorship | College of New Jersey (Ewing, N.J.). Office of Academic Affairs | en_US |
dc.description.sponsorship | MUSE (Mentored Undergraduate Summer Experience) | en_US |
dc.language.iso | en_US | en_US |
dc.rights | File access restricted due to FERPA regulations | |
dc.title | Most compact parsimonious trees | en_US |
dc.type | Poster | en_US |
dc.type | Presentation | en_US |
dc.type | Text | en_US |
dc.identifier.handle | https://dr.tcnj.edu/handle/2900/740 | |