A compact representation of nondeterministic (suffix) automata for the bit-parallel approach

Authors:
Domenico Cantone;Simone Faro;Emanuele Giaquinta
Affiliations:
Università di Catania, Dipartimento di Matematica e Informatica, Catania, Italy;Università di Catania, Dipartimento di Matematica e Informatica, Catania, Italy;Università di Catania, Dipartimento di Matematica e Informatica, Catania, Italy
Venue:
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Year:
2010

Citing 6
Cited 3

A new approach to text searching

Communications of the ACM
Text algorithms

Text algorithms
A fast string searching algorithm

Communications of the ACM
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
A Corpus for the Evaluation of Lossless Compression Algorithms

DCC '97 Proceedings of the Conference on Data Compression
Protein Is Incompressible

DCC '99 Proceedings of the Conference on Data Compression

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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel technique, suitable for bit-parallelism, for representing both the nondeterministic automaton and the nondeterministic suffix automaton of a given string in a more compact way. Our approach is based on a particular factorization of strings which on the average allows to pack in a machine word of w bits automata state configurations for strings of length greater than w. We adapted the Shift-And and BNDM algorithms using our encoding and compared them with the original algorithms. Experimental results show that the new variants are generally faster for long patterns.