Computing longest previous factor in linear time and applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- A universal algorithm for sequential data compression
- Algorithms on Strings
- Constructing suffix arrays in linear time
- Detecting leftmost maximal periodicities
- Fast and Practical Algorithms for Computing All the Runs in a String
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Linear-time computation of local periods
- On the Complexity of Finite Sequences
- Replacing suffix trees with enhanced suffix arrays
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Transducers and repetitions
Cited in
(47)- The ``runs conjecture
- Longest unbordered factor in quasilinear time
- An Online Algorithm for Finding the Longest Previous Factors
- scientific article; zbMATH DE number 4007744 (Why is no real title available?)
- Generalized substring compression
- Computing regularities in strings: a survey
- Variations of the parameterized longest previous factor
- The ``runs theorem
- Speeding up the detection of tandem repeats over the edit distance
- Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
- Reversing longest previous factor tables is hard
- Sublinear time Lempel-Ziv (LZ77) factorization
- Counting distinct palindromes in a word in linear time
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Computing longest previous non-overlapping factors
- Phenomenology of coupled nonlinear oscillators
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Factorizing strings into repetitions
- List Factoring and Relative Worst Order Analysis
- Parameterized longest previous factor
- A brief history of parameterized matching problems
- String inference from longest-common-prefix array
- The three squares lemma revisited
- Efficient algorithms for three variants of the LPF table
- Computing the longest previous factor
- Lempel-Ziv Factorization Revisited
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- On the computation of longest previous non-overlapping factors
- Longest previous overlapping factor array
- Lazy Lempel-Ziv factorization algorithms
- LZ77 computation based on the run-length encoded BWT
- LZRR: LZ77 parsing with right reference
- Efficient on-line repetition detection
- Parameterized longest previous factor
- Faster online computation of the succinct longest previous factor array
- Dictionary-symbolwise flexible parsing
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Verifying and enumerating parameterized border arrays
- A prefix array for parameterized strings
- Towards a Solution to the “Runs” Conjecture
- Note on the greedy parsing optimality for dictionary-based text compression
- Almost linear time computation of maximal repetitions in run length encoded strings
- Locating maximal approximate runs in a string
- LPF computation revisited
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Repetitions in strings: algorithms and combinatorics
This page was built for publication: Computing longest previous factor in linear time and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963336)
