Tree Contractions and Evolutionary Trees
| dc.creator | Kao, Ming-Yang | |
| dc.date | 2001-01-26 | |
| dc.date.accessioned | 2026-07-07T03:16:53Z | |
| dc.date.available | 2026-07-07T03:16:53Z | |
| dc.description | An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of species. An agreement subtree of two evolutionary trees is an evolutionary tree which is also a topological subtree of the two given trees. We give an algorithm to determine the largest possible number of leaves in any agreement subtree of two trees T_1 and T_2 with n leaves each. If the maximum degree d of these trees is bounded by a constant, the time complexity is O(n log^2(n)) and is within a log(n) factor of optimal. For general d, this algorithm runs in O(n d^2 log(d) log^2(n)) time or alternatively in O(n d sqrt(d) log^3(n)) time. | |
| dc.identifier | https://arxiv.org/abs/cs/0101030 | |
| dc.identifier | http://arxiv.org/abs/cs/0101030 | |
| dc.identifier | SIAM Journal on Computing, 27(6):1592--1616, December 1998 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30525 | |
| dc.subject | Computational Engineering, Finance, and Science | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2; J.3 | |
| dc.title | Tree Contractions and Evolutionary Trees | |
| dc.type | text |