Reconstruction of Evolutionary Trees

Author(s):  
Kenneth Lange
Keyword(s):  
2019 ◽  
Vol 51 (9) ◽  
pp. 1306-1307 ◽  
Author(s):  
Kelley Harris
Keyword(s):  

Author(s):  
Timothy J. Beanland ◽  
Christopher J. Howe

2001 ◽  
Vol 12 (04) ◽  
pp. 533-550 ◽  
Author(s):  
WING-KAI HON ◽  
TAK-WAH LAM

The nearest neighbor interchange (nni) distance is a classical metric for measuring the distance (dissimilarity) between evolutionary trees. It has been known that computing the nni distance is NP-complete. Existing approximation algorithms can attain an approximation ratio log n for unweighted trees and 4 log n for weighted trees; yet these algorithms are limited to degree-3 trees. This paper extends the study of nni distance to trees with non-uniform degrees. We formulate the necessary and sufficient conditions for nni transformation and devise more topology-sensitive approximation algorithms to handle trees with non-uniform degrees. The approximation ratios are respectively [Formula: see text] and [Formula: see text] for unweighted and weighted trees, where d ≥ 4 is the maximum degree of the input trees.


1997 ◽  
Vol 26 (6) ◽  
pp. 1656-1669 ◽  
Author(s):  
Amihood Amir ◽  
Dmitry Keselman

Sign in / Sign up

Export Citation Format

Share Document