An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. / Cole, Richard; Farach, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel.
In: SIAM Journal on Computing, Vol. 30, No. 5, 2000, p. 1385-1404.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Cole, R, Farach, M, Hariharan, R, Przytycka, T & Thorup, M 2000, 'An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees', SIAM Journal on Computing, vol. 30, no. 5, pp. 1385-1404.
APA
Cole, R., Farach, M., Hariharan, R., Przytycka, T., & Thorup, M. (2000). An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM Journal on Computing, 30(5), 1385-1404.
Vancouver
Cole R, Farach M, Hariharan R, Przytycka T, Thorup M. An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM Journal on Computing. 2000;30(5):1385-1404.
Author
Bibtex
@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",
}
RIS
TY - JOUR
T1 - An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
AU - Cole, Richard
AU - Farach, Martin
AU - Hariharan, Ramesh
AU - Przytycka, Teresa
AU - Thorup, Mikkel
PY - 2000
Y1 - 2000
M3 - Journal article
VL - 30
SP - 1385
EP - 1404
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
SN - 0097-5397
IS - 5
ER -
ID: 98318521