License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2014.162
URN: urn:nbn:de:0030-drops-44552
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4455/
Go to the corresponding LIPIcs Volume Portal


Blanchet-Sadri, Francine ; Bodnar, Michelle ; De Winkle, Benjamin

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings

pdf-format:
13.pdf (0.6 MB)


Abstract

We extend earlier works on the relation of prefix arrays of indeterminate strings to undirected graphs and border arrays. If integer array y is the prefix array for indeterminate string w, then we say w satisfies y. We use a graph theoretic approach to construct a string on a minimum alphabet size which satisfies a given prefix array. We relate the problem of finding a minimum alphabet size to finding edge clique covers of a particular graph, allowing us to bound the minimum alphabet size by n plus square root of n for indeterminate strings, where n is the size of the prefix array. When we restrict ourselves to prefix arrays for partial words, we bound the minimum alphabet size by sqrt(2n). Moreover, we show that this bound is tight up to a constant multiple by using Sidon sets. We also study the relationship between prefix arrays and border arrays. We show that the slowly-increasing property completely characterizes border arrays for indeterminate strings, whence there are exactly C_n distinct border arrays of size $n$ for indeterminate strings (here C_n is the nth Catalan number). We also bound the number of prefix arrays for partial words of a given size using Stirling numbers of the second kind.

BibTeX - Entry

@InProceedings{blanchetsadri_et_al:LIPIcs:2014:4455,
  author =	{Francine Blanchet-Sadri and Michelle Bodnar and Benjamin De Winkle},
  title =	{{New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings}},
  booktitle =	{31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
  pages =	{162--173},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-65-1},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{25},
  editor =	{Ernst W. Mayr and Natacha Portier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4455},
  URN =		{urn:nbn:de:0030-drops-44552},
  doi =		{10.4230/LIPIcs.STACS.2014.162},
  annote =	{Keywords: Indeterminate strings, Partial words, Prefix arrays, Border arrays, Undirected graphs}
}

Keywords: Indeterminate strings, Partial words, Prefix arrays, Border arrays, Undirected graphs
Collection: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Issue Date: 2014
Date of publication: 05.03.2014


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI