1421 search results - page 37 / 285 » Algorithms for subsequence combinatorics |
102
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
CPM
2004
Springer
15 years 3 months ago
2004
Springer
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
COCOON
2001
Springer
15 years 4 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
WSC
2004
15 years 1 months ago
2004
The paper introduces a new model for shipment date quoting with potential applications in E-commerce. First, a customer sends to the vendor a request for an item advertised at a c...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...