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.
|Title of host publication||Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings|
|Editors||Charles J. Colbourn, Roberto Grossi, Nadia Pisanti|
|Number of pages||15|
|State||Published - 2019|
|Event||30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, Italy|
Duration: 23 Jul 2019 → 25 Jul 2019
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||30th International Workshop on Combinatorial Algorithms, IWOCA 2019|
|Period||23/07/19 → 25/07/19|
Bibliographical noteFunding Information:
Acknowledgements. M. Bataa, S.G. Park and K. Park were supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No. 2018-0-00551, Framework of Practical Algorithms for NP-hard Graph Problems). A. Amir and G.M. Landau were partially supported by the Israel Science Foundation grant 571/14, and Grant No. 2014028 from the United States-Israel Binational Science Foundation (BSF).
© 2019, Springer Nature Switzerland AG.
- Cartesian tree matching
- Parent-distance representation
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)