Truncated DAWGs and their application to minimal absent word problem

DOI10.1007/978-3-030-00479-8_12zbMATH Open1517.68090OpenAlexW2891321797MaRDI QIDQ6109740FDOQ6109740

Authors: Yuta Fujishige, Takuya Takagi, Diptarama Hendrian 

Publication date: 28 July 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-00479-8_12

Recommendations

• 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
• scientific article; zbMATH DE number 2087051
• scientific article; zbMATH DE number 1929950
• Implementation of directed acyclic word graph.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Cited In (4)

• Computing DAWGs and minimal absent words in linear time for integer alphabets
• Constructing antidictionaries of long texts in output-sensitive space
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Title not available (Why is that?)

This page was built for publication: Truncated DAWGs and their application to minimal absent word problem

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