Mohammed,
Eamon Keogh has an elegant algorithm for converting time series into strings for evaluating and manipulating using these sorts of techniques, called sax. Have a look at http://www.cs.ucr.edu/~eamonn/SAX.htm.
Regards,
David

Bruno,
Thanks for your comments. The LCS('fbce','abcde'); gives the right answer. The code is designed to find the longest common substring of two given inputs. In this example, both 'fbce' and 'abcde' contain 'bce':
fbce -> '-bce'
'abcde' -> '-bc-e'
Hope that makes sense.

The technique is common to pattern matching techniques. I'm not sure of the limit to the function. I guess it depends on memory.

I think your calculation of the CR is off (standard deviation is usually corrected by N-1 when using the sample-population. Cf. http://www.medcalc.org/manual/blandaltman.php)

Mohammed,
Eamon Keogh has an elegant algorithm for converting time series into strings for evaluating and manipulating using these sorts of techniques, called sax. Have a look at http://www.cs.ucr.edu/~eamonn/SAX.htm.
Regards,
David

Thank you, very useful submission. I tweaked this slightly to work on cell arrays of objects, using a user-provided "equals" function handle, in hopes of implementing a tree diff utility using this algorithm, which requires the use of LCS: http://ilpubs.stanford.edu:8090/115/1/1995-46.pdf

I think your calculation of the CR is off (standard deviation is usually corrected by N-1 when using the sample-population. Cf. http://www.medcalc.org/manual/blandaltman.php)

Mohammed,
Eamon Keogh has an elegant algorithm for converting time series into strings for evaluating and manipulating using these sorts of techniques, called sax. Have a look at http://www.cs.ucr.edu/~eamonn/SAX.htm.
Regards,
David

Thank you, very useful submission. I tweaked this slightly to work on cell arrays of objects, using a user-provided "equals" function handle, in hopes of implementing a tree diff utility using this algorithm, which requires the use of LCS: http://ilpubs.stanford.edu:8090/115/1/1995-46.pdf

Comment only