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:

This article has been cited by the following article(s):

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)
DOI: 10.1007/978-3-642-38771-5_13
See this article

Recognizing Union-Find trees is NP-complete

Kitti Gelle and Szabolcs Iván
Information Processing Letters 131 7 (2018)
DOI: 10.1016/j.ipl.2017.11.003
See this article

A quick tour on suffix arrays and compressed suffix arrays

Roberto Grossi
Theoretical Computer Science 412 (27) 2964 (2011)
DOI: 10.1016/j.tcs.2010.12.036
See this article

Lyndon Christoffel digitally convex

S. Brlek, J.-O. Lachaud, X. Provençal and C. Reutenauer
Pattern Recognition 42 (10) 2239 (2009)
DOI: 10.1016/j.patcog.2008.11.010
See this article

A note on the Burrows–Wheeler transformation

Maxime Crochemore, Jacques Désarménien and Dominique Perrin
Theoretical Computer Science 332 (1-3) 567 (2005)
DOI: 10.1016/j.tcs.2004.11.014
See this article

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)
DOI: 10.1007/978-3-662-44465-8_48
See this article

Verifying and enumerating parameterized border arrays

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Theoretical Computer Science 412 (50) 6959 (2011)
DOI: 10.1016/j.tcs.2011.09.008
See this article

Combinatorial Algorithms

Tatiana Starikovskaya and Hjalte Wedel Vildhøj
Lecture Notes in Computer Science, Combinatorial Algorithms 8986 338 (2015)
DOI: 10.1007/978-3-319-19315-1_30
See this article

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)
DOI: 10.1016/j.dam.2013.02.033
See this article

A suffix tree or not a suffix tree?

Tatiana Starikovskaya and Hjalte Wedel Vildhøj
Journal of Discrete Algorithms 32 14 (2015)
DOI: 10.1016/j.jda.2015.01.005
See this article

Counting suffix arrays and strings

Klaus-Bernd Schürmann and Jens Stoye
Theoretical Computer Science 395 (2-3) 220 (2008)
DOI: 10.1016/j.tcs.2008.01.011
See this article

Handbook of Enumerative Combinatorics

Dominique Perrin and Antonio Restivo
Discrete Mathematics and Its Applications, Handbook of Enumerative Combinatorics 485 (2015)
DOI: 10.1201/b18255-11
See this article

Descriptional Complexity of Formal Systems

Kitti Gelle and Szabolcs Iván
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 10316 152 (2017)
DOI: 10.1007/978-3-319-60252-3_12
See this article

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)
DOI: 10.1142/S0129054119400276
See this article

Inferring strings from Lyndon factorization

Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
Theoretical Computer Science 689 147 (2017)
DOI: 10.1016/j.tcs.2017.05.038
See this article

Suffix array and Lyndon factorization of a text

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone and Marinella Sciortino
Journal of Discrete Algorithms 28 2 (2014)
DOI: 10.1016/j.jda.2014.06.001
See this article

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)
DOI: 10.1007/978-3-642-00982-2_36
See this article

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)
DOI: 10.1007/11575832_8
See this article

Combinatorial Pattern Matching

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

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)
DOI: 10.1007/978-3-642-16321-0_13
See this article

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)
DOI: 10.1007/978-3-642-20712-9_30
See this article