[Tutor] Algorithm for sequence matching

[Walter Prins]

Hi Ankur,

On 2 July 2011 21:30, ANKUR AGGARWAL <coolankur2006 at gmail.com> wrote:

> Hey
> I am looking for an algo for the largest sequence search in the two list.
>
> Example : list a accepts some say 'm' numbers. list b accept says 'n'
> numbers. I want to look for the largest same sequence between the two list
> and then display it. I tried out but failed to do so.
> Say A=[11,23,45,21,63,56,78,32]
> B=[56,78,11,23,45,21,111,234,56543]
>
> There are two  similar sequence matching over here [11,23] and
> [11,23,45,21] i want to display second sequence because its larger in
> number. Plz help
>
>
OK, so what if A = [1,4,2,7,4,6] and B = [4,9,10,11,12,14,17,4]?  Would you
consider [4,4] a valid answer to your question?  It is a common subsequence,
albeit not of concescutive elements?

Walter
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/tutor/attachments/20110702/37a9c420/attachment.html>