Affiliation:
1. Department of Computer Science Aalto University Espoo Finland
Abstract
AbstractWe present new algorithms for exact string matching of long patterns. Our algorithms read ‐grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.
Reference18 articles.
1. The exact online string matching problem
2. Lecture Notes in Computer Science;Aydogmus MA,2018
3. Bit-Parallel Search Algorithms for Long Patterns
4. FaroS ScafitiS.Pruned BNDM: extending the bit‐parallel suffix automata to large strings. In:CoenCS SalvoI eds.Proceedings of the 22nd Italian Conference on Theoretical Computer Science Bologna Italy. CEUR Workshop Proceedings. Vol3072.CEUR‐WS.org;2021:328‐340.
5. The Range Automaton: An Efficient Approach to Text-Searching