Abstract
dc:description.abstractExamining gene rearrangement is one important method for constructing phylogenies, or evolutionary histories, of taxa. Our research uses Bayesian approach, implemented by a Markov chain Monte Carlo algorithm, for finding the most probable phylogenies and assessing their likelihood given gene arrangement data. In past research, when updating trees, algorithms examined the arrangement data stored in pairs of connected nodes. We develop a new method, which examines the arrangements of the three neighbors of an internal node. The rearrangements found by the method are not guaranteed to be optimal, but will, with high probability, be close to optimal. Initial tests show that the new update method improves the MCMC procedure.
Degree
thesis:*- Name thesis:degree_name
- MS
- Level thesis:degree_level
- Campus Only
- Discipline thesis:degree_discipline
- Computational Mathematics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yang, Xiting
- Contributors dc:contributor
-
- Donald L. Simon
- Francesco Cesareo
- Kathleen A. Taylor
- Patrick Juola
Subjects
dc:subject × 3Rights
- Language dc:language
- English
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dsc.duq.edu/etd/1616