Rank: 1423 based on 106 downloads (last 30 days) and 5 files submitted
photo

David Cumin

E-mail

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Files Posted by David View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
27 Jul 2011 Longest Common Subsequence Gives the longest common substring between two stings. Author: David Cumin similarity string lcs... 48 8
  • 4.5
4.5 | 3 ratings
14 Jul 2009 MakeWhole Takes a triangular matrix and fills in the other half. Author: David Cumin matrix, data 4 0
05 Jul 2009 Bland Altman Plot Plots a Bland Altman plot. You can control what is and what is not plotted through 'flag'. Author: David Cumin statistics bland altm... 32 2
  • 4.0
4.0 | 1 rating
26 Jun 2009 fitMatlabCellML Allows for the parameter estimation of selected constants from a CellML file exported from COR. Author: David Cumin cellml, parameter estimation 14 0
25 Jun 2009 RunMatlabCellML Runs CellML files as exported from COR in matlab. Author: David Cumin cellml, ode model 8 0
Comments and Ratings by David View all
Updated File Comments Rating
19 Oct 2013 Longest Common Subsequence Gives the longest common substring between two stings. Author: David Cumin

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

29 Jun 2009 Longest Common Subsequence Gives the longest common substring between two stings. Author: David Cumin

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.

Cheers,
David

Comments and Ratings on David's Files View all
Updated File Comment by Comments Rating
13 Mar 2014 Bland Altman Plot Plots a Bland Altman plot. You can control what is and what is not plotted through 'flag'. Author: David Cumin Pete

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)

19 Oct 2013 Longest Common Subsequence Gives the longest common substring between two stings. Author: David Cumin Cumin, David

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

19 Oct 2013 Longest Common Subsequence Gives the longest common substring between two stings. Author: David Cumin Bagheri, Mohammad Ali

Hi. I am wondering how this method can be used for continues time series (i.e. not string series)? Thanks

22 Oct 2012 Bland Altman Plot Plots a Bland Altman plot. You can control what is and what is not plotted through 'flag'. Author: David Cumin Andy

Good! I need it.

04 Oct 2012 Longest Common Subsequence Gives the longest common substring between two stings. Author: David Cumin Hopkins, Jesse

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

Contact us