δ γ --- Parameterized Matching

Authors:
Inbok Lee;Juan Mendivelso;Yoan J. Pinzón
Affiliations:
School of Electronic, Telecommunication, and Computer Engineering, Hankuk Aviation University, Republic of Korea;Department of System Engineering and Industrial Engineering Research Group on Algorithms and Combinatorics (ALGOS-UN), National University of Colombia, Colombia;Department of System Engineering and Industrial Engineering Research Group on Algorithms and Combinatorics (ALGOS-UN), National University of Colombia, Colombia
Venue:
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Year:
2008

Citing 35
Cited 1

Introducing efficient parallelism into approximate string matching and a new serial algorithm

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Color indexing

International Journal of Computer Vision
A theory of parameterized pattern matching: algorithms and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Alphabet dependence in parameterized matching

Information Processing Letters
Clique partitions, graph compression and speeding-up algorithms

Journal of Computer and System Sciences
Multiple matching of parameterized patterns

Theoretical Computer Science
Parameterized pattern matching: algorithms and applications

Journal of Computer and System Sciences
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance

SIAM Journal on Computing
Pattern matching algorithms

Pattern matching algorithms
Parameterized pattern matching by Boyer-Moore-type algorithms

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Parameterized diff

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster suffix tree construction with missing suffix links

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A Decomposition Theorem for Maximum Weight Bipartite Matchings

SIAM Journal on Computing
On special families of morphisms related to δ-matching and don't care symbols

Information Processing Letters
Three Heuristics for delta-Matching: delta-BM Algorithms

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Faster algorithms for the construction of parameterized suffix trees

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Occurrence and substring heuristics for δ-matching

Fundamenta Informaticae - Special issue on computing patterns in strings
Parameterized matching with mismatches

Journal of Discrete Algorithms
Efficient parameterized string matching

Information Processing Letters
Generalized function matching

Journal of Discrete Algorithms
Approximate parameterized matching

ACM Transactions on Algorithms (TALG)
Parameterized pattern queries

Data & Knowledge Engineering
Approximate matching in the L∞ metric

Information Processing Letters
L1 pattern matching lower bound

Information Processing Letters
Approximating general metric distances between a pattern and a text

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Compacting music signatures for efficient music retrieval

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Periodicity and repetitions in parameterized strings

Discrete Applied Mathematics
Function matching: algorithms, applications, and a lower bound

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Efficient computations of l1and l∞rearrangement distances

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Sublinear algorithms for parameterized matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Faster algorithms for δ,γ-matching and related problems

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Approximate matching in the L1 metric

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
An efficient algorithm for δ-approximate matching with α-bounded gaps in musical sequences

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Algorithms on extended (δ, γ)-matching

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Algorithms for computing the longest parameterized common subsequence

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Approximate function matching under δ- and γ- distances

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper defines a new pattern matching problem by combiningtwo paradigms: Δ γ ---matching andparameterized matching. The solution is essentially obtained by acombination of bitparallel techniques and a reduction to a graphmatching problem. The time complexity of the algorithm isO (nm ), assuming text size n , patternsize m and a constant size alphabet.