References
- M. Crochemore, String-matching and periods, Bulletin of the European Association for Theoretical Computer Science 39 (1989), 149-153
- A. Apostolico, D. Breslauer and Z. Galil, Optimal parallel algorithms for periods, palindromes and squares, Proc. 19th Int. Colloq. Automata Languages and Programming, LNCS 623 (1992), 296-307
- A. Apostolico, M. Farach and C. S. Iliopoulos, Optimal superprimitivity testing for strings, Information Processing Letters 39 (1991), 17-20 https://doi.org/10.1016/0020-0190(91)90056-N
- D. Breslauer, An on-line string superprimitivity test, Information Processing Letters 44 (1992), 345-347 https://doi.org/10.1016/0020-0190(92)90111-8
- C.S. Iliopoulos and K. Park, An optimal O( log log n)-time algorithm for parallel super-primitivity testing, J. KISS 21, 8 (1994), 1400-1404
- C.S. Iliopoulos, D.W.G. Moore and K. Park, Covering a string, Algorithmica 16 (1996), 288-297 https://doi.org/10.1007/BF01955677
- M.G. Main and R.J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984), 422-432 https://doi.org/10.1016/0196-6774(84)90021-X
- A. Apostolico, Fast parallel detection of squares in strings, Algorithmica 8 (1992), 285-319 https://doi.org/10.1007/BF01758848
- G.M. Landau and J.P. Schmidt, An algorithm for approximate tandem repeats, Proc. 4th Symp. Combinatorial Pattern Matching, LNCS 648 (1993), 120-133
- J.P. Schmidt, All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings, SIAM J. Computing 27, 4 (1998), 972-992 https://doi.org/10.1137/S0097539795288489
- J.S. Sim, C.S. Iliopoulos, K. Park, W.F. Smyth, Approximate periods of strings, Theoretical Computer Science, 252 (2001), 557-568 https://doi.org/10.1016/S0304-3975(00)00365-0
- S. Kim, K. Park, A Dynamic edit distance table, Proc. 11th Symp. Combinatorial Pattern Matching, LNCS 1848 (2000), 60-68
- G.M. Landau, E.W. Myers and J.P. Schmidt, Incremental string comparison, SIAM .J. Computing 27, 2 (1998), 557-582 https://doi.org/10.1137/S0097539794264810
- M. Middendorf, More on the complexity of common superstring and supersequence problems, Theoretical Computer Science 125, 2 (1994), 205-228 https://doi.org/10.1016/0304-3975(92)00074-2
- K.J. Raihe and E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science 16 (1981), 187-198 https://doi.org/10.1016/0304-3975(81)90075-X