Alphabet dependence in parameterized matching

Information Processing Letters

Volumn 49, Issue 3, 1994, Pages 111-115

  Amir, Amihood ^a   Farach, Martin ^b   Muthukrishnan, S ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b DIMACS Box 1179 Rutgers University Piscataway NJ 08855 USA ^*

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Algorithms; Analysis of algorithms; Parameterized string matching; Software maintenance; String matching

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SOFTWARE; LOGIC DESIGN;

PARAMETERIZED STRING MATCHING; PATTERN MODEL; PROGRAM FRAGMENTS; SOFTWARE MAINTENANCE; STRING MATCHING;

IMAGE PROCESSING;

EID: 0028381833     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(94)90086-8     Document Type: Article

References (8)

1. Efficient string matching
2. A theory of parameterized pattern matching: Algorithms and applications
3. A time-space tradeoff for element distinctness
4. A fast string searching algorithm
5. Time-space-optimal string matching
6. Fast Pattern Matching in Strings
7. Near-optimal time-space tradeoff for element distinctness