Suffix trees, DAWGs and CDAWGs for forward and backward tries

DOI10.1007/978-3-030-61792-9_16OpenAlexW3117826743MaRDI QIDQ2081617

Shunsuke Inenaga

Publication date: 13 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-61792-9_16

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets

This page was built for publication: Suffix trees, DAWGs and CDAWGs for forward and backward tries