Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision Last revision Both sides next revision | ||
|
fischer:software [2019-12-17 11:36] |
fischer:software [2022-09-15 10:14] Johannes Fischer [Pure Github Repositories] |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| * The [[http://in4all.cs.tu-dortmund.de/login|In4All]] Project: A MOOC for an Introduction to Computer Science. | * The [[http://in4all.cs.tu-dortmund.de/login|In4All]] Project: A MOOC for an Introduction to Computer Science. | ||
| * [[http://tudocomp.org|tudocomp]] The TU DOrtmund lossless COMPression framework. | * [[http://tudocomp.org|tudocomp]] The TU DOrtmund lossless COMPression framework. | ||
| - | * [[http://tudocomp.org/arrays/index.html|QuickArrays]] Live construction of various text index data structures. | + | * [[http://tudocomp.org/arrays/index.html|QuickArrays]] Live construction of various text index data structures (part of tudocomp). |
| ===== Pure Github Repositories ===== | ===== Pure Github Repositories ===== | ||
| + | * [[https://github.com/jonas-ellert/simple-lyndon|Lyndon Array Construction]] | ||
| + | * [[https://github.com/jonas-ellert/gsaca-double-sort|Suffix Array Construction with Lyndon words]] | ||
| + | * [[https://github.com/pdinklag/random-permutation|On-the-fly Generation of Random Permutations]] | ||
| + | * [[https://github.com/herlez/lce-test|Longest Common Extensions]] | ||
| * [[https://github.com/pdinklag/stash/tree/master/include/stash/pred|Static Predecessor Data Structures]] | * [[https://github.com/pdinklag/stash/tree/master/include/stash/pred|Static Predecessor Data Structures]] | ||
| * [[https://github.com/jonas-ellert/nearest-smaller-suffixes|Nearest Smaller Suffix Computation]] | * [[https://github.com/jonas-ellert/nearest-smaller-suffixes|Nearest Smaller Suffix Computation]] | ||