Phylogenetic clocks
| dc.contributor.author | Semple, C. | |
| dc.contributor.author | Steel, M. A. | |
| dc.date.accessioned | 2016-03-10T20:30:10Z | |
| dc.date.available | 2016-03-10T20:30:10Z | |
| dc.date.issued | 2004 | en |
| dc.description.abstract | Graphs obtained from a binary leaf labelled ('phylogenetic') tree by adding an edge so as to introduce a cycle provide a useful representation of hybrid evolution in biology. This class of graphs (which we call 'phylogenetic clocks') also has some attractive combinatorial properties, which we present. We characterize when a set of binary phylogenetic trees is displayed by a phylogenetic clock in terms of tree rearrangement operations. This leads to a triple-wise compatibility theorem, and a simple, fast algorithm to determine clock compatibility. We also use generating function techniques to provide closed-form expressions that enumerate phylogenetic clocks with specified or unspecified cycle length. | en |
| dc.identifier.issn | 1172-8531 | |
| dc.identifier.uri | http://hdl.handle.net/10092/11879 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury | en |
| dc.rights | All Rights Reserved | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | |
| dc.subject.anzsrc | Fields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematics | en |
| dc.title | Phylogenetic clocks | en |
| dc.type | Discussion / Working Papers | |
| uc.college | Faculty of Engineering | |
| uc.department | School of Engineering | en |