Words over an ordered alphabet and suffix permutations
RAIRO-Theor. Inf. Appl., 36 3 (2002) 249-259
Published online: 2002-12-15
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):
14899 1 (2025)
https://doi.org/10.1007/978-3-031-72200-4_1
Reconstructing parameterized strings from parameterized suffix and LCP arrays
Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus and Dina SokolTheoretical 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 ShinoharaLecture 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ánInternational Journal of Foundations of Computer Science 30 (06n07) 1029 (2019)
https://doi.org/10.1142/S0129054119400276
Recognizing Union-Find trees is NP-complete
Kitti Gelle and Szabolcs IvánInformation Processing Letters 131 7 (2018)
https://doi.org/10.1016/j.ipl.2017.11.003
Inferring strings from Lyndon factorization
Yuto Nakashima, Takashi Okabe, Tomohiro I, et al.Theoretical Computer Science 689 147 (2017)
https://doi.org/10.1016/j.tcs.2017.05.038
Descriptional Complexity of Formal Systems
Kitti Gelle and Szabolcs IvánLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 10316 152 (2017)
https://doi.org/10.1007/978-3-319-60252-3_12
A suffix tree or not a suffix tree?
Tatiana Starikovskaya and Hjalte Wedel VildhøjJournal of Discrete Algorithms 32 14 (2015)
https://doi.org/10.1016/j.jda.2015.01.005
Handbook of Enumerative Combinatorics
Dominique Perrin and Antonio RestivoDiscrete Mathematics and Its Applications, Handbook of Enumerative Combinatorics 485 (2015)
https://doi.org/10.1201/b18255-11
Combinatorial Algorithms
Tatiana Starikovskaya and Hjalte Wedel VildhøjLecture Notes in Computer Science, Combinatorial Algorithms 8986 338 (2015)
https://doi.org/10.1007/978-3-319-19315-1_30
Inferring strings from suffix trees and links on a binary alphabet
Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki TakedaDiscrete Applied Mathematics 163 316 (2014)
https://doi.org/10.1016/j.dam.2013.02.033
Suffix array and Lyndon factorization of a text
Sabrina Mantaci, Antonio Restivo, Giovanna Rosone and Marinella SciortinoJournal of Discrete Algorithms 28 2 (2014)
https://doi.org/10.1016/j.jda.2014.06.001
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
Developments in Language Theory
Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone and Marinella SciortinoLecture Notes in Computer Science, Developments in Language Theory 7907 131 (2013)
https://doi.org/10.1007/978-3-642-38771-5_13
Verifying and enumerating parameterized border arrays
Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki TakedaTheoretical Computer Science 412 (50) 6959 (2011)
https://doi.org/10.1016/j.tcs.2011.09.008
Computer Science – Theory and Applications
Konstantin M. Likhomanov and Arseny M. ShurLecture Notes in Computer Science, Computer Science – Theory and Applications 6651 385 (2011)
https://doi.org/10.1007/978-3-642-20712-9_30
A quick tour on suffix arrays and compressed suffix arrays
Roberto GrossiTheoretical Computer Science 412 (27) 2964 (2011)
https://doi.org/10.1016/j.tcs.2010.12.036
Combinatorial Pattern Matching
Tomohiro I., Shunsuke Inenaga, Hideo Bannai and Masayuki TakedaLecture 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 TakedaLecture Notes in Computer Science, String Processing and Information Retrieval 6393 135 (2010)
https://doi.org/10.1007/978-3-642-16321-0_13
Lyndon Christoffel digitally convex
S. Brlek, J.-O. Lachaud, X. Provençal and C. ReutenauerPattern Recognition 42 (10) 2239 (2009)
https://doi.org/10.1016/j.patcog.2008.11.010
Language and Automata Theory and Applications
Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki TakedaLecture Notes in Computer Science, Language and Automata Theory and Applications 5457 422 (2009)
https://doi.org/10.1007/978-3-642-00982-2_36
Counting suffix arrays and strings
Klaus-Bernd Schürmann and Jens StoyeTheoretical Computer Science 395 (2-3) 220 (2008)
https://doi.org/10.1016/j.tcs.2008.01.011
A note on the Burrows–Wheeler transformation
Maxime Crochemore, Jacques Désarménien and Dominique PerrinTheoretical Computer Science 332 (1-3) 567 (2005)
https://doi.org/10.1016/j.tcs.2004.11.014
String Processing and Information Retrieval
Klaus-Bernd Schürmann and Jens StoyeLecture Notes in Computer Science, String Processing and Information Retrieval 3772 55 (2005)
https://doi.org/10.1007/11575832_8