Efficient algorithms for three variants of the LPF table☆
Under an Elsevier user license
open archive
Keywords
Longest previous reverse factor
Longest previous non-overlapping reverse factor
Longest previous non-overlapping factor
Longest previous factor
Palindrome
Runs
Suffix array
Text compression
Cited by (0)
- ☆
Partially supported by the CCS9150 and JP0870122 grants of the Royal Society, UK. Partially supported by the grant N206 566740 of the Polish Ministry of Higher Education and Science.
Copyright © 2011 Elsevier B.V.