Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Reconstructing parameterized strings from parameterized suffix and LCP arrays

Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus and Dina Sokol
Theoretical Computer Science 981 114230 (2024)
https://doi.org/10.1016/j.tcs.2023.114230

WALCOM: Algorithms and Computation

Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara
Lecture Notes in Computer Science, WALCOM: Algorithms and Computation 13973 115 (2023)
https://doi.org/10.1007/978-3-031-27051-2_11

String Processing and Information Retrieval

Amihood Amir, Concettina Guerra, Eitan Kondratovsky, et al.
Lecture Notes in Computer Science, String Processing and Information Retrieval 13617 55 (2022)
https://doi.org/10.1007/978-3-031-20643-6_5

Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info

Kitti Gelle and Szabolcs Iván
International Journal of Foundations of Computer Science 30 (06n07) 1029 (2019)
https://doi.org/10.1142/S0129054119400276

Handbook of Enumerative Combinatorics

Dominique Perrin and Antonio Restivo
Discrete Mathematics and Its Applications, Handbook of Enumerative Combinatorics 485 (2015)
https://doi.org/10.1201/b18255-11

Inferring strings from suffix trees and links on a binary alphabet

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Discrete Applied Mathematics 163 316 (2014)
https://doi.org/10.1016/j.dam.2013.02.033

Mathematical Foundations of Computer Science 2014

Yuto Nakashima, Takashi Okabe, Tomohiro I, et al.
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2014 8635 565 (2014)
https://doi.org/10.1007/978-3-662-44465-8_48

Suffix array and Lyndon factorization of a text

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone and Marinella Sciortino
Journal of Discrete Algorithms 28 2 (2014)
https://doi.org/10.1016/j.jda.2014.06.001

Developments in Language Theory

Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone and Marinella Sciortino
Lecture Notes in Computer Science, Developments in Language Theory 7907 131 (2013)
https://doi.org/10.1007/978-3-642-38771-5_13

Computer Science – Theory and Applications

Konstantin M. Likhomanov and Arseny M. Shur
Lecture Notes in Computer Science, Computer Science – Theory and Applications 6651 385 (2011)
https://doi.org/10.1007/978-3-642-20712-9_30

Verifying and enumerating parameterized border arrays

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Theoretical Computer Science 412 (50) 6959 (2011)
https://doi.org/10.1016/j.tcs.2011.09.008

Combinatorial Pattern Matching

Tomohiro I., Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Lecture Notes in Computer Science, Combinatorial Pattern Matching 6129 238 (2010)
https://doi.org/10.1007/978-3-642-13509-5_22

String Processing and Information Retrieval

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Lecture Notes in Computer Science, String Processing and Information Retrieval 6393 135 (2010)
https://doi.org/10.1007/978-3-642-16321-0_13

Language and Automata Theory and Applications

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Lecture Notes in Computer Science, Language and Automata Theory and Applications 5457 422 (2009)
https://doi.org/10.1007/978-3-642-00982-2_36

String Processing and Information Retrieval

Klaus-Bernd Schürmann and Jens Stoye
Lecture Notes in Computer Science, String Processing and Information Retrieval 3772 55 (2005)
https://doi.org/10.1007/11575832_8