1099 search results - page 93 / 220 » On the Complexity of Computing Evolutionary Trees |
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
DEXAW
2006
IEEE
15 years 4 months ago
2006
IEEE
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
CAD
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
FOCS
2008
IEEE
14 years 10 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
112
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...