|
|||||
|
|
Fast calculation of the quartet distance between trees of arbitrary degrees |
|
| Authors: | Chris Christiansen Thomas Mailund Christian NS Pedersen Martin Randers Martin Stig Stissing |
| Institution: | 1. Department of Computer Science, University of Aarhus, Aabogade 34, DK-8200, ?rhus N, Denmark 2. Department of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK 3. Bioinformatics Research Center, University of Aarhus, H?egh-Guldbergsgade 10, Bldg. 090, DK-8000, ?rhus C, Denmark |
| Abstract: | BackgroundA number of algorithms have been developed for calculating the quartet distance between two evolutionary trees on the same set of species. The quartet distance is the number of quartets – sub-trees induced by four leaves – that differs between the trees. Mostly, these algorithms are restricted to work on binary trees, but recently we have developed algorithms that work on trees of arbitrary degree. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |