Pages that link to "Item:Q990818"
From MaRDI portal
The following pages link to Hardness of comparing two run-length encoded strings (Q990818):
Displayed 5 items.
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Gel'fand-\(N\)-width in probabilistic setting (Q2069451) (← links)
- Approximation of functions on the sphere on a Sobolev space with a Gaussian measure in the probabilistic case setting (Q2930117) (← links)
- R\'enyi entropy and pattern matching for run-length encoded sequences (Q4989421) (← links)