scientific article; zbMATH DE number 2087051

MaRDI QIDQ4737697zbMATH OpenFDO

Authors Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, S. Arikawa

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730153.htm

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1929950
• Implementation of directed acyclic word graph.
• Computing DAWGs and minimal absent words in linear time for integer alphabets
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Truncated DAWGs and their application to minimal absent word problem

Cited in

(5)

• Computing DAWGs and minimal absent words in linear time for integer alphabets
• scientific article; zbMATH DE number 1929950 (Why is no real title available?)
• On the Structure of Consistent Partitions of Substring Set of a Word
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Truncated DAWGs and their application to minimal absent word problem

This page was built for publication:

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