Finding periods in Cartesian tree matching

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

doi:10.1007/978-3-030-25005-8_7

Finding periods in Cartesian tree matching

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings
Editors	Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
Publisher	Springer Verlag
Pages	70-84
Number of pages	15
ISBN (Print)	9783030250041
DOIs	https://doi.org/10.1007/978-3-030-25005-8_7
State	Published - 2019
Event	30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, Italy Duration: 23 Jul 2019 → 25 Jul 2019

Publication series

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

Conference

Conference	30th International Workshop on Combinatorial Algorithms, IWOCA 2019
Country/Territory	Italy
City	Pisa
Period	23/07/19 → 25/07/19

Bibliographical note

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.

Keywords

Cartesian tree matching
Parent-distance representation
Period

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-25005-8_7

Cite this

Bataa, M., Park, S. G., Amir, A., Landau, G. M., & Park, K. (2019). Finding periods in Cartesian tree matching. In C. J. Colbourn, R. Grossi, & N. Pisanti (Eds.), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings (pp. 70-84). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11638 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-25005-8_7

Bataa, Magsarjav ; Park, Sung Gwan ; Amir, Amihood et al. / Finding periods in Cartesian tree matching. Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. editor / Charles J. Colbourn ; Roberto Grossi ; Nadia Pisanti. Springer Verlag, 2019. pp. 70-84 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c4c6f77dab624ca09e5e92de3d995521,

title = "Finding periods in Cartesian tree matching",

abstract = "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.",

keywords = "Cartesian tree matching, Parent-distance representation, Period",

author = "Magsarjav Bataa and Park, {Sung Gwan} and Amihood Amir and Landau, {Gad M.} and Kunsoo Park",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 30th International Workshop on Combinatorial Algorithms, IWOCA 2019 ; Conference date: 23-07-2019 Through 25-07-2019",

year = "2019",

doi = "10.1007/978-3-030-25005-8_7",

language = "English",

isbn = "9783030250041",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "70--84",

editor = "Colbourn, {Charles J.} and Roberto Grossi and Nadia Pisanti",

booktitle = "Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings",

address = "Germany",

}

Bataa, M, Park, SG, Amir, A, Landau, GM & Park, K 2019, Finding periods in Cartesian tree matching. in CJ Colbourn, R Grossi & N Pisanti (eds), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11638 LNCS, Springer Verlag, pp. 70-84, 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, Pisa, Italy, 23/07/19. https://doi.org/10.1007/978-3-030-25005-8_7

Finding periods in Cartesian tree matching. / Bataa, Magsarjav; Park, Sung Gwan; Amir, Amihood et al.
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. ed. / Charles J. Colbourn; Roberto Grossi; Nadia Pisanti. Springer Verlag, 2019. p. 70-84 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11638 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finding periods in Cartesian tree matching

AU - Bataa, Magsarjav

AU - Park, Sung Gwan

AU - Amir, Amihood

AU - Landau, Gad M.

AU - Park, Kunsoo

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Cartesian tree matching

KW - Parent-distance representation

KW - Period

UR - http://www.scopus.com/inward/record.url?scp=85069664663&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-25005-8_7

DO - 10.1007/978-3-030-25005-8_7

M3 - Conference contribution

AN - SCOPUS:85069664663

SN - 9783030250041

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 70

EP - 84

BT - Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings

A2 - Colbourn, Charles J.

A2 - Grossi, Roberto

A2 - Pisanti, Nadia

PB - Springer Verlag

T2 - 30th International Workshop on Combinatorial Algorithms, IWOCA 2019

Y2 - 23 July 2019 through 25 July 2019

ER -

Bataa M, Park SG, Amir A, Landau GM, Park K. Finding periods in Cartesian tree matching. In Colbourn CJ, Grossi R, Pisanti N, editors, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Springer Verlag. 2019. p. 70-84. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-25005-8_7

Finding periods in Cartesian tree matching

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this