I am working on a new string matching algorithm. I am comparing to Boyer-Moore algorithm and some other algorithms mentioned in the "handbook of exact string-matching algorithms" by Christian Charras and Thierry Lecroq, I wonder if there are more efficient algorithms to compare my work with?
It depends on a couple of side-effects. As i do not know the book you mentioned i can hardly refer to the points stated within the respective reference.
But generally the question is whether you can make some assumptions about the alphabet of the text to investigate, preprocessing of the text to be searched for, and the pattern to be search for.
As you surely know the stuff is a little too complex to be explain here in detail. But there is an excellent book highlighting the different aspects of pattern/string matching algorithms. Maybe it can help you:
Dan Gusfield: Algorithms on strings, trees and sequences - Computer science and computational biology. Cambridge University Press. 12th printing 2009. ISBN 978-0-521-58519-4 (Hardback).
I am sure you will find an edition of this book in your next computer-science library. The first three chapters deal with such 'Exact Matching Algorithms' and then continues with seminumerical approaches, etc, and finally leads to the 'holy grail': multiple searches in genetic databases and mapping, sequences and superstrings.
Hope it helps a bit ;-)
Jan
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Algorithms