Please use this identifier to cite or link to this item: https://doi.org/10.1142/S0129054104002807
Title: Subtree transfer distance for degree-D phylogenies
Authors: Hon, W.-K.
Lam, T.-W.
Yiu, S.-M.
Kao, M.-Y.
Sung, W.-K. 
Keywords: approximation algorithms
Evolutionary trees
NP-hardness
Issue Date: 2004
Citation: Hon, W.-K., Lam, T.-W., Yiu, S.-M., Kao, M.-Y., Sung, W.-K. (2004). Subtree transfer distance for degree-D phylogenies. International Journal of Foundations of Computer Science 15 (6) : 893-909. ScholarBank@NUS Repository. https://doi.org/10.1142/S0129054104002807
Abstract: The subtree transfer (STT) distance is one of the distance metric for comparing phylogenies. Previous work on computing the STT distance considered degree-3 trees only. In this paper, we give an approximation algorithm for the STT distance for degree-d trees with arbitrary d and with generalized STT operations. Also, some NP-hardness results related to STT distance are presented. © 2004 World Scientific Publishing Company.
Source Title: International Journal of Foundations of Computer Science
URI: http://scholarbank.nus.edu.sg/handle/10635/77927
ISSN: 01290541
DOI: 10.1142/S0129054104002807
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

39
checked on Aug 3, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.