215 search results - page 1 / 43 » On the Linear Number of Matching Substrings |
139
click to vote
JUCS
2010
15 years 3 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
111
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
246
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
The content-based publish/subscribe (pub/sub) paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applicatio...
116
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
135
Voted
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...