|
Boost : |
From: David Brownell (brownell_at_[hidden])
Date: 2001-10-26 12:32:13
I'm not sure if I have the time, or maybe more accurately - the desire :) ,
to write a lengthy analysis of the problem, but I will make it available for
others to evaluate. It appears right now that the interest may not be very
high for this type of thing, but I will post it individually to all who are
interested.
Thanks,
David Brownell
-----Original Message-----
From: Vladimir Prus [mailto:ghost_at_[hidden]]
Sent: Thursday, October 25, 2001 11:48 PM
To: boost_at_[hidden]
Subject: Re: [boost] Algo. Proposal: SequenceCompare
David Brownell wrote:
> I am in the process of writing an algorithm that, when given two
> sequences of objects, will compare the differences and, if requested,
> output a set of instructions on how to convert sequence #1 to sequence
> #2.
[snip]
> The most common applications of this algorithm could be file
> comparisons or some sort of file versioning system similar to CVS or
> SourceSafe, but could even work on more complicated sequences such as
> DNA or even a seating chart.
>
> Is there any interest in this algorithm?
I'm interested. Yet, I'll be even more interested if you don't just present
some algorithm which does the task, but also present a comparison of all
possible approaches.
Regards,
Vladimir
Info: http://www.boost.org Unsubscribe:
<mailto:boost-unsubscribe_at_[hidden]>
Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk