Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
A very fast substring search algorithm
Communications of the ACM
A new approach to text searching
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract)
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Fast exact string matching algorithms
Information Processing Letters
Accelerating Boyer Moore searches on binary texts
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fast matching method for DNA sequences
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Fast searching in packed strings
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
String matching with lookahead
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the B ndm algorithm and a simplified version of the C ommentz-Walter algorithm. We performed also experimental comparisons with the most efficient algorithms presented in the literature. Experimental results show that the newly presented algorithm outperforms existing solutions in most cases.