The size of a maximum agreement subtree for random binary trees
| dc.contributor.author | Bryant, D. | |
| dc.contributor.author | McKenzie, A. | |
| dc.contributor.author | Steel, M. | |
| dc.date.accessioned | 2009-11-25T20:44:05Z | |
| dc.date.available | 2009-11-25T20:44:05Z | |
| dc.date.issued | 2003 | en |
| dc.description | First published in BioConsensus, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 61, pp. 55-65., published by the American Mathematical Society | en |
| dc.description.abstract | In computational biology, a common way to compare two rooted trees that classify the same set L of labelled leaves is to determine the largest subset of L on which the two trees agree. In this paper we consider the size of this quantity if one or both trees are generated randomly, according to two simple null models. We obtain analytical bounds, as well as providing some simulation results that suggest a power law similar to the related problem of determining the length of the longest increasing sequence in a random permutation. | en |
| dc.identifier.citation | Bryant, D., McKenzie, A., Steel, M. (2003) The size of a maximum agreement subtree for random binary trees. BioConsensus, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 61, pp. 55-65. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/3178 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury. Mathematics and Statistics | en |
| dc.rights.uri | https://hdl.handle.net/10092/17651 | en |
| dc.subject.marsden | Fields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematics | en |
| dc.title | The size of a maximum agreement subtree for random binary trees | en |
| dc.type | Journal Article |
Files
Original bundle
1 - 1 of 1