Given a pattern p of size m and text t, the problem order-preserving matching (OPPM) is to find all substrings t that satisfy one orderings defined by p. This has applications on time series analysis. However given its strict nature this model unable deal with indetermination, thus limiting application noisy series. In paper we introduce indeterminate characters alleviate limitation. We then pr...