Computing longest previous factor in linear time and applications
From MaRDI portal
(Redirected from Publication:963336)
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)- Counting distinct palindromes in a word in linear time
- Speeding up the detection of tandem repeats over the edit distance
- The ``runs conjecture
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Efficient algorithms for three variants of the LPF table
- Parameterized longest previous factor
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Dictionary-symbolwise flexible parsing
- Faster online computation of the succinct longest previous factor array
- Reversing longest previous factor tables is hard
- String inference from longest-common-prefix array
- Variations of the parameterized longest previous factor
- Computing regularities in strings: a survey
- LZ77 computation based on the run-length encoded BWT
- LPF computation revisited
- Factorizing strings into repetitions
- Parameterized longest previous factor
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- The three squares lemma revisited
- Repetitions in strings: algorithms and combinatorics
- LZRR: LZ77 parsing with right reference
- Note on the greedy parsing optimality for dictionary-based text compression
- Longest previous overlapping factor array
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- scientific article; zbMATH DE number 4007744 (Why is no real title available?)
- Efficient on-line repetition detection
- Computing the longest previous factor
- Longest unbordered factor in quasilinear time
- Computing longest previous non-overlapping factors
- An Online Algorithm for Finding the Longest Previous Factors
- Almost linear time computation of maximal repetitions in run length encoded strings
- A brief history of parameterized matching problems
- Verifying and enumerating parameterized border arrays
- The ``runs theorem
- Locating maximal approximate runs in a string
- Generalized substring compression
- Lempel-Ziv Factorization Revisited
- Towards a Solution to the “Runs” Conjecture
- A prefix array for parameterized strings
- List Factoring and Relative Worst Order Analysis
- Phenomenology of coupled nonlinear oscillators
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- On the computation of longest previous non-overlapping factors
- Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
- Sublinear time Lempel-Ziv (LZ77) factorization
- Lazy Lempel-Ziv factorization algorithms
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)
