Manacher, Glenn A new linear-time ’on-line’ algorithm for finding the smallest initial palindrome of a string. (English) Zbl 0305.68027 J. Assoc. Comput. Mach. 22, 346-351 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 ReviewsCited in 62 Documents MSC: 68W99 Algorithms in computer science 68W30 Symbolic computation and algebraic computation 68Q45 Formal languages and automata PDF BibTeX XML Cite \textit{G. Manacher}, J. Assoc. Comput. Mach. 22, 346--351 (1975; Zbl 0305.68027) Full Text: DOI Online Encyclopedia of Integer Sequences: Minimum length of the string over the alphabet of 3 or more symbols that has exactly n substring palindromes. Substrings are counted as distinct if they start at different offsets.