Algorithms and combinatorial properties on shortest unique palindromic substrings

Bannai, 2015, Diverse palindromic factorization is np-complete, 85 Bender, 2000, The LCA problem revisited, 88 Borozdin, 2017, Palindromic length in linear time, 23:1 Crochemore, 2008, Computing longest previous factor in linear time and applications, Inf. Process. Lett., 106, 75, 10.1016/j.ipl.2007.10.006 Droubay, 2001, Episturmian words and some constructions of de Luca and Rauzy, Theor. Comput. Sci., 255, 539, 10.1016/S0304-3975(99)00320-5 Fici, 2014, A subquadratic algorithm for minimum palindromic factorization, J. Discret. Algorithms, 28, 41, 10.1016/j.jda.2014.08.001 Glen, 2009, Palindromic richness, Eur. J. Comb., 30, 510, 10.1016/j.ejc.2008.04.006 Groult, 2010, Counting distinct palindromes in a word in linear time, Inf. Process. Lett., 110, 908, 10.1016/j.ipl.2010.07.018 Hon, 2017, In-place algorithms for exact and approximate shortest unique substring problems, Theor. Comput. Sci., 690, 12, 10.1016/j.tcs.2017.05.032 Hu, 2014, Shortest unique queries on strings, 161 I, 2014, Computing palindromic factorizations and palindromic covers on-line, 150 Ileri, 2014, Shortest unique substring query revisited, 172 Kärkkäinen, 2006, Linear work suffix array construction, J. ACM, 53, 918, 10.1145/1217856.1217858 Kasai, 2001, Linear-time longest-common-prefix computation in suffix arrays and its applications, 181 Kim, 2005, Constructing suffix arrays in linear time, J. Discret. Algorithms, 3, 126, 10.1016/j.jda.2004.08.019 Ko, 2005, Space efficient linear time construction of suffix arrays, J. Discret. Algorithms, 3, 143, 10.1016/j.jda.2004.08.002 Kuramoto, 1992, Oligonucleotide sequences required for natural killer cell activation, Jpn. J. Cancer Res., 83, 1128, 10.1111/j.1349-7006.1992.tb02734.x Manacher, 1975, A new linear-time “on-line” algorithm for finding the smallest initial palindrome of a string, J. ACM, 22, 346, 10.1145/321892.321896 Mieno, 2016, Shortest unique substring queries on run-length encoded strings, 69:1 Mieno, 2017, Tight bounds on the maximum number of shortest unique substrings, 24:1 Pei, 2013, On shortest unique substring queries, 937 Rubinchik, 2017, Counting palindromes in substrings, 290 Rubinchik, 2018, EERTREE: an efficient data structure for processing palindromes in strings, Eur. J. Comb., 68, 249, 10.1016/j.ejc.2017.07.021 Tsuruta, 2014, Shortest unique substrings queries in optimal time, 503 Yamamoto, 1992, Unique palindromic sequences in synthetic oligonucleotides are required to induce ifn [correction of inf] and augment ifn-mediated [correction of inf] natural killer activity, J. Immunol., 148, 4072, 10.4049/jimmunol.148.12.4072