Constructing antidictionaries of long texts in output-sensitive space

DOI10.1007/s00224-020-10018-5OpenAlexW3112981504MaRDI QIDQ2048208

Alice Héliou, Golnaz Badkobeh, Lorraine A. K. Ayad, Solon P. Pissis, Gabriele Fici

Publication date: 5 August 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-10018-5

zbMATH Keywords

data compressionoutput sensitive algorithmstring algorithmabsent wordantidictionary

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of data (68Pxx) Computer science (68-XX) Computing methodologies and applications (68Uxx)

Related Items

Internal shortest absent word queries in constant time and linear space

Uses Software

• emMAW

Cites Work

• Automata and forbidden words
• A framework for space-efficient string kernels
• Minimal absent words in a sliding window and applications to on-line pattern matching
• Alignment-free sequence comparison using absent words
• String processing and information retrieval. 25th international symposium, SPIRE 2018, Lima, Peru, October 9--11, 2018. Proceedings
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Parallel External Memory Suffix Sorting
• Algorithms on Strings, Trees and Sequences
• A Linear-Time Algorithm for Seeds Computation
• Algorithms on Strings
• On extended special factors of a word
• Truncated DAWGs and their application to minimal absent word problem
• Unnamed Item