An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

Richard Cole, Martin Farach, Ramesh Hariharan, Teresa Przytycka, Mikkel Thorup

69 Citations (Scopus)

Translated title of the contribution	An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Original language	English
Journal	SIAM Journal on Computing
Volume	30
Issue number	5
Pages (from-to)	1385-1404
Number of pages	20
ISSN	0097-5397
Publication status	Published - 2000
Externally published	Yes

Cite this

@article{c175a7c979e6441f93d9c66faa4f0192,

title = "An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees",

author = "Richard Cole and Martin Farach and Ramesh Hariharan and Teresa Przytycka and Mikkel Thorup",

year = "2000",

language = "English",

volume = "30",

pages = "1385--1404",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics",

number = "5",

}