Subject: Re: [boost] [gsoc] Proposal for Generic Trie, Radix Tree, and Suffix Array Data Structures
From: Jose (jmalv04_at_[hidden])
Date: 2009-05-08 04:25:42
I think you should build on what was done in last year's GSoC by Chintan Rao.
I recall he did a lot of work but the final status was not published.
On Fri, May 1, 2009 at 10:30 PM, Roman Klyujkov <uxnuxn_at_[hidden]> wrote:
> Chris Wagner-11 wrote:
>> I am interested in writing a library consisting of generic implementations
>> several common data structures and algorithms primarily useful in
>> text-processing. I believe these would be useful additions to Boost and
>> like to work on them for GSoC. Before I submit my proposal, I would like
>> hear whether or not the community agrees that this is a good idea, and I
>> appreciate any suggestions or comments offered.
>> My plan is to implement a trie / prefix tree data structure, STL
>> classes implemented over the trie, a radix tree, a suffix tree implemented
>> over the radix tree, and a suffix array. These would be instantiable over
>> arbitrary sequence types, and use iterator traits to determine the
> Look at http://code.google.com/p/patl/ PATL . I think that is very similar
> to what you want to do.
> View this message in context: http://www.nabble.com/-gsoc--Proposal-for-Generic-Trie%2C-Radix-Tree%2C-and-Suffix-Array-Data-%09Structures-tp22817687p23339280.html
> Sent from the Boost - Dev mailing list archive at Nabble.com.
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk