On representations of ternary order relations in numeric strings

DOI10.1007/S11786-016-0282-0zbMath1369.68364OpenAlexW2583238659MaRDI QIDQ2363988

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

Publication date: 17 July 2017

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-016-0282-0

zbMATH Keywords

string matchingternary relationorder-preserving matchingnumeric string

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (7)

Order-preserving pattern matching with scaling ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Fast algorithms for single and multiple pattern Cartesian tree matching ⋮ Unnamed Item ⋮ A holistic approach to the composition of ternary relations ⋮ Fast Cartesian tree matching ⋮ Cartesian Tree Matching and Indexing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Order-preserving indexing
• A linear time algorithm for consecutive permutation pattern matching
• A filtration method for order-preserving matching
• On-line construction of suffix trees
• The number of weak orderings of a finite set
• Order-preserving matching
• Fast Order-Preserving Pattern Matching
• Preferential Arrangements
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Order-Preserving Pattern Matching with k Mismatches
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS

This page was built for publication: On representations of ternary order relations in numeric strings