Show Student Project Proposal for Generic Trie, Radix Tree, and Suffix Array Data Structures for Boost C++ Libraries

• Google Open Source Programs
  • User (self)
    • Sign In
  • Programs
    • GSoC 2009
      • Home
      • Frequently Asked Questions
      • Admin & Mentor Participant Agreement
      • Press Guidelines
      • Student Participant Agreement
      • Student Info
      • Testing Guide
      • Timeline
      • Program Terms of Service
      • User's Guide
      • List participating Organizations
      • Apply to become a Mentor
      • List all student projects

Release 0-5-20091121

Student Name:	Chris Wagner
Mentor Name:	Thorsten Ottosen
Title:	Proposal for Generic Trie, Radix Tree, and Suffix Array Data Structures
Abstract:	I propose to develop a Boost C++ library consisting of generic implementations of common data structures and algorithms useful in text-processing domains. This library will include prefix trees (tries), suffix trees and arrays, and radix trees that can be constructed over “sequenceable” key types. Where appropriate, the library will include adaptors for set- and map-like containers.