Two Space Saving Tricks for Linear Time LCP Array Computation
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Engineering a Lightweight Suffix Array Construction AlgorithmAlgorithmica, 2004
- Compressed Compact Suffix ArraysLecture Notes in Computer Science, 2004
- Two Space Saving Tricks for Linear Time LCP Array ComputationLecture Notes in Computer Science, 2004
- Simple Linear Work Suffix Array ConstructionLecture Notes in Computer Science, 2003
- Fast Lightweight Suffix Array Construction and CheckingLecture Notes in Computer Science, 2003
- Space Efficient Linear Time Construction of Suffix ArraysLecture Notes in Computer Science, 2003
- Linear-Time Construction of Suffix ArraysLecture Notes in Computer Science, 2003
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsLecture Notes in Computer Science, 2001
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993