B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, L. Zhang  Home/Search
Context
Related
| rutgers.edu/~bhaskar/re...sodasub.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~bhaskar/resum...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) B. DasGupta X. He y T. Jiang z M. Li x J. Tromp -- L. Zhang k Abstract Different phylogenetic trees for the same group of species are often produced either by procedures that use diverse optimality criteria [18] or from different genes [12] in the study of molecular evolution. Comparing these trees to find their similarities (e.g. agreement or consensus) and dissimilarities, i.e. distance, is thus an important issue in computational molecular biology. The nearest neighbor... (Update)
Similar documents (at the sentence level):
51.0%: Computing Distances between Evolutionary Trees - DasGupta, He, Jiang, Li.. (1998) (Correct)
34.1%: On the Linear-Cost Subtree-Transfer Distance between.. - DasGupta, He, Jiang, .. (1997) (Correct)
13.0%: On Computing the Nearest Neighbor Interchange Distance - DasGupta, He (1997) (Correct)
Active bibliography (related documents): More All
2.7: On Distances between Phylogenetic Trees - DasGupta, He, Jiang, Li, Tromp.. (1997) (Correct)
1.4: Selected Topics in Computational Biology - DasGupta, Wang (1998) (Correct)
0.8: Some Notes on the Nearest Neighbour Interchange distance - Ming Li (1996) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Landscapes on Spaces of Trees - Bastert, Rockmore, Stadler, Tinhofer (2001) (Correct)
0.1: Some Approximation Results for the Maximum Agreement.. - Rodrigues, Sagot.. (Correct)
0.1: Phylogenetic k-Root and Steiner k-Root - Lin, Kearney, Jiang (Correct)
BibTeX entry: (Update)
@misc{ dasgupta-distances,
author = "B. DasGupta and X. He and T. Jiang and M. Li and J. Tromp and L. Zhang",
title = "On Distances between Phylogenetic Trees (Extended Abstract)",
url = "citeseer.ist.psu.edu/183906.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
146 The neighbor-joining method: a new method for reconstructing.. (context) - Saitou, Nei - 1987
59 Construction of phylogenetic trees (context) - Fitch, Margoliash - 1967
52 Introduction to computational biology: maps (context) - Waterman - 1995
40 Toward defining the course of evolution: minimum change for .. (context) - Fitch - 1971
40 A simulation comparison of phylogeny algorithms under equal .. (context) - Kuhner, Felsenstein - 1994
36 and hyperbolic geometry (context) - Sleator, Tarjan et al. - 1988
30 the complexity of comparing evolutionary trees - Hein, Jiang et al. - 1995
21 Minimal mutation trees of sequences (context) - Sankoff - 1975
19 A heuristic method to reconstruct the history of sequences s.. (context) - Hein - 1993
18 Comparison of labeled trees with valency three (context) - Robinson - 1971
16 Short encodings of evolving structures (context) - Sleator, Tarjan et al. - 1992
15 Reconstructing evolution of sequences subject to recombinati.. (context) - Hein - 1990
14 An iterative approach from the standpoint of the additive hy.. (context) - Moore, Goodman et al. - 1973
13 A note on some tree similarity measures (context) - Wood - 1982
11 Journal of Theoretical Biology (context) - Waterman, Smith et al. - 1978
10 The reconstruction of evolution (context) - Edwards, Cavalli-Sforza - 1964
9 personal communication (context) - Felsenstein - 1996
8 Evolutionary trees for DNA sequences: a maximum likelihood a.. (context) - Felsenstein - 1981
8 Properties of the nearest neighbor interchange metric for tr.. (context) - Day - 1983
8 Counterexamples in measuring the distance between binary tre.. (context) - Jarvis, Luedeman et al. - 1983
8 Comments on computing the similarity of binary trees (context) - Jarvis, Luedeman et al. - 1983
8 The uniquely evolved character concept and its cladistic app.. (context) - Le Quesne - 1974
7 Network models for sequence evolution (context) - von Haseler, Churchill - 1993
7 Approximating minimum-length-sequence metrics: a cautionary .. (context) - Boland, Brown et al. - 1983
7 personal email communication (context) - Hein - 1996
6 Computing the nearest neighbor interchange metric for unlabe.. (context) - Kriv'anek - 1986
6 On Measuring the nni distance between two evolutionary trees (context) - King, Warnow - 1994
5 Open Problems (context) - Khuller - 1994
3 Some notes on the nearest neighbor interchange distance (context) - Li, Tromp et al. - 1996
3 New York Inc (context) - Armstrong, Symmetry et al. - 1988
Documents on the same site (http://crab.rutgers.edu/~bhaskar/resume/publ/publ.html): More
On a Learnability Question Associated to Neural.. - DasGupta, Siegelmann, .. (1994) (Correct)
Provably Good Algorithms for Transmission Scheduling in WDM.. - Palis, Dasgupta (Correct)
Scheduling Transmissions in WDM Optical Networks - DasGupta, Palis (Correct)
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