Pages that link to "Item:Q1913702"
From MaRDI portal
The following pages link to Data structures and algorithms for the string statistics problem (Q1913702):
Displaying 14 items.
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- Bridging Lossy and Lossless Compression by Motif Pattern Discovery (Q3439250) (← links)
- Periodicity and Repetitions in Parameterized Strings (Q3439251) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Non-Overlapping Indexing - Cache Obliviously (Q5140770) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
