Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Longest Common Subsequence Question

by Limbic~Region (Chancellor)
on Nov 20, 2007 at 00:35 UTC ( [id://651821]=note: print w/replies, xml ) Need Help??


in reply to Longest Common Subsequence Question

Anonymous Monk,
Yes, it will fail. You may have been thinking of my Challenge: Hidden Message and my follow up Longest Common Subsequence. In particular, pay attention to this which implements your suggestion but fails to find the correct answer.

Cheers - L~R

  • Comment on Re: Longest Common Subsequence Question

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://651821]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others admiring the Monastery: (3)
As of 2024-04-25 05:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found