Efficient algorithms for two extensions of LPF table: the power of suffix arrays
Su?x arrays provide a powerful data structure to solve several questions related to the structure of all the factors of a string. We show how they can be used to compute e?ciently two new tables storing di?erent types of previous factors (past segments) of a string. The concept of a longest previous...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Springer
2010
|
| Subjects: | |
| Online Access: | http://www.springerlink.com/content/5177t4t8k4m66112 http://hdl.handle.net/20.500.11937/19459 |