Efficient validation and construction of border arrays and validation of string matching automata
RAIRO-Theor. Inf. Appl., 43 2 (2009) 281-297
Published online: 2008-12-04
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):
On suffix tree detection
Amihood Amir, Eitan Kondratovsky and Avivit LevyTheoretical Computer Science 1012 114728 (2024)
https://doi.org/10.1016/j.tcs.2024.114728
14240 14 (2023)
https://doi.org/10.1007/978-3-031-43980-3_2
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 inference from longest-common-prefix array
Juha Kärkkäinen, Marcin Piątkowski and Simon J. PuglisiTheoretical Computer Science 942 180 (2023)
https://doi.org/10.1016/j.tcs.2022.11.032
Universal reconstruction of a string
Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz WaleńTheoretical Computer Science 812 174 (2020)
https://doi.org/10.1016/j.tcs.2019.10.027
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
Representing prefix and border tables: results on enumeration
JULIEN CLÉMENT and LAURA GIAMBRUNOMathematical Structures in Computer Science 27 (2) 257 (2017)
https://doi.org/10.1017/S0960129515000146
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
Combinatorics on partial word borders
Emily Allen, F. Blanchet-Sadri, Michelle Bodnar, et al.Theoretical Computer Science 609 469 (2016)
https://doi.org/10.1016/j.tcs.2015.11.006
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
Algorithms and Data Structures
Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz WaleńLecture Notes in Computer Science, Algorithms and Data Structures 9214 386 (2015)
https://doi.org/10.1007/978-3-319-21840-3_32
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
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Paweł Gawrychowski, Artur Jeż and Łukasz JeżTheory of Computing Systems 54 (2) 337 (2014)
https://doi.org/10.1007/s00224-013-9522-8
LATIN 2014: Theoretical Informatics
Julien Clément and Laura GiambrunoLecture Notes in Computer Science, LATIN 2014: Theoretical Informatics 8392 442 (2014)
https://doi.org/10.1007/978-3-642-54423-1_39
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
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
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