From: Robert Goldwein (robert.goldwein_at_[hidden])
Date: 2006-12-05 14:04:25
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,
[mailto:boost-bounces_at_[hidden]] On Behalf Of Sebastian Redl
Sent: Tuesday, December 05, 2006 16:40
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?
Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk