Fast text searching for regular expressions or automaton searching on tries

DOI10.1145/235809.235810zbMath0885.68048OpenAlexW2162481186WikidataQ56431598 ScholiaQ56431598MaRDI QIDQ4371691

Gaston H. Gonnet, Ricardo A. Baeza-Yates

Publication date: 22 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/

zbMATH Keywords

algorithmssearchingPatricia tree

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (7)

Fast and compact regular expression matching ⋮ Efficient testing and matching of deterministic regular expressions ⋮ Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions ⋮ Compressing Regular Expressions’ DFA Table by Matrix Decomposition ⋮ Locally Compressed Suffix Arrays ⋮ Fast pattern matching in indexed texts ⋮ Regular expression searching on compressed text

This page was built for publication: Fast text searching for regular expressions or automaton searching on tries