RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
New and faster filters for multiple approximate string matching
Random Structures & Algorithms
Regular biosequence pattern matching with cellular automata
Information Sciences—Applications: An International Journal
Faster String Matching with Super-Alphabets
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Fast Regular Expression Search
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms
Fundamenta Informaticae - Special issue on computing patterns in strings
Transposition invariant pattern matching for multi-track strings
Nordic Journal of Computing
Clustering and indexing of experience sequences for popularity-driven recommendations
Proceedings of the 3rd ACM workshop on Continuous archival and retrival of personal experences
A general compression algorithm that supports fast searching
Information Processing Letters
On-line Approximate String Matching in Natural Language
Fundamenta Informaticae
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
Fast pattern-matching on indeterminate strings
Journal of Discrete Algorithms
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
International Journal of Bioinformatics Research and Applications
Accelerating Boyer-Moore searches on binary texts
Theoretical Computer Science
Bit-(parallelism)2: getting to the next level of parallelism
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Worst case efficient single and multiple string matching in the RAM model
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
A new approach to determinisation using bit-parallelism
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms
A multiple sliding windows approach to speed up string matching algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Constant-Time word-size string matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On-line Approximate String Matching in Natural Language
Fundamenta Informaticae
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Fundamenta Informaticae - Computing Patterns in Strings
A fast suffix automata based algorithm for exact online string matching
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Fast multiple string matching using streaming SIMD extensions technology
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
The exact online string matching problem: A review of the most recent results
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |