New suffix array algorithms - linear but not fast?
In 2003 three (-)(n)-time algorithms were proposed for the construction of a suffix array of a string x = x[1..n] on an indexed alphabet, all of them inspired by the methodology of Farach's (-)(n)- time suffix tree construction algorithm. In the same year a (-)(m)-time algorithm was described f...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Australian Computer Society
2004
|
| Online Access: | http://hdl.handle.net/20.500.11937/36803 |