Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Kunihiko Sadakane. Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. In D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, pages 410-421, Springer, 2000. [doi]

The following publications are possibly variants of this publication:

A Space and Time Efficient Algorithm for Constructing Compressed Suffix ArraysTak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu. cocoon 2002: 401-410 [doi]

A Space and Time Efficient Algorithm for Constructing Compressed Suffix ArraysWing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu. algorithmica, 48(1):23-36, 2007. [doi]

New text indexing functionalities of the compressed suffix arraysKunihiko Sadakane. jal, 48(2):294-313, 2003. [doi]

runs on WebDSL