x__TEXT__text__TEXT  __stubs__TEXTZ *Z __stub_helper__TEXT T __const__TEXT  __cstring__TEXT | __unwind_info__TEXT\P\__eh_frame__TEXTP__DATA__dyld__DATA__la_symbol_ptr__DATA8H__LINKEDIT  @ ! P  ==]$ 0@rpath/libmx.dylib 0@rpath/libmex.dylib 0@rpath/libmat.dylib 84/usr/lib/libstdc++.6.dylib 8/usr/lib/libgcc_s.1.dylib 8 }/usr/lib/libSystem.B.dylib&8 ASLwAS%o%nUHAWAVAUATSHHHMЉEHu}ЅDH=0H=F0H=x0wH=0iH=(}%H]H;SIH;NHEH;HHEDHE1"HEH(HDHE1IL HEHEHMH}|Lx}udHEH?HHHHH@@@ @@HML}InHEIgHEI`IHEЃtH=0.HH[A\A]A^A_]HEHcHEH HMHHEH}HMHMHH HH!1IIG,II FII G,IIFII J4CLUCLILIL9uIHMEHEȉHEfE1E1DfDHcH}ȅH} 1ALMLUII G$A9@IIGA9/AYAE)EE)AMcBXf.vDf(ILIAIu*H}A9@DuHE9H}LHH[A\A]A^A_]%%%%%%%LLL}LyLuLqLmdpcore [D,P] = dpcore(S[,C]) dynamic programming core Calculate the best cost to every point in score cost matrix S; return it in D along with traceback indices in P. Optional C defines allowable steps and costs; default [1 1 1.0;1 0 1.0;0 1 1.0] Cost matrix must have 3 cols (i step, j step, cost factor)  44Z 4  XzRx 4  __  (08@   . ;AITnv~  dyld_stub_binding_helper__dyld_func_lookup_mexFunction_free_malloc_mexPrintf_mxCreateDoubleMatrix_700_mxGetM_mxGetN_mxGetPr