2089 search results - page 3 / 418 » A New Problem in String Searching |
110
click to vote
SODA
1990
ACM
15 years 26 days ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
108
click to vote
COCOON
2010
Springer
15 years 3 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
SPIRE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
113
click to vote
WABI
2010
Springer
14 years 10 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
