B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, On distance between phylogenetic trees, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 427-436, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Case Study: Visualizing Sets of Evolutionary Trees - Amenta, Klingner (2002) (5 citations) (Correct)
....terms of bipartitions; hence trees close together with respect to RF distance tend to have a wellresolved strict consensus tree. In addition, computing most alternative distances, such as nearest neighbor interchange distance (NNI) or tree bisection and reconnection distance (TBR) is NP complete [7, 1]. The RF distance between two trees counts the number bipartitions that are not shared by the two trees: ##b i # T 1 # b i ## T 2 ## # ##b i ## T 1 # b i # T 2 ## n The distance is normalized by n, the number of taxa. Since RF distance is a particular kind of Hamming distance, it is a metric. ....
B. dasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang. On distances between phylogenetic trees. In Proceedings of the 8th ACM-SIAM Symposium of Discrete Algorithms, pages 427-436, 1997.
Some Approximation Results for the Maximum Agreement.. - Rodrigues, Sagot.. (Correct)
....was done. Partially supported by CNPq (Procs. 304527 89 0 and 464114 00 4) and by ProNEx Project 107 97 (Proc. CNPq 664107 97 4) interchange) SPR (subtree prune and regraft) and TBR (tree bisection and reconnection) for measuring the distance between two phylogenies have been de ned [5, 4, 2]. Many results relating these concepts are presented by Allen and Steel [1] In particular, they show that the size of a maximum agreement forest of two trees is precisely the TBR distance between them. We are concerned here with the problem of nding the size of a maximum agreement forest of two ....
B. dasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang. On distances between phylogenetic trees. In Proceedings of the 8th ACM-SIAM Symposium of Discrete Algorithms, pages 427-436, 1997.
From Gene Trees to Species Trees - Ma, Li, Zhang (1998) (3 citations) Self-citation (Li Zhang) (Correct)
No context found.
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, On distance between phylogenetic trees, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 427-436, 1997.
On Computing the Nearest Neighbor Interchange Distance - DasGupta, He, Jiang, Li.. (1997) (1 citation) Self-citation (Dasgupta He Jiang Li Tromp Zhang) (Correct)
....for computing the nni distance on weighted phylogenies with a performance ratio of 4 log n 4, where n is the number of leaves in the phylogenies. We also observe that the nni distance is in fact identical to the linear cost subtree transfer distance on unweighted phylogenies discussed in [4, 5]. Some consequences of this observation are also discussed. 1991 Mathematics Subject Classification. Primary 68Q17, 68W40; Secondary 68Q25. The results reported here also form a subset of the results that appeared in Proc. 8th Annual ACM SIAM Symposium on Discrete Algorithms, 1997, pp. 427 436 ....
....Some consequences of this observation are also discussed. 1991 Mathematics Subject Classification. Primary 68Q17, 68W40; Secondary 68Q25. The results reported here also form a subset of the results that appeared in Proc. 8th Annual ACM SIAM Symposium on Discrete Algorithms, 1997, pp. 427 436 [4]. The remaining results of the conference paper which do not appear in this paper appeared separately in Algorithmica, Vol. 25, No. 2, pp. 176 195, 1999. The first author was supported by an CGAT (Canadian Genome Analysis and Technology) grant. The second author was supported in part by CGAT and ....
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang, On distances between phylogenetic trees, in Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 427-436.
On a Mirkin-Muchnik-Smith Conjecture for Comparing Molecular.. - Zhang (1997) (8 citations) Self-citation (Zhang) (Correct)
No context found.
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang. On distance between phylogenetic trees. Proc. of the 8th ACM-SIAM Symposium on Discrete Alg., 427-436, 1997.
On Computing the Nearest Neighbor Interchange Distance - DasGupta, He (1997) (1 citation) Self-citation (Dasgupta He Jiang Li Tromp Zhang) (Correct)
....Zhang BioInformatics Center Kent Ridge Digital Labs Heng Mui Keng Terrace, Singapore 119597 Email: lxzhang bic.nus.edu.sg June 1, 1998 The results reported here also form a subset of the results that appeared in Proc. 8th Annual ACM SIAM Symposium on Discrete Algorithms, 1997, pp. 427 436 [4]. The remaining results of the conference paper which do not appear in this paper will appear separately in a special issue in Algorithmica on computational biology. y Supported by an CGAT (Canadian Genome Analysis and Technology) grant. Work done while the author was at University of Waterloo ....
....for computing the nni distance on weighted phylogenies with a performance ratio of 4 log n 4, where n is the number of leaves in the phylogenies. We also observe that the nni distance is in fact identical to the linear cost subtree transfer distance on unweighted phylogenies discussed in [4, 5]. Some consequences of this observation are also discussed. 1 Introduction The evolution history of organisms is often conveniently represented as trees, called phylogenetic trees or simply phylogenies. Such a tree has uniquely labeled leaves and unlabeled internal nodes, is either unrooted or ....
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang, On distances between phylogenetic trees, in Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 427-436.
On Reconstructing Species Trees From Gene Trees In Term Of.. - Ma, Li, Zhang (7 citations) Self-citation (Li Zhang) (Correct)
....m(G i ; S) Clearly, GOST is NP complete under the duplication cost and the mutation cost. To the nni distance, the conclusion is also true. Theorem 5.1. The problem GOST is NP complete for the NNI distance. Sketch of Proof. We reduce the problem of computing nni distance between two trees( see [2] for its NPcompleteness) to GOST. Given two binary trees T 1 and T 2 with n leaves. By applying an nni operation to T 1 , we may obtain as many as 2n Gamma 2 different resulting trees. Let T 3 be such a tree, i.e. d nni (T 3 ; T 1 ) 1. We consider the following instance I of GOST: I = fT 1 ; ....
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang. On distance between phylogenetic trees. In Proc. of the 8th SODA, 427-436, 1997.
From Gene Trees to Species Trees - Ma, Li, Zhang (1998) (3 citations) Self-citation (Li Zhang) (Correct)
....i ; S) Clearly, GOST is NP hard under the duplication cost and the mutation cost. For the nni distance, the same conclusion also holds. Theorem 6.1 The decision version of GOST is NP complete for the nni distance. Proof. We reduce the problem of computing nni distance between two trees (see [3]) to GOST. Given two binary trees T 1 and T 2 with n leaves. By applying an nni operation to T 1 , there are as many as 2n Gamma 2 different resulting trees. Let T 3 be such a tree, i.e. d nni (T 3 ; T 1 ) 1. We consider the following instance I of GOST: I = fT 1 ; T 2 ; T 3 ; c 1 = 2; c 2 = ....
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, On distance between phylogenetic trees, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 427-436, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC