activity
19992014
most citedLinear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

49 citations · 74 across the 40 of their papers we have counts for

collaborators
Showing cs.CVShow all

1 paper · 1 filter

cs.CV2001

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings

Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung +1

A widely used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure is onl…