The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

Pizza&Chili: Compressed Indexes and their Testbeds

Pizza&Chili is a site devoted to "full-text indexes which are structurally similar to Suffix Trees and Suffix Arrays, in that they support the powerful substring search operation, but are succinct in space, in that it is close to the empirical entropy of the indexed data." This structures are called compressed Suffix Trees and compressed Suffix Arrays, or in general compressed indexes.

The code is in Java and/or C. All the code is copyrighted, most of which are LGPL.

  • Download Files (local site)
  • Offical Site

    Problem Links

    Suffix Trees and Arrays (9)

    This page last modified on 2008-07-10 .