Publication:3370008
From MaRDI portal
zbMath1089.68080MaRDI QIDQ3370008
Thierry Lecroq, Arnaud Lefebvre, Jean-Pierre Duval
Publication date: 6 February 2006
Related Items
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info, Inferring strings from position heaps in linear time, Indeterminate string inference algorithms, Indeterminate strings, prefix arrays \& undirected graphs, Inferring strings from suffix trees and links on a binary alphabet, Verifying and enumerating parameterized border arrays, Recognizing union-find trees is NP-complete, Reconstructing a string from its Lyndon arrays, String inference from longest-common-prefix array, Universal reconstruction of a string, Inferring an indeterminate string from a prefix graph, A suffix tree or not a suffix tree?, On left and right seeds of a string, Inferring strings from Lyndon factorization, On Maximal Unbordered Factors, Representing prefix and border tables: results on enumeration, Universal Reconstruction of a String, Counting Parameterized Border Arrays for a Binary Alphabet, Efficient validation and construction of border arrays and validation of string matching automata