92 search results - page 9 / 19 » Maximal repetitions in strings |
BIRD
2008
Springer
13 years 8 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
CPC
2008
13 years 6 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
BALT
2006
13 years 10 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
STACS
1992
Springer
13 years 10 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ICDAR
2009
IEEE
13 years 4 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...