Combinatorial Pattern Matching

DOI10.1007/B98377zbMath1103.68573MaRDI QIDQ5315324

Roberto Grossi, Maxime Crochemore, Filippo Mignosi, Chiara Epifanio

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

indextext compressionsuffix treefactor and suffix automataautomata and formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (2)

Linear-size suffix tries ⋮ Dynamic construction of an antidictionary with linear complexity

This page was built for publication: Combinatorial Pattern Matching