Topic: suffix trie and suffix array
| |
Reference
Puglisi, S.J., Smyth, W.F., Turpin, A.H.,
"A taxonomy of suffix array construction algorithms",
ACM Computing Surveys, 39, 2, pp. Article 4, 31 pages.
Google
Quotations
abstract ;;Quote: survey of suffix array construction algorithms; more space efficient than suffix trees
| 27 ;;Quote: Maniscalco & Puglisi's algorithm was fastest for suffix array construction; best three algorithms had a working memory of 5-6n bytes
|
Related Topics
Topic: suffix trie and suffix array (20 items)
|