comment on

So, just to see if I understand the task... given those four (truncated?) lines of input data, would the following be the "right" answer?

LCS for 0 :: 1 = |ATGGAGAACATCACATCA|
LCS for 0 :: 2 = |TCACATCAGGACTCCTAGGACC|
LCS for 0 :: 3 = |CATCAC|
LCS for 1 :: 2 = |ACTCCTAGGACC|
LCS for 1 :: 3 = |CATCAC|
LCS for 2 :: 3 = |CAGGA|
[download]

This doesn't keep track of the actual index offsets where the longest match actually starts in each string for each pairwise comparison, but that would be easy to add.

That's the output from the code posted in my later reply in this thread, given those four lines of sample data as input.

In reply to Re^3: Search for identical substrings by graff
in thread Search for identical substrings by bioMan

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Keep It Simple, Stupid
	PerlMonks