The following pages link to (Q4449231):
Displaying 50 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Efficient seed computation revisited (Q390905) (← 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)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← 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)
- A metric index for approximate string matching (Q818138) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Text indexing with errors (Q925060) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← 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)
- Real two dimensional scaled matching (Q1024780) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Approximate periodicity (Q2343134) (← links)
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- An extension of the Burrows-Wheeler transform (Q2465062) (← links)
- A new combinatorial approach to sequence comparison (Q2481558) (← links)
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering (Q2500318) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- Optimal in-place suffix sorting (Q2672235) (← links)
- LZRR: LZ77 parsing with right reference (Q2672241) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
