|
Boost : |
From: Rene Rivera (grafikrobot_at_[hidden])
Date: 2007-05-20 17:53:31
Marco wrote:
> On Sun, 20 May 2007 21:17:58 +0200, David Abrahams
> <dave_at_[hidden]> wrote:
>
>> on Fri May 18 2007, Marco <mrcekets-AT-gmail.com> wrote:
>>
>>> I read the article pointed out by Phil Endecott:
>>> An O(NP) Sequence Comparison Algorithm
>>> where P=D/2 when M=N and D is the actual edit distance,
>>> as said in the abstract:
>> This is cool! I suggest you create a Trac ticket so it doesn't get
>> forgotten:
>>
>> http://svn.boost.org
>>
>
> I'll do it.
> This is the first time I create a ticket, do I need an account ?
An account is preferred as non-anonymous reports are much better for the
management of the issues since we have someone to respond to.
-- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk