Computing Distances between Evolutionary Trees

Bhaskar DasGupta (), Xin He (), Tao Jiang (), Ming Li (), John Tromp (), Lusheng Wang () and Louxin Zhang ()
Additional contact information
Bhaskar DasGupta: Rutgers University
Xin He: SUNY at Buffalo
Tao Jiang: McMaster University
Ming Li: City University of Hong Kong and University of Waterloo
John Tromp: CWI
Lusheng Wang: City University of Hong Kong
Louxin Zhang: National University of Singapore

A chapter in Handbook of Combinatorial Optimization, 1998, pp 781-822 from Springer

Abstract: Abstract Comparing objects to find their similarities or, equivalently, dissimilarities, is a fundamental issue in many fields including pattern recognition, image analysis, drug design, the study of thermodynamic costs of computing, cognitive science, etc. Various models have been introduced to measure the degree of similarity or dissimilarity in the literature. In the latter case the degree of dissimilarity is also often referred to as the distance. While some distances are straightforward to compute, e.g. the Hamming distance for binary strings, the Euclidean distance for geometric objects; some others are formulated as combinatorial optimization problems and thus pose nontrivial challenging algorithmic problems, sometimes even uncomputable, such as the universal information distance between two objects [4].

Keywords: Leaf Node; Binary Tree; Evolutionary Tree; Internal Edge; Weighted Tree (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().