1. DasGupta B, He X, Jiang T, Li M, Tromp J (1999) On the linear-cost subtree-transfer distance between phylogenetic trees. Algorithmica 25(2–3):176–195
2. DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L (1997) On distances between phylogenetic trees. In: Proceedings of the eighth ACM-SIAM annual symposium on discrete algorithms (SODA), New Orleans. SIAM, pp 427–436
3. Day WHE (1985) Optimal algorithms for comparing trees with labeled leaves. J Classif 2:7–28
4. Hon WK, Lam TW (2001) Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees. Int J Found Comp Sci 12(4):533–550
5. Hon WK, Kao MY, Lam TW, Sung WK, Yiu SM (2004) Non-shared edges and nearest neighbor interchanges revisited. Inf Process Lett 91(3):129–134