The following pages link to (Q4547749):
Displaying 50 items.
- One-variable word equations in linear time (Q261339) (← links)
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128) (← links)
- Wee LCP (Q991794) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Lossless filter for multiple repetitions with Hamming distance (Q1018103) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- On string matching with mismatches (Q1736652) (← 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)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Quantum algorithm for learning secret strings and its experimental demonstration (Q2111665) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Approximate periodicity (Q2343134) (← links)
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)