On Representations of Ternary Order Relations in Numeric Strings

Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


Order-preserving matching is a string matching problem of two numeric strings where the relative orders of consecutive substrings are matched instead of the characters themselves. The order relation between two characters is a ternary relation (>, <, =) rather than a binary relation (>, <), but it was not sufficiently studied in previous works [Cho et al. (Fast order-preserving pattern matching, 2013), Kim et al. (Theor Comput Sci 525:68—79, 2014), Kubica et al. (Inform Process Lett 113:430–433, 2013)]. In this paper, we extend the representations of order relations by Kim et al. (Theor Comput Sci 525:68—79, 2014) to ternary order relations, and prove the equivalence of those representations. With our extensions, the time complexities of order-preserving matching in binary order relations can be achieved in ternary order relations as well.

Original languageEnglish
Pages (from-to)127-136
Number of pages10
JournalMathematics in Computer Science
Issue number2
StatePublished - 1 Jun 2017

Bibliographical note

Publisher Copyright:
© 2017, Springer International Publishing.


  • Numeric string
  • Order-preserving matching
  • String matching
  • Ternary relation


Dive into the research topics of 'On Representations of Ternary Order Relations in Numeric Strings'. Together they form a unique fingerprint.

Cite this