178 search results - page 16 / 36 » Fast Algorithms for Top-k Approximate String Matching |
238
click to vote
FCCM
2011
IEEE
14 years 7 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
153
click to vote
IFIPTCS
2000
15 years 7 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
157
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
112
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 ...
152
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...