Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
Work
Year: 2000
Type: article
Abstract: We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n1.5 log n) time for trees with unbounded degrees, matching the best known time complex... more
Source: SIAM Journal on Computing
Institutions Yale University, University of Hong Kong
Cites: 26
Cited by: 12
Related to: 10
FWCI: 1.211
Citation percentile (by year/subfield): 74.49
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Life on land
Open Access status: green