45 search results - page 8 / 9 » Compressed Indexes for Approximate String Matching |
ACCV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
CPM
2001
Springer
15 years 1 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
DEXA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
ICAIL
2003
ACM
15 years 2 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
102
click to vote
DAGSTUHL
2006
14 years 10 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...