[[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[[fileno]]2030245010005[[department]]資訊工程學
The definition of similarity measures for phylogenetic trees has been motivated by the computation o...
The transfer distance (TD) was introduced in the classification framework and studied in the context...
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a t...
10.1142/S0129054104002807International Journal of Foundations of Computer Science156893-90
In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune an...
In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune an...
Different phylogenetic trees for the same group of species are often produced either by procedures t...
Abstract. We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distanc...
We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between ...
The subtree prune and regraft distance (dSPR) between phylogenetic trees is important both as a gene...
) B. DasGupta X. He y T. Jiang z M. Li x J. Tromp -- L. Zhang k Abstract Different phyl...
Abstract Background Recently, Hill et al. 1 implemented a new software package--called SPRIT--which ...
textabstractIn this chapter, we survey some results on some transformation-based distances for evolu...
Abstract: Phylogenetic trees have been widely used in the study of evolutionary biology for represen...
AbstractIn this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree ...
The definition of similarity measures for phylogenetic trees has been motivated by the computation o...
The transfer distance (TD) was introduced in the classification framework and studied in the context...
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a t...
10.1142/S0129054104002807International Journal of Foundations of Computer Science156893-90
In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune an...
In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune an...
Different phylogenetic trees for the same group of species are often produced either by procedures t...
Abstract. We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distanc...
We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between ...
The subtree prune and regraft distance (dSPR) between phylogenetic trees is important both as a gene...
) B. DasGupta X. He y T. Jiang z M. Li x J. Tromp -- L. Zhang k Abstract Different phyl...
Abstract Background Recently, Hill et al. 1 implemented a new software package--called SPRIT--which ...
textabstractIn this chapter, we survey some results on some transformation-based distances for evolu...
Abstract: Phylogenetic trees have been widely used in the study of evolutionary biology for represen...
AbstractIn this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree ...
The definition of similarity measures for phylogenetic trees has been motivated by the computation o...
The transfer distance (TD) was introduced in the classification framework and studied in the context...
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a t...
DOI
Add to ORKG