Faster online computation of the succinct longest previous factor array
From MaRDI portal
Publication:2106621
DOI10.1007/978-3-030-51466-2_31OpenAlexW3037189737MaRDI QIDQ2106621
Nicola Prezza, Giovanna Rosone
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_31
Cites Work
- Efficient dynamic range minimum query
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Replacing suffix trees with enhanced suffix arrays
- Computing longest previous factor in linear time and applications
- Computing the longest previous factor
- Lightweight LCP construction for very large collections of strings
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- Compressed Data Structures for Dynamic Sequences
- Fast and Practical Algorithms for Computing All the Runs in a String
- An Online Algorithm for Finding the Longest Previous Factors
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Permuted Longest-Common-Prefix Array
- A Space-Economical Suffix Tree Construction Algorithm
- A universal algorithm for sequential data compression
- From LZ77 to the run-length encoded burrows-wheeler transform, and back
- Succinct Partial Sums and Fenwick Trees
- Path Minima Queries in Dynamic Weighted Trees
- Unnamed Item
- Unnamed Item
This page was built for publication: Faster online computation of the succinct longest previous factor array
