Computing distances between evolutionary trees

Bhaskar DasGupta; Xin He; Tao Jiang; Ming Li; John Tromp; Lusheng Wang; Louxin Zhang

doi:10.1007/978-1-4419-7997-1_52

Computing distances between evolutionary trees

Bhaskar DasGupta
, Xin He
, Tao Jiang
, Ming Li
, John Tromp
, Lusheng Wang
, Louxin Zhang

Department of Computer Science and Engineering

University of Illinois at Chicago
University of California at Riverside
University of Waterloo
Centrum voor Wiskunde en Informatica
City University of Hong Kong
National University of Singapore

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

2 Scopus citations

Abstract

In this chapter, we survey some results on some transformation-based distances for evolutionary trees. The authors will focus on the nearest-neighbor distance and a closely related distance called the subtree-transfer distance used in dealing with evolutionary histories involving events like recombinations or gene conversions; some variants of these distances will also be discussed.

Original language	English
Title of host publication	Handbook of Combinatorial Optimization
Publisher	Springer New York
Pages	747-781
Number of pages	35
Volume	2-5
ISBN (Electronic)	9781441979971
ISBN (Print)	9781441979964
DOIs	https://doi.org/10.1007/978-1-4419-7997-1_52
State	Published - Jan 1 2013

Access to Document

10.1007/978-1-4419-7997-1_52

Cite this

@inbook{d6c9e72bf91a4ab6b490862a22c1a19f,

title = "Computing distances between evolutionary trees",

abstract = "In this chapter, we survey some results on some transformation-based distances for evolutionary trees. The authors will focus on the nearest-neighbor distance and a closely related distance called the subtree-transfer distance used in dealing with evolutionary histories involving events like recombinations or gene conversions; some variants of these distances will also be discussed.",

author = "Bhaskar DasGupta and Xin He and Tao Jiang and Ming Li and John Tromp and Lusheng Wang and Louxin Zhang",

note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media New York 2013. All rights are reserved.",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-1-4419-7997-1\_52",

language = "English",

isbn = "9781441979964",

volume = "2-5",

pages = "747--781",

booktitle = "Handbook of Combinatorial Optimization",

publisher = "Springer New York",

address = "United States",

}

TY - CHAP

T1 - Computing distances between evolutionary trees

AU - DasGupta, Bhaskar

AU - He, Xin

AU - Jiang, Tao

AU - Li, Ming

AU - Tromp, John

AU - Wang, Lusheng

AU - Zhang, Louxin

PY - 2013/1/1

Y1 - 2013/1/1

N2 - In this chapter, we survey some results on some transformation-based distances for evolutionary trees. The authors will focus on the nearest-neighbor distance and a closely related distance called the subtree-transfer distance used in dealing with evolutionary histories involving events like recombinations or gene conversions; some variants of these distances will also be discussed.

AB - In this chapter, we survey some results on some transformation-based distances for evolutionary trees. The authors will focus on the nearest-neighbor distance and a closely related distance called the subtree-transfer distance used in dealing with evolutionary histories involving events like recombinations or gene conversions; some variants of these distances will also be discussed.

UR - https://www.scopus.com/pages/publications/85027450995

U2 - 10.1007/978-1-4419-7997-1_52

DO - 10.1007/978-1-4419-7997-1_52

M3 - Chapter

AN - SCOPUS:85027450995

SN - 9781441979964

VL - 2-5

SP - 747

EP - 781

BT - Handbook of Combinatorial Optimization

PB - Springer New York

ER -

Computing distances between evolutionary trees

Abstract

Access to Document

Other files and links

Fingerprint

Cite this