You can find documentation for Aho-Corasick on GitHub in 'doc' folder, aho_corasick.qbk . Algorithm is very useful for fast search patterns in string. Or you want to read more information about this, you can read e.g. Wiki. About suffix automata and suffix array. I think, that Wiki links will be useful: https://en.wikipedia.org/wiki/Suffix_automaton https://en.wikipedia.org/wiki/Suffix_array -- Best regards, Alexander Zaitsev 29.08.2016, 00:03, "Rob Stewart" :

On August 28, 2016 10:54:30 AM EDT, "Зайцев Александр" wrote:

...

 I implemented Aho-Corasick to Boost.Algorithm. It's very useful  algorithm, but

What is it? Why is it useful? Is there documentation?

...

 i think that there are more useful algorithms, like  suffix automata and suffix array. They can solve a lot of specific task on sequences of values:  searching subsequences, count number of different subsequence, etc.

 Can i start work on it?

You can work on what you like and then submit a pull request. If you don't supply tests and documentation, chances aren't good anything will come of your work.

If you're asking about the likelihood of such algorithms being accepted, providing information on them would be wise.

-- Rob

(Sent from my portable computation device.)

_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

--  С уважением, Зайцев Александр.