| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428871 | Information Processing Letters | 2007 | 5 Pages |
Abstract
We present a new and simple algorithm to reconstruct suffix links in suffix trees and suffix arrays. The algorithm is based on observations regarding suffix tree construction algorithms. With our algorithm we bring suffix arrays even closer to the ease of use and implementation of suffix trees.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
