Inducing the LCP-Array

Details Inducing the LCP-Array Inducing the LCP-Array

2011-01-18

arxiv.org/abs/1101.3448v1

Computer Science

Data Structures and Algorithms

Scientific paper

We show how to modify the linear-time construction algorithm for suffix
arrays based on induced sorting (Nong et al., DCC'09) such that it computes the
array of longest common prefixes (LCP-array) as well. Practical tests show that
this outperforms recent LCP-array construction algorithms (Gog and Ohlebusch,
ALENEX'11).

Affiliated with

Also associated with

No associations

Rating

Inducing the LCP-Array does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inducing the LCP-Array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inducing the LCP-Array will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286957