Pages that link to "Item:Q1765295"
From MaRDI portal
The following pages link to Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295):
Displaying 50 items.
- Longest common extensions in trees (Q294947) (← links)
- Order-preserving indexing (Q294954) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Distinct squares in run-length encoded strings (Q606988) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Mining approximate patterns with frequent locally optimal occurrences (Q906440) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- Longest common extension (Q1678103) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Speeding up the detection of evolutive tandem repeats (Q1884977) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Fast algorithms for finding a minimum repetition representation of strings and trees (Q2446339) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Lempel-Ziv Factorization Revisited (Q3011840) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- (Q5009559) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- (Q5874500) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
