Pages that link to "Item:Q963336"

The following pages link to Computing longest previous factor in linear time and applications (Q963336):

Displaying 37 items.

• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
• Counting distinct palindromes in a word in linear time (Q407601) (← links)
• The three squares lemma revisited (Q414439) (← links)
• Efficient algorithms for three variants of the LPF table (Q414447) (← links)
• Parameterized longest previous factor (Q441845) (← links)
• Dictionary-symbolwise flexible parsing (Q450551) (← links)
• Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
• A prefix array for parameterized strings (Q511148) (← links)
• The ``runs'' conjecture (Q544875) (← links)
• Verifying and enumerating parameterized border arrays (Q650937) (← links)
• LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
• Efficient on-line repetition detection (Q955034) (← links)
• Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
• Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
• Computing regularities in strings: a survey (Q1761494) (← links)
• Computing the longest previous factor (Q1761495) (← links)
• Variations of the parameterized longest previous factor (Q1932360) (← links)
• Computing longest previous non-overlapping factors (Q1944092) (← links)
• Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
• String inference from longest-common-prefix array (Q2110373) (← links)
• Factorizing strings into repetitions (Q2135631) (← links)
• A brief history of parameterized matching problems (Q2295633) (← links)
• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
• Locating maximal approximate runs in a string (Q2410363) (← links)
• Generalized substring compression (Q2437745) (← links)
• Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
• Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
• Longest previous overlapping factor array (Q2656356) (← links)
• LZRR: LZ77 parsing with right reference (Q2672241) (← links)
• Lempel-Ziv Factorization Revisited (Q3011840) (← links)
• Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
• An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
• Phenomenology of coupled nonlinear oscillators (Q4565923) (← links)
• (Q5091065) (← links)
• Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
• Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
• The “Runs” Theorem (Q5359492) (← links)