Reverse engineering of compact suffix trees and links: A novel algorithm

Journal of Discrete Algorithms - Tập 28 - Trang 9-22 - 2014
Bastien Cazaux1, Eric Rivals1
1L.I.R.M.M., University of Montpellier II, CNRS U.M.R. 5506, 161 rue Ada, F-34392 Montpellier Cedex 5, France

Tài liệu tham khảo

Apostolico, 1985, The myriad virtues of suffix trees, 85 Gusfield, 1997, Algorithms on Strings, Trees, and Sequences, 10.1017/CBO9780511574931 I, 2011, Inferring strings from suffix trees and links on a binary alphabet, 121 I, 2014, Inferring strings from suffix trees and links on a binary alphabet, Discrete Appl. Math., 163, 316, 10.1016/j.dam.2013.02.033 McCreight, 1976, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach., 23, 262, 10.1145/321941.321946 Philippe, 2007 Ukkonen, 1995, On-line construction of suffix-trees, Algorithmica, 14, 249, 10.1007/BF01206331 Weiner, 1973, Linear pattern matching algorithms, 1