Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re: Longest Common Subsequence

by diotalevi (Canon)
on May 11, 2006 at 22:58 UTC ( [id://548863]=note: print w/replies, xml ) Need Help??


in reply to Longest Common Subsequence

Allows chars to be absent from some strings

You're allowing a kind of error? How many errors are allowed?

⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊

Replies are listed 'Best First'.
Re^2: Longest Common Subsequence
by Limbic~Region (Chancellor) on May 11, 2006 at 23:22 UTC
    diotalevi,
    I hate it when things seem clear in my head and then someone shows how painfully obvious that it wasn't clear.
    HOUSEBOAT COMPUTER DOUBT
    The letter D does not appear in all strings. In my challenge, I took advantage of the fact that every string contained the exact same 36 characters to take some shortcuts. All I meant by a general solution is one that doesn't have restrictions on the presence of every character in any one string appearing in every other string.

    Obviously any character that isn't present in all strings can't be part of the LCS but there is no limit as to how many can be missing.

    Cheers - L~R

Log In?
Username:
Password:

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

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

    No recent polls found