2089 search results - page 4 / 418 » A New Problem in String Searching |
59
Voted
JDA
2010
14 years 8 months ago
2010
IJFCS
2006
14 years 9 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
SPIRE
1999
Springer
15 years 1 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
125
click to vote
CPM
1998
Springer
15 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
74
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...