Parameterized Suffix Arrays for Binary Strings

We consider the suffix array for parameterized binary strings that consist of only two types of parameter symbols. We show that the parameterized suffix array, as well as its longest common prefix (LCP) array of such strings can be constructed in linear time. The construction is direct, in that it does not require the construction of a parameterized suffix tree. Although parameterized pattern matching of binary strings can be done by either searching for a pattern and its inverse on a standard suffix array, or constructing two independent standard suffix arrays for the text and its inverse, our approach only needs a single p-suffix array and a single search.

[1]  S. Muthukrishnan,et al.  Alphabet Dependence in Parameterized Matching , 1994, Inf. Process. Lett..

[2]  Moshe Lewenstein,et al.  Parameterized matching with mismatches , 2007, J. Discrete Algorithms.

[3]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[4]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[5]  S. Rao Kosaraju.  Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version) , 1995, FOCS.

[6]  Ayumi Shinohara,et al.  Inferring Strings from Graphs and Arrays , 2003, MFCS.

[7]  Srinivas Aluru,et al.  Space efficient linear time construction of suffix arrays , 2005, J. Discrete Algorithms.

[8]  Xerox Polo,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976 .

[9]  Alejandro A. Schäffer,et al.  Multiple Matching of Parameterized Patterns , 1994, CPM.

[10]  Hiroki Arimura,et al.  Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.

[11]  Dong Kyue Kim,et al.  An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size , 2004, SPIRE.

[12]  Dong Kyue Kim,et al.  Linear-Time Construction of Suffix Arrays , 2003, CPM.

[13]  Peter Sanders,et al.  Simple Linear Work Suffix Array Construction , 2003, ICALP.

[14]  Brenda S. Baker.  Parameterized Pattern Matching: Algorithms and Applications , 1996, J. Comput. Syst. Sci..

[15]  Brenda S. Baker,et al.  A Program for Identifying Duplicated Code , 1992 .

[16]  Moshe Lewenstein,et al.  Function Matching: Algorithms, Applications, and a Lower Bound , 2003, ICALP.

[17]  M. Crochemore,et al.  On-line construction of suffix trees , 2002 .

[18]  Kimmo Fredriksson,et al.  Efficient parameterized string matching , 2006, Inf. Process. Lett..

[19]  Tetsuo Shibuya.  Generalization of a Suffix Tree for RNA Structural Pattern Matching , 2000, SWAT.

[20]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[21]  Arnaud Lefebvre,et al.  Words over an ordered alphabet and suffix permutations , 2002, RAIRO Theor. Informatics Appl..

[22]  Raffaele Giancarlo,et al.  Periodicity and repetitions in parameterized strings , 2005, Discret. Appl. Math..

[23]  Moshe Lewenstein,et al.  Approximate Parameterized Matching , 2004, ESA.

[24]  Enno Ohlebusch,et al.  Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.

[25]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..