Computing the LCP array of a labeled graph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- scientific article; zbMATH DE number 7788491 (Why is no real title available?)
- A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
- A dynamic stabbing-max data structure with sub-logarithmic query time
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics
- Co-lexicographically ordering automata and regular languages. I
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Faster prefix-sorting algorithms for deterministic finite automata
- Longest common prefix arrays for succinct \(k\)-spectra
- Prefix sorting DFAs: a recursive algorithm
- Regular Languages meet Prefix Sorting
- Replacing suffix trees with enhanced suffix arrays
- Sorting finite automata via partition refinement
- Space-efficient construction of compressed suffix trees
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Suffix Arrays: A New Method for On-Line String Searches
- Wheeler graphs: a framework for BWT-based data structures
Cited in
(3)
This page was built for publication: Computing the LCP array of a labeled graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891100)
