1284 search results - page 108 / 257 » Data Structures for Mergeable Trees |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
DASFAA
2003
IEEE
14 years 1 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
IPL
2010
13 years 6 months ago
2010
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
ICLP
1992
Springer
13 years 11 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...