|
Attention:
Due to technical maintenance some tools might be unavailable. See maintenance information. 
|
|
|
|
|
|
bpr - Welcome
Bpr is an implementation of the 'bucket-pointer refinement'
construction algorithm for suffix arrays. Version 0.9.0 of the
algorithm is described in the following papers:
Users of bpr at BiBiServ are requested to cite:
An Incomplex Algorithm for Fast Suffix Array Construction
Klaus-Bernd Schürmann, Jens Stoye
Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO), pages 77-85, 2005
An Incomplex Algorithm for Fast Suffix Array Construction
Klaus-Bernd Schürmann and Jens Stoye
Software: Practice and Experience, 37(3):309-329, 2007
An Incomplex Algorithm for Fast Suffix Array Construction
Klaus-Bernd Schürmann, Jens Stoye
Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO), pages 77-85, 2005
An Incomplex Algorithm for Fast Suffix Array Construction
Klaus-Bernd Schürmann and Jens Stoye
Software: Practice and Experience, 37(3):309-329, 2007
 |
 |
 |
 |
 |
|
|
|