Completing the New Periodicity Lemma

作者: Widmer Bland

DOI:

关键词:

摘要: The “Three Squares Lemma” (Crochemore and Rytter 1995) famously explored the consequences of supposing that three squares occur at same position in a string. Essentially, it showed this phenomenon could not unless longest was least sum lengths other two. More recently, several papers (Fan et al. 2006; Franek, Fuller, 2012; Kopylova Smyth Simpson 2007) have greatly extended result to “New Periodicity (NPL) by only two position, with third occurring neighbourhood right. proof NPL involves fourteen subcases, twelve which been proven over last seven years. In thesis, we prove final remaining.

参考文章(57)
Allouche Jean-Paul, Berthe Valerie, Crochemore Maxime, Jacquet Philippe, Kolpakov Roman, Koucherov Gregory, Laporte Eric, Mohri Mehryar, Nadia Pisanti, Poulalhon Dominique, Reinert Gesine, MARIE Sagot, Schaeffer Gilles, Schbath Sophie, Szpankowski Wojciech, Waterman Michael, Applied Combinatorics on Words ,(2005)
Pang Ko, Srinivas Aluru, Space efficient linear time construction of suffix arrays combinatorial pattern matching. pp. 200- 210 ,(2003) , 10.1007/3-540-44888-8_15
Ge Nong, Sen Zhang, Wai Hong Chan, Linear Time Suffix Array Construction Using D-Critical Substrings combinatorial pattern matching. pp. 54- 67 ,(2009) , 10.1007/978-3-642-02441-2_6
Pang Ko, Aluru Srinivas, Linear Time Construction of Suffix Arrays ,(2002)
Widmer Bland, W.F. Smyth, Three overlapping squares: The general case characterized & applications Theoretical Computer Science. ,vol. 596, pp. 23- 40 ,(2015) , 10.1016/J.TCS.2015.06.037
Alberto Apostolico, The Myriad Virtues of Subword Trees Springer, Berlin, Heidelberg. pp. 85- 96 ,(1985) , 10.1007/978-3-642-82456-2_6
Wataru Matsubara, Hideo Bannai, Akira Ishino, Ayumi Shinohara, Kazuhiko Kusano, New lower bounds for the maximum number of runs in a string prague stringology conference. pp. 140- 145 ,(2008)
Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park, Linear-time construction of suffix arrays combinatorial pattern matching. pp. 186- 199 ,(2003) , 10.1007/3-540-44888-8_14
Roman Kolpakov, Gregory Kucherov, On Maximal Repetitions in Words fundamentals of computation theory. pp. 374- 385 ,(1999) , 10.1007/3-540-48321-7_31