Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
fischer:teaching:pg-saca [2018-04-05 13:26]
Johannes Fischer [Seminarthemen]
fischer:teaching:pg-saca [2018-04-05 14:13] (current)
Johannes Fischer [Seminarthemen]
Line 17: Line 17:
 | 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]] | | 5.  | Fischer/​Kurpicz ​   | [[https://​github.com/​y-256/​libdivsufsort|Dismantling DivSufSort]] |
 +| 4.  | Manzini/​Ferragina ​ | Engineering a lightweight suffix array construction algorithm |
 | 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 | 
 | 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 |  ​
 
Last modified: 2018-04-05 14:13 by Johannes Fischer
DokuWikiRSS-Feed