Finding periods in Cartesian tree matching

Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In Cartesian tree matching, two strings match if the Cartesian trees of the strings are the same. In this paper we define full, initial, and general periods in Cartesian tree matching, and present an O(n) time algorithm for finding all full periods, an O(n log log n) time algorithm for finding all initial periods, and an O(n log n) time algorithm for finding all general periods of a string of length n.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings
EditorsCharles J. Colbourn, Roberto Grossi, Nadia Pisanti
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783030250041
StatePublished - 2019
Event30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, Italy
Duration: 23 Jul 201925 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11638 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference30th International Workshop on Combinatorial Algorithms, IWOCA 2019

Bibliographical note

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.


  • Cartesian tree matching
  • Parent-distance representation
  • Period

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Finding periods in Cartesian tree matching'. Together they form a unique fingerprint.

Cite this