Towards a real time algorithm for parameterized longest common prefix computation

[1]  Moshe Lewenstein,et al.  Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing , 2014, SIAM J. Comput..

[2]  Zvi Galil,et al.  Real-Time Streaming String-Matching , 2014, TALG.

[3]  Joong Chae Na,et al.  On-Line Construction of Parameterized Suffix Trees , 2009, SPIRE.

[4]  Amihood Amir,et al.  Real-time indexing over fixed finite alphabets , 2008, SODA '08.

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

[6]  Moshe Lewenstein,et al.  Approximate parameterized matching , 2007, TALG.

[7]  Moshe Lewenstein,et al.  Function Matching , 2006, SIAM J. Comput..

[8]  Moshe Lewenstein,et al.  Towards Real-Time Suffix Tree Construction , 2005, SPIRE.

[9]  Mohan S. Kankanhalli,et al.  Color indexing for efficient image retrieval , 1995, Multimedia Tools and Applications.

[10]  Esko Ukkonen,et al.  On-line construction of suffix trees , 1995, Algorithmica.

[11]  Michael J. Swain,et al.  Color indexing , 1991, International Journal of Computer Vision.

[12]  Athanasios K. Tsakalidis.  Maintaining order in a generalized linked list , 2004, Acta Informatica.

[13]  Kurt Mehlhorn,et al.  A new data structure for representing sorted lists , 1980, Acta Informatica.

[14]  Kenneth Ward Church,et al.  Separable attributes: a technique for solving the sub matrices character count problem , 2002, SODA '02.

[15]  Martin Farach-Colton,et al.  Optimal Suffix Tree Construction with Large Alphabets , 1997, FOCS.

[16]  Brenda S. Baker,et al.  Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance , 1997, SIAM J. Comput..

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

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

[19]  S. Rao Kosaraju.  Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) , 1994, STOC '94.

[20]  Gary Benson,et al.  An Alphabet Independent Approach to Two-Dimensional Pattern Matching , 1994, SIAM J. Comput..

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

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

[23]  Cecilia R. Aragon,et al.  Randomized search trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[24]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[25]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[26]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[27]  Edward M. Reingold,et al.  Binary search trees of bounded balance , 1972, SIAM J. Comput..