26 search results - page 3 / 6 » Improved Approximate Pattern Matching on Hypertext |
CPM
1998
Springer
13 years 11 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...
PR
2002
13 years 7 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
ISPAN
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
SIBGRAPI
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
FPL
2005
Springer
14 years 27 days ago
2005
Springer
String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...