New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings

Recommendations

New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
Indeterminate strings, prefix arrays \& undirected graphs
Inferring an indeterminate string from a prefix graph
Representing prefix and border tables: results on enumeration
On the number of prefix and border tables

Cites work

Algorithmic Combinatorics on Partial Words
Algorithms on Strings
An O(n log n) algorithm for finding all repetitions in a string
Counting distinct strings
Covering graphs by the minimum number of equivalence relations
Generalized String Matching
Handbook of Graph Theory
scientific article; zbMATH DE number 3471577 (Why is no real title available?)
scientific article; zbMATH DE number 3253072 (Why is no real title available?)
Indeterminate strings, prefix arrays \& undirected graphs
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
On a Problem of Sidon in Additive Number Theory, and on some Related Problems
The Representation of a Graph by Set Intersections

Cited in

(6)

Universal reconstruction of a string
Inferring an indeterminate string from a prefix graph
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
Representing prefix and border tables: results on enumeration
Indeterminate strings, prefix arrays \& undirected graphs
On the number of prefix and border tables

This page was built for publication: New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363963)