College
Buchtel College of Arts and Sciences (BCAS)
Date of Last Revision
2023-05-03 16:08:32
Major
Applied Mathematics
Honors Course
3450:498
Number of Credits
3
Degree Name
Bachelor of Science
Date of Expected Graduation
Spring 2020
Abstract
Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate to the program NeighborNet, which inputs networks numerically and describes how they interact against multiple types of networks. Finally, by building upon previous research in this field, we attempt to comprise a formula for counting the total number of possible unweighted binary, triangle free, 2-nested networks.
Research Sponsor
Dr. Stefan Forcey
First Reader
Dr. James Cossey
Second Reader
Dr. Kevin Kreider
Honors Faculty Advisor
Dr. Curtis Clemons
Recommended Citation
Scalzo, Drew, "Phylogenetic Networks and Functions That Relate Them" (2020). Williams Honors College, Honors Research Projects. 1034.
https://ideaexchange.uakron.edu/honors_research_projects/1034
Included in
Algebraic Geometry Commons, Discrete Mathematics and Combinatorics Commons, Other Mathematics Commons, Special Functions Commons