Pages that link to "Item:Q1838329"
From MaRDI portal
The following pages link to Time-space-optimal string matching (Q1838329):
Displaying 46 items.
- Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
- Permuted scaled matching (Q294926) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- String matching with weighted errors (Q909451) (← links)
- Unbordered partial words (Q1028413) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- Alphabet dependence in parameterized matching (Q1318756) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- The zooming method: A recursive approach to time-space efficient string-matching (Q1367541) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- On maximal suffixes and constant-space linear-time versions of KMP algorithm. (Q1874422) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- String matching with simple devices (Q2380036) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- Online Detection of Repetitions with Backtracking (Q2942265) (← links)
- Real-Time Streaming String-Matching (Q3011851) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- A time-space tradeoff for language recognition (Q3316594) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- (Q5002646) (← links)
- (Q5009608) (← links)
