Hi Sebastian & Giovanni, yes, such separation to more general and more specific bioinf-related algorithms is one of possible ways how I would proceed, it should be more clear in about a month. But you're right, algorithms as general as Levenshtein distance or even LCS would be useful in String Algorithms, I'll think about it. Thanks for your response, Robert -----Original Message----- From: boost-bounces@lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of Sebastian Redl Sent: Tuesday, December 05, 2006 16:40 To: boost@lists.boost.org Subject: Re: [boost] Bioinformatics algorithms in boost? Giovanni Piero Deretta wrote:
Actually even if I do not work in bioinformatics, I would use a good LCS implementation. Also some of the distances could be useful.
Perhaps some of the algorithms, like Levenshtein distance, could be extracted and integrated into the StringAlgo library? Sebastian Redl _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost