Timeline for Find repeated patterns in a string via lossy compression
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 29, 2021 at 19:48 | comment | added | D.W.♦ | @dizcza, I don't know, but you can try to see if you can construct a dynamic programming algorithm using the structured approach listed here: cs.stackexchange.com/tags/dynamic-programming/info (build a set of subproblems that lets you construct an exponential-time recursive algorithm, then memoize). | |
| Dec 29, 2021 at 12:43 | comment | added | dizcza | How to modify the second step for the Levenshtein distance? | |
| Dec 29, 2021 at 7:20 | vote | accept | dizcza | ||
| Dec 28, 2021 at 20:38 | history | answered | D.W.♦ | CC BY-SA 4.0 |