|
Boost Users : |
From: david v (danova_fr_at_[hidden])
Date: 2006-08-29 10:40:08
Hello,
As James pointed out the right place to start with will be suffix tree
algorithms. The only thing i don't know if this is going to be very time
consuming ???
######For Brian....
1) What's the longest string you're searching for?
For the moment is limited to 6 to 8 characters.
2) What's the smallest bit-width of any cpu on which you're running
your code?
I'm on 64 dual opteron machine
3) How familiar with string searching/matching are you?
Quite familiar but was looking for a cpp library that could handle it
instead of trying to rewrite things.
Best,
david
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net