A fast string searching algorithm
Communications of the ACM
Subsequence references: first-class values for substrings
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new approach to text searching
Communications of the ACM
Predicting string search speed
Journal of Experimental Algorithmics (JEA)
Block addressing indices for approximate text retrieval
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new string-pattern matching algorithm using partitioning and hashing efficiently
Journal of Experimental Algorithmics (JEA)
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Research on a faster algorithm for pattern matching
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Communications of the ACM
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
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Efficient Experimental String Matching by Weak Factor Recognition
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
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 Pattern Matching by Text Compression
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The abstraction and instantiation of string-matching programs
The essence of computation
A unifying look at the Apostolico--Giancarlo string-matching algorithm
Journal of Discrete Algorithms
Occurrence and substring heuristics for δ-matching
Fundamenta Informaticae - Special issue on computing patterns in strings
Ladderlike stepping and interval jumping searching algorithms for DNA sequences
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles
Software—Practice & Experience
Mutable strings in Java: design, implementation and lightweight text-search algorithms
Science of Computer Programming - Special issue on principles and practice of programming in java (PPPJ 2003)
q-Gram Matching Using Tree Models
IEEE Transactions on Knowledge and Data Engineering
Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
Theoretical Computer Science
The wide window string matching algorithm
Theoretical Computer Science
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
Fast pattern-matching on indeterminate strings
Journal of Discrete Algorithms
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
An aggressive algorithm for multiple string matching
Information Processing Letters
Simple Random Access Compression
Fundamenta Informaticae
Efficient Exact Pattern-Matching in Proteomic Sequences
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
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
Average-optimal string matching
Journal of Discrete Algorithms
Improving practical exact string matching
Information Processing Letters
Fast and Flexible Compression for Web Search Engines
Electronic Notes in Theoretical Computer Science (ENTCS)
Bernoulli's principle of insufficient reason and conservation of information in computer search
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Analyze and improvement of BM algorithm
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Fast-search: a new efficient variant of the Boyer-Moore string matching algorithm
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Software maintenance by multi-patterns parameterized string matching with q-gram
ACM SIGSOFT Software Engineering Notes
Simple compression code supporting random access and fast string matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
On string matching in chunked texts
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
RSMA matching algorithm for searching biological sequences
IIT'09 Proceedings of the 6th international conference on Innovations in information technology
A real-time rule-matching algorithm for the network security audit system
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
Science of Computer Programming
Improving Boyer-Moore-Horspool using machine-words for comparison
Proceedings of the 48th Annual Southeast Regional Conference
Efficient algorithm for detecting parameterized multiple clones in a large software system
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
A simple fast hybrid pattern-matching algorithm
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A taxonomy of some right-to-left string-matching algorithms
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
A fast string search algorithm for deep packet classification
Computer Communications
Plagiarism detection in software using efficient string matching
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Simple Random Access Compression
Fundamenta Informaticae
Occurrence and Substring Heuristics for δ-Matching
Fundamenta Informaticae - Computing Patterns in Strings
Fast matching method for DNA sequences
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A simple pattern matching algorithm for weighted sequences
Proceedings of the 2012 ACM Research in Applied Computation Symposium
String matching with lookahead
Discrete Applied Mathematics
| Hi-index | 48.25 |
This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: (1) a “Quick Search” algorithm; (2) a “Maximal Shift” and (3) an “Optimal Mismatch” algorithm.