Fast algorithms for approximately counting mismatches

Information Processing Letters

Volumn 48, Issue 2, 1993, Pages 53-60

  Karloff, Howard ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Approximation algorithms; Pattern matching; Randomized algorithms

Indexed keywords

APPROXIMATION THEORY; PATTERN RECOGNITION; RANDOM NUMBER GENERATION;

DETERMINISTIC ALGORITHMS; FAST ALGORITHMS;

ALGORITHMS;

EID: 0027912419     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(93)90177-B     Document Type: Article

References (11)

1. Generalized string matching
2. Simple constructions of almost k-wise independent random variables
3. Simple constructions of almost k-wise independent random variables
4. Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm
5. String matching and other products
6. Small-bias probability spaces: Efficient constructions and applications