63 search results - page 2 / 13 » A sublinear algorithm for weakly approximating edit distance |
222
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
104
click to vote
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
101
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
114
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
125
click to vote
JCB
2002
15 years 1 months ago
2002
Arc-annotated sequences are useful in representing the structural information of RNA sequences. In general, RNA secondary and tertiary structures can be represented as a set of ne...