scientific article

zbMath1089.68080MaRDI QIDQ3370008

Thierry Lecroq, Arnaud Lefebvre, Jean-Pierre Duval

Publication date: 6 February 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

on-line linear-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items

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