Verifying candidate matches in sparse and wildcard matching

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 592-601

  Cole, Richard ^a   Hariharan, Ramesh ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; MONTE CARLO METHODS; PROBLEM SOLVING; VECTORS;

GEOMETRIC PATTERN MATCHING PROBLEM; LAS VEGAS ALGORITHM; SPARSE AND WILDCARD MATCHING; VERIFYING CANDIDATE MATCHES; WILDCARD MATCHING PROBLEM;

PATTERN MATCHING;

EID: 0036036814     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509989.509992     Document Type: Conference Paper

References (18)

1. Recognizing primes in random polynomial time
2. Pattern matching for spartial point sets
3. 3m) time.
4. 3 m) time
5. Tree pattern matching to subset matching in linear time
6. Faster tree pattern matching
7. String matching and other products
8. Almost all primes can be quickly certified
9. Pattern matching in trees
10. Deterministic superimposed coding with applications to pattern matching
11. Faster algorithms for string matching problems: Matching the convolution bound
12. Geometric matching under noise: Combinatorial bounds and algorithms
13. Efficient pattern matching with don't cares
14. Detecting false matches in string matching algorithms
15. New results and open problems related to non-standard stringology
16. A probabilistic algorithm for testing primality
17. Fast and precise computations of discrete fourier transforms using cyclotomic integers
18. On finding lowest common ancestors in trees: Simplification and parallelization