Name
Abstract | ||
|---|---|---|
This paper defines a new string matching problem by combining two paradigms: function matching and δγ-matching. The result is an approximate variant of function matching where two equal-length strings X and Y match if there exists a function that maps X to a string X′ such that X′ and Y are δγ- similar. We propose an O(nm) algorithm for finding all the matches of a pattern P1 …m in a text T1 …n. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-34109-0_37 | SPIRE |
Keywords | Field | DocType |
string x,text t1,equal-length strings x,pattern p1,function matching,approximate variant,y match,maps x,approximate function,new string | String searching algorithm,Combinatorics,Commentz-Walter algorithm,Optimal matching,Existential quantification,Computer science,Combinatorial algorithms,Approximate string matching,3-dimensional matching | Conference |
Citations | PageRank | References |
3 | 0.38 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Mendivelso | 1 | 13 | 2.81 |
| Inbok Lee | 2 | 58 | 10.49 |
| Yoan J. Pinzon | 3 | 158 | 16.81 |