Differences
This shows you the differences between two versions of the page.
|
fischer:teaching:pg-saca [2018-04-05 11:20] |
fischer:teaching:pg-saca [2018-04-05 13:26] |
||
|---|---|---|---|
| Line 16: | Line 16: | ||
| | 7. | Nong | Practical linear-time O(1)-workspace suffix sorting for constant alphabets | | | 7. | Nong | Practical linear-time O(1)-workspace suffix sorting for constant alphabets | | ||
| | 12. | Goto | Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets | | | 12. | Goto | Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets | | ||
| + | | 5. | Fischer/Kurpicz | [[https://github.com/y-256/libdivsufsort|Dismantling DivSufSort]] | | ||
| | 1. | Larsson/Sadakane | Faster suffix sorting | | | 1. | Larsson/Sadakane | Faster suffix sorting | | ||
| | 2. | Schürmann/Stoye | An incomplex algorithm for fast suffix array construction | | | 2. | Schürmann/Stoye | An incomplex algorithm for fast suffix array construction | | ||
| | 3. | Baier | Linear-time suffix sorting - A new approach for suffix array construction | | | 3. | Baier | Linear-time suffix sorting - A new approach for suffix array construction | | ||
| | 4. | Manzini/Ferragina | Engineering a lightweight suffix array construction algorithm | | | 4. | Manzini/Ferragina | Engineering a lightweight suffix array construction algorithm | | ||
| - | | 5. | Fischer/Kurpicz | [[https://github.com/y-256/libdivsufsort|Dismantling DivSufSort]] | | ||
| | 8. | Maniscalco/Puglisi | An efficient, versatile approach to suffix sorting | | | 8. | Maniscalco/Puglisi | An efficient, versatile approach to suffix sorting | | ||
| | 9. | Kärkkäinen/Sanders | Simple linear work suffix array construction | | | 9. | Kärkkäinen/Sanders | Simple linear work suffix array construction | | ||