Sciweavers

52 search results - page 1 / 11
» Reporting Exact and Approximate Regular Expression Matches
Sort
View
CPM
1998
Springer
132views Combinatorics» more  CPM 1998»
13 years 9 months ago
Reporting Exact and Approximate Regular Expression Matches
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
Eugene W. Myers, Paulo Oliva, Katia S. Guimar&atil...
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
13 years 10 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
PODS
2010
ACM
213views Database» more  PODS 2010»
13 years 10 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
BMCBI
2006
141views more  BMCBI 2006»
13 years 4 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...