Chapter

Combinatorial Pattern Matching

Volume 2089 of the series Lecture Notes in Computer Science pp 181-192

Date:

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

  • Toru KasaiAffiliated withDepartment of Informatics, Kyushu University
  • , Gunho LeeAffiliated withSchool of Computer Science and Engineering, Seoul National University
  • , Hiroki ArimuraAffiliated withDepartment of Informatics, Kyushu UniversityPRESTO, Japan Science and Technology Corporation
  • , Setsuo ArikawaAffiliated withDepartment of Informatics, Kyushu University
  • , Kunsoo ParkAffiliated withSchool of Computer Science and Engineering, Seoul National University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a linear-time algorithm to compute the longest common prefix information in suffix arrays. As two applications of our algorithm, we show that our algorithm is crucial to the effective use of block-sorting compression, and we present a linear-time algorithm to sim- ulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information.