tH__TEXT__text__TEXT  __cstring__TEXT8p8__literal8__TEXT__eh_frame__TEXTD `__DATA__data__DATA__dyld__DATA|__IMPORT  __jump_table__IMPORT # 8__LINKEDIT00D(FKr8YKa0 0 P00 4@loader_path/libmx.dylib 4@loader_path/libmex.dylib 4@loader_path/libmat.dylib 4/usr/lib/libstdc++.6.dylib 4/usr/lib/libgcc_s.1.dylib 4o/usr/lib/libSystem.B.dylibX{XoUWVS|EU [EEUUEU EfU$UE$UE$ED$ED$U$Ɖ$ED$ED$U$lj$EE0}~x}tPUB$UEԋB$~UƋB$sEE|[^_>$-EȸUDD?@u$@@@ @@EMEfWEEE1EUEEU؉EfDfDUU̅~X1ɍ9|BD9EE|6Ef(Yȉ)Љ‹E+EEE‹EXf.wwA9ME܋UF ‹E*Ef(E9uEiEU9UEȉ$}|[^_|[^_Af(ȉM뇋u4$Eȉ4$NjEԅ~SuċEEuuƋUЋE ,E,AEEЋUЃE9UuŋEԉEMt$$$,$lE|[^_dpcore [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) zR| (  . A NT\g __mh_bundle_headerdyld_stub_binding_helper__dyld_func_lookup_mexFunction_free_malloc_mexPrintf_mxCreateDoubleMatrix_700_mxGetM_mxGetN_mxGetPr