Defining a phylogenetic tree with the minimum number of r-state characters
| dc.contributor.author | Bordewich, M. | |
| dc.contributor.author | Semple, C. | |
| dc.date.accessioned | 2016-02-01T01:12:33Z | |
| dc.date.available | 2016-02-01T01:12:33Z | |
| dc.date.issued | 2015 | en |
| dc.description.abstract | Semple and Steel (2002) showed that if T is a phylogenetic X-tree and C is a collection of r-state characters that defines T , then |C| >[(n 3)/(r - 1)], where n = [X]. In this paper, we show that, provided n is sufficiently large, this lower bound is sharp. Furthermore, we show that, for all n > 13, there exists a collection of 4-state characters of size [(n - 3)/3] that defines T , but there is a phylogenetic X-tree with n = 12 which is not de ned by any set of 3 characters. | en |
| dc.identifier.citation | Bordewich, M., Semple, C. (2015) Defining a phylogenetic tree with the minimum number of r-state characters. SIAM Journal on Discrete Mathematics, 29(2), pp. 835-853. | en |
| dc.identifier.doi | https://doi.org/10.1137/130924469 | |
| dc.identifier.uri | http://hdl.handle.net/10092/11742 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury. Mathematics and Statistics | en |
| dc.rights.uri | https://hdl.handle.net/10092/17651 | |
| dc.subject | Phylogenetic tree | en |
| dc.subject | r-state character | en |
| dc.subject | chordal graph | en |
| dc.subject.anzsrc | Fields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematics | en |
| dc.title | Defining a phylogenetic tree with the minimum number of r-state characters | en |
| dc.type | Journal Article |
Files
Original bundle
1 - 1 of 1