Inferring an indeterminate string from a prefix graph

Abrahamson, 1987, Generalized string matching, SIAM J. Comput., 16, 1039, 10.1137/0216067 Bannai, 2003, Inferring strings from graphs and arrays, vol. 2747, 208 Blanchet-Sadri, 2008 Blanchet-Sadri, 2014, New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, 162 Bland, 2013, Prefix table construction and conversion, 41 Christodoulakis Clément, 2009, Reverse engineering prefix tables, 289 Duval, 2005, Border array on bounded alphabet, J. Autom. Lang. Comb., 10, 51 Fischer, 1974, String matching and other products, 113 Franek, 2000, Verifying a border array in linear time, J. Comb. Math. Comb. Comput., 42, 223 Franek, 1999, Verifying a border array in linear time (preliminary version), 26 Franek, 2006, Reconstructing a suffix array, Int. J. Found. Comput. Sci., 17, 1281, 10.1142/S0129054106004418 Holub, 2003, Algorithms on indeterminate strings, 36 Iliopoulos, 2003, String regularities with don't cares, Nord. J. Comput., 10, 40 Iliopoulos, 2008, A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching, Math. Comput. Sci., 557, 10.1007/s11786-007-0029-z Main, 1984, An O(nlog⁡n) algorithm for finding all repetitions in a string, J. Algorithms, 5, 422, 10.1016/0196-6774(84)90021-X Moore, 1999, Counting distinct strings, Algorithmica, 23, 1, 10.1007/PL00009247 Moosa, 2013, Linear time inference of strings from cover arrays using a binary alphabet, Discrete Math. Algorithms Appl., 5, 160, 10.1142/S1793830913600057 Nazeen, 2012, Indeterminate string inference algorithms, J. Discrete Algorithms, 10, 23, 10.1016/j.jda.2011.08.002 Smyth, 2003 Smyth, 2008, New perspectives on the prefix array, 133