Fast Label Extraction in the CDAWG

DOI10.1007/978-3-319-67428-5_14zbMath1454.68038arXiv1707.08197OpenAlexW2963424706MaRDI QIDQ5150929

Fabio Cunial, Djamal Belazzougui

Publication date: 16 February 2021

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

Full work available at URL: https://arxiv.org/abs/1707.08197

zbMATH Keywords

suffix treeminimal absent wordsstraight-line programmatching statisticsmaximal repeatcount queryCDAWGlocate query

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (4)

On Sensitivity of Compact Directed Acyclic Word Graphs ⋮ Universal compressed text indexing ⋮ Unnamed Item ⋮ Online algorithms for constructing linear-size suffix trie

Cites Work

• Automata and forbidden words
• Linear-size suffix tries
• The level ancestor problem simplified
• Large alphabets and incompressibility
• Finding level-ancestors in trees
• On maximal repeats in strings
• Composite Repetition-Aware Data Structures
• Fully compressed suffix trees
• Algorithms on Strings, Trees and Sequences
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Label Extraction in the CDAWG