Text Algorithms

[1]  J. A. Salvato.  John wiley & sons. , 1994, Environmental science & technology.

[2]  Wojciech Rytter,et al.  Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3]  Wojciech Rytter,et al.  Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms , 1992, ICPIA.

[4]  Gary Benson,et al.  Alphabet independent two dimensional matching , 1992, STOC '92.

[5]  Kosaburo Hashiguchi,et al.  Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids , 1992, Theor. Comput. Sci..

[6]  Maxime Crochemore,et al.  Two-way string-matching , 1991, JACM.

[7]  Mark Nelson,et al.  The Data Compression Book , 2009 .

[8]  Zvi Galil,et al.  An Optimal O(log log n) Time Parallel String Matching Algorithm , 1990, SIAM J. Comput..

[9]  Zvi Galil,et al.  Faster tree pattern matching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  Gad M. Landau,et al.  Optimal parallel suffix-prefix matching algorithm and applications , 1989, SPAA '89.

[11]  Esko Ukkonen,et al.  A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings , 1988, Theor. Comput. Sci..

[12]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[13]  Lawrence L. Larmore,et al.  New applications of failure functions , 1987, JACM.

[14]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[15]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[16]  G. Sampath,et al.  An introduction to text processing , 1986, IEEE Transactions on Professional Communication.

[17]  Uzi Vishkin,et al.  Optimal Parallel Pattern Matching in Strings , 2017, Inf. Control..

[18]  David Haussler,et al.  The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[19]  Michael G. Main,et al.  An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[20]  Raffaele Giancarlo,et al.  Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability , 1984, Inf. Process. Lett..

[21]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[22]  Jean Pierre Duval,et al.  Factorizing Words over an Ordered Alphabet , 1983, J. Algorithms.

[23]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[24]  Zvi Galil,et al.  Time-Space-Optimal String Matching , 1983, J. Comput. Syst. Sci..

[25]  Yossi Shiloach,et al.  Fast Canonization of Circular Strings , 1981, J. Algorithms.

[26]  David Maier,et al.  On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..

[27]  Theodore P. Baker.  A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension , 1978, SIAM J. Comput..

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

[29]  Umberto Eco,et al.  Theory of Codes , 1976 .

[30]  Glenn K. Manacher,et al.  A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String , 1975, JACM.