Sciweavers

254 search results - page 17 / 51
» Multiple Approximate String Matching
Sort
View
IFIPTCS
2000
13 years 11 months ago
An Index for Two Dimensional String Matching Allowing Rotations
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 ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
HPCA
2004
IEEE
14 years 8 months ago
Creating Converged Trace Schedules Using String Matching
This paper focuses on generating efficient software pipelined schedules for in-order machines, which we call Converged Trace Schedules. For a candidate loop, we form a string of t...
Satish Narayanasamy, Yuanfang Hu, Suleyman Sair, B...
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 years 11 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
IQIS
2007
ACM
13 years 9 months ago
Accuracy of Approximate String Joins Using Grams
Approximate join is an important part of many data cleaning and integration methodologies. Various similarity measures have been proposed for accurate and efficient matching of st...
Oktie Hassanzadeh, Mohammad Sadoghi, Renée ...
FCT
2003
Springer
14 years 25 days ago
Complexity of Approximating Closest Substring Problems
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 ...
Patricia A. Evans, Andrew D. Smith