Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Fast and precise computations of discrete Fourier transforms using cyclotomic integers
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tree pattern matching and subset matching in randomized O(nlog3m) time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Efficient pattern-matching with don't cares
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Detecting False Matches in String Matching Algorithms
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Pattern Matching for Spatial Point Sets
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Computer Science in Perspective
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Transposition invariant string matching
Journal of Algorithms
Simple deterministic wildcard matching
Information Processing Letters
Finding submasses in weighted strings with Fast Fourier Transform
Discrete Applied Mathematics
Necklaces, convolutions, and X + Y
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Theoretical Computer Science
Fast Approximate Point Set Matching for Information Retrieval
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A Black Box for Online Approximate Pattern Matching
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time
Theoretical Computer Science
Approximated Pattern Matching with the L1 , L2 and L∞ Metrics
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Matching with don't-cares and a small number of mismatches
Information Processing Letters
From coding theory to efficient pattern matching
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Faster pattern matching with character classes using prime number encoding
Journal of Computer and System Sciences
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Set Intersection and Sequence Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Approximate string matching with address bit errors
Theoretical Computer Science
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences
A Comparative Study of Pattern Matching Algorithms on Sequences
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Transposition invariant string matching
Journal of Algorithms
On minimizing pattern splitting in multi-track string matching
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A filtering algorithm for k-mismatch with don't cares
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Indexing a dictionary for subset matching queries
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
String matching with up to k swaps and mismatches
Information and Computation
Information Processing Letters
A filtering algorithm for k-mismatch with don't cares
Information Processing Letters
Finding Patterns In Given Intervals
Fundamenta Informaticae
Pattern matching with wildcards using words of shorter length
Information Processing Letters
A black box for online approximate pattern matching
Information and Computation
Periodicity algorithms for partial words
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Approximate matching in weighted sequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Finding patterns with variable length gaps or don’t cares
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
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
String rearrangement metrics: a survey
Algorithms and Applications
Indexing a dictionary for subset matching queries
Algorithms and Applications
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Self-normalised distance with don't cares
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Deterministic length reduction: fast convolution in sparse data and applications
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Optimal offline extraction of irredundant motif bases
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Faster variance computation for patterns with gaps
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Algorithms for path-constrained sequence alignment
Journal of Discrete Algorithms
Hi-index | 0.00 |
(MATH) This paper obtains the following results on pattern matching problems in which the text has length n and the pattern has length mAn O(nlog m) time deterministic algorithm for the String Matching with Wildcards problems, even when the alphabet is large.An O(klog2 m) time Las Vegas algorithm for the Sparse String Matching with Wildcards problem, where k«n is the number of non-zeros in the text. We also give Las Vegas algorithms for the higher dimensional version of this problem.As an application of the above, an O(nlog2 m) time Las Vegas algorithm for the Subset Matching and Tree Pattern Matching problems, and a Las Vegas algorithm for the Geometric Pattern Matching problem.Finally, an O(nlog2 m) time deterministic algorithm for Subset Matching and Tree Pattern Matching..The crucial new idea underlying the first three results above is that of confirming matches by convolving vectors obtained by coding characters in the alphabet with non-boolean (i.e., rational or even complex) entries; in contrast, almost all previous pattern matching algorithms consider only boolean codes for the alphabet. The crucial new idea underlying the fourth result is a simpler method of shifting characters which ensures that each character occurs as a singleton in some shift.