From nondeterministic suffix automaton to lazy suffix tree

DOI10.1007/978-3-642-12476-1_8zbMATH Open1284.68696OpenAlexW1885352838MaRDI QIDQ3558263FDOQ3558263

Authors: Kimmo Fredriksson 

Publication date: 4 May 2010

Published in: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_8

Recommendations

• Fast and flexible string matching by combining bit-parallelism and suffix automata
• On-line construction of suffix trees
• Run-Length Encoded Nondeterministic KMP and Suffix Automata
• A fast suffix automata based algorithm for exact online string matching
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

This page was built for publication: From nondeterministic suffix automaton to lazy suffix tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558263)