scientific article; zbMATH DE number 1874382
From MaRDI portal
Publication:4795855
zbMath1009.68106MaRDI QIDQ4795855
Shudi Gao, Yu Sun, Lu Yang, Weilin Lu, Patrick J. Ryan, Frantisek Franek, W. F. Smyth
Publication date: 6 April 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Universal Reconstruction of a String ⋮ On left and right seeds of a string ⋮ Inferring strings from Lyndon factorization ⋮ On Maximal Unbordered Factors ⋮ Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ 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 ⋮ Constructing an indeterminate string from its associated graph ⋮ Representing prefix and border tables: results on enumeration ⋮ Verifying and enumerating parameterized border arrays ⋮ A new approach to regular \& indeterminate strings ⋮ 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 ⋮ On the size of the smallest alphabet for Lyndon trees ⋮ Inferring an indeterminate string from a prefix graph ⋮ A suffix tree or not a suffix tree? ⋮ String inference from longest-common-prefix array
This page was built for publication:
