@inproceedings{v1998,
  author = {M. {\v{S}}im{\'a}nek},
  title = {The factor automaton},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'98},
  year = {1998},
  pages = {102--106},
  note = {Collaborative Report DC--98--06}
}

@article{Aalbersberg1988,
  author = {I. J. Aalbersberg and G. Rozenberg},
  title = {Theory of traces},
  journal = {Theor. Comput. Sci.},
  year = {1988},
  volume = {60},
  number = {1},
  pages = {1--82}
}

@article{Aalbersberg1986,
  author = {I. J. Aalbersberg and E. Welzl},
  title = {Trace languages defined by regular string languages},
  journal = {RAIRO Inform. Th{\'e}or.},
  year = {1986},
  volume = {20},
  number = {2},
  pages = {103--119}
}

@inproceedings{Abdeddaim2000,
  author = {S. Abdedda{\"i}m},
  title = {Algorithms and experiments on transitive closure, path cover, and multiple sequence alignment},
  booktitle = {Proceedings of the 2nd Algorithm Engineering and Experiments},
  year = {2000},
  pages = {157--169}
}

@inproceedings{Abdeddaim1997,
  author = {S. Abdedda{\"i}m},
  title = {On incremental computation of transitive closure and greedy alignment},
  booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1264},
  pages = {167--179}
}

@phdthesis{Abdeddaim1996,
  author = {S. Abdedda{\"i}m},
  title = {Comparaison de s{\'e}quences biologiques},
  school = {Universit{\'e} Paris 6},
  year = {1996}
}

@techreport{Abdeddaim1996a,
  author = {S. Abdedda{\"i}m},
  title = {Comparaison de s{\'e}quences biologiques},
  year = {1996},
  number = {Th96/09}
}

@article{Abrahamson1987,
  author = {K. Abrahamson},
  title = {Generalized string matching},
  journal = {SIAM J. Comput.},
  year = {1987},
  volume = {16},
  number = {6},
  pages = {1039--1051}
}

@article{Adiego2007,
  author = {J. Adiego and G. Navarro and P. de la Fuente},
  title = {Lempel-Ziv Compression of Highly Structured Documents},
  journal = {Journal of the American Society for Information Science and Technology (JASIST)},
  year = {2007},
  volume = {58},
  number = {4},
  pages = {461--478},
  note = {To appear}
}

@article{Adiego2007a,
  author = {J. Adiego and G. Navarro and P. de la Fuente},
  title = {Using Structural Contexts to Compress Semistructured Text Collections},
  journal = {Information Processing and Management (IPM)},
  year = {2007},
  volume = {43},
  number = {769--790}
}

@inproceedings{Agostino2002,
  author = {S. De Agostino},
  title = {A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching},
  booktitle = {Proceedings of the Prague Stringology Conference~'02},
  year = {2002},
  pages = {1--8},
  note = {Research Report DC--2002--03}
}

@incollection{Aho1990,
  author = {A. V. Aho},
  title = {Algorithms for finding patterns in strings},
  booktitle = {Handbook of Theoretical Computer Science, Algorithms and complexity},
  publisher = {Elsevier},
  year = {1990},
  volume = {A},
  pages = {255--300}
}

@incollection{Aho1980,
  author = {A. V. Aho},
  title = {Pattern matching in strings},
  booktitle = {Formal Language Theory: Perspectives and Open Problems},
  publisher = {Academic Press},
  year = {1980},
  pages = {325--347}
}

@article{Aho1975,
  author = {A. V. Aho and M. J. Corasick},
  title = {Efficient string matching: an aid to bibliographic search},
  journal = {Commun. ACM},
  year = {1975},
  volume = {18},
  number = {6},
  pages = {333--340}
}

@inproceedings{Aho1985,
  author = {A. V. Aho and M. Ganapathy},
  title = {Efficient tree pattern matching: an aid to Code Generation},
  booktitle = {Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages},
  year = {1985},
  pages = {334--340}
}

@article{Aho1976,
  author = {A. V. Aho and D. S. Hirschberg and J. D. Ullman},
  title = {Bounds on the complexity of the longest common subsequence problem},
  journal = {J. Assoc. Comput. Mach.},
  year = {1976},
  volume = {23},
  number = {1},
  pages = {1--12}
}

@book{Aho1983,
  author = {A. V. Aho and J. E. Hopcroft and J. D. Ullman},
  title = {Data structures and algorithms},
  publisher = {Addison-Wesley},
  year = {1983}
}

@article{Aho1976a,
  author = {A. V. Aho and J. E. Hopcroft and J. D. Ullman},
  title = {On finding lowest common ancestors in trees},
  journal = {SIAM J. Comput.},
  year = {1976},
  volume = {5},
  number = {1},
  pages = {115--132}
}

@book{Aho1974,
  author = {A. V. Aho and J. E. Hopcroft and J. D. Ullman},
  title = {The design and analysis of computer algorithms},
  publisher = {Addison-Wesley},
  year = {1974}
}

@book{Aho1988,
  author = {A. V. Aho and B. W. Kernighan and P. J. Weinberger},
  title = {The {AWK} programming language},
  publisher = {Addison-Wesley},
  year = {1988}
}

@article{Aho1972,
  author = {A. V. Aho and T. G. Paterson},
  title = {A minimum distance error-correcting parser for context-free languages},
  journal = {SIAM J. Comput.},
  year = {1972},
  volume = {1},
  number = {4},
  pages = {305--312}
}

@book{Aho1986,
  author = {A. V. Aho and R. Sethi and J. D. Ullman},
  title = {Compilers -- Principles, Techniques and Tools},
  publisher = {Addison-Wesley},
  year = {1986}
}

@book{Aho1977,
  author = {A. V. Aho and J. D. Ullman},
  title = {Principles of compiler design},
  publisher = {Addison-Wesley},
  year = {1977}
}

@article{Akutsu1995,
  author = {T. Akutsu},
  title = {Approximate string matching with don't care characters},
  journal = {Inf. Process. Lett.},
  year = {1995},
  volume = {55},
  number = {5},
  pages = {235--239}
}

@inproceedings{Akutsu1994,
  author = {T. Akutsu},
  title = {Approximate string matching with don't care symbols},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {240--249}
}

@inproceedings{Akutsu1993,
  author = {T. Akutsu},
  title = {A linear time pattern matching algorithm between a string and a tree},
  booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1993},
  number = {684},
  pages = {1--10}
}

@inproceedings{Akutsu1999,
  author = {T. Akutsu and K. Kanaya and A. Ohyama and A. Fujiyama},
  title = {Matching of Spots in {2D} Electrophoresis Images. Point Matching Under Non-uniform Distortions},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {212--222}
}

@article{Alberga1967,
  author = {C. N. Alberga},
  title = {String similarity and misspellings},
  journal = {Commun. ACM},
  year = {1967},
  volume = {10},
  number = {5},
  pages = {302--313}
}

@inproceedings{Alexander1994,
  author = {K. S. Alexander},
  title = {Shortest Common Superstring for Strings of Random Letters},
  booktitle = {5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  volume = {807},
  pages = {164--172}
}

@article{Alizadeh1995,
  author = {F. Alizadeh and R. M. Karp and L. A. Newberg and D. K. Weisser},
  title = {Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology},
  journal = {Algorithmica},
  year = {1995},
  volume = {13},
  number = {1/2},
  pages = {52--76}
}

@inproceedings{Allauzen1999,
  author = {C. Allauzen and M. Crochemore and M. Raffinot},
  title = {Factor oracle: a new structure for pattern matching},
  booktitle = {SOFSEM'99, Theory and Practice of Informatics},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1725},
  pages = {291--306}
}

@inproceedings{Allauzen2000,
  author = {C. Allauzen and M. Raffinot},
  title = {Simple Optimal String Matching Algorithm},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {364--374}
}

@article{Allauzen2000a,
  author = {C. Allauzen and M. Raffinot},
  title = {Simple Optimal String Matching Algorithm},
  journal = {J. Algorithms},
  year = {2000},
  volume = {36},
  number = {1},
  pages = {102--116}
}

@techreport{Allison1998,
  author = {L. Allison},
  title = {Information-theoretic sequence alignment.},
  year = {1998},
  number = {98/14}
}

@article{Allison1994,
  author = {L. Allison},
  title = {Using {Hirschberg}'s algorithm to generate random alignments of strings},
  journal = {Inf. Process. Lett.},
  year = {1994},
  volume = {51},
  number = {5},
  pages = {251--255}
}

@article{Allison1993,
  author = {L. Allison},
  title = {A Fast Algorithm for the Alignment of Three Strings},
  journal = {J. Theor. Biol.},
  year = {1993},
  volume = {164},
  pages = {261--269}
}

@article{Allison1986,
  author = {L. Allison and T. I. Dix},
  title = {A bit string longest common subsequence algorithm},
  journal = {Inf. Process. Lett.},
  year = {1986},
  volume = {23},
  number = {6},
  pages = {305--310}
}

@inproceedings{Allison1998a,
  author = {L. Allison and T. Edgoose and T. I. Dix},
  title = {Compression of strings with approximate repeats.},
  booktitle = {Proceedings International Conference on Intelligent Systems for Molecular Biology},
  year = {1998},
  pages = {8--16}
}

@article{Allison1999,
  author = {L. Allison and D. Powell and T. I. Dix},
  title = {Compression and approximate matching.},
  journal = {Comput. J.},
  year = {1999},
  volume = {42},
  number = {1},
  pages = {1--10}
}

@article{Allison1994a,
  author = {L. Allison and C. S. Wallace},
  title = {An information measure for the string to string correction problem with applications},
  journal = {Aust. Comput. Sci. Commun.},
  year = {1994},
  volume = {16},
  number = {1},
  pages = {659--668}
}

@article{Allison1992,
  author = {L. Allison and C. S. Wallace and C. N. Yee},
  title = {Finite-state models in the alignment of macromolecules},
  journal = {J. Mol. Evol.},
  year = {1992},
  volume = {35},
  pages = {77--89}
}

@techreport{Allison1990,
  author = {L. Allison and C. S. Wallace and C. N. Yee},
  title = {Induction inference over macro--molecules},
  year = {1990},
  number = {90/148}
}

@article{Allison1990a,
  author = {L. Allison and C. N. Yee},
  title = {Minimum message length encoding and the comparison of Macromolecules},
  journal = {Bull. Math. Biol.},
  year = {1990},
  volume = {52},
  pages = {431--453}
}

@article{Almeida1993,
  author = {de Almeida, Jr, N. F. and V. C. Barbosa},
  title = {A string-matching algorithm for the {CREW PRAM}},
  journal = {Inf. Process. Lett.},
  year = {1993},
  volume = {47},
  number = {5},
  pages = {257--259}
}

@inproceedings{Alstrup2000,
  author = {A. Alstrup and G. S. Brodal and T. Rauhe},
  title = {Pattern Matching in Dynamic Texts},
  booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {819--828}
}

@article{Alt1984,
  author = {H. Alt and K. Mehlhorn and J. I. Munro},
  title = {Partial match retrieval in implicit data structures},
  journal = {Inf. Process. Lett.},
  year = {1984},
  volume = {19},
  number = {2},
  pages = {61--65}
}

@article{Altschul1993,
  author = {S. F. Altschul},
  title = {A protein alignment scoring system sensitive to all evolutionary distances},
  journal = {J. Mol. Evol.},
  year = {1993},
  volume = {36},
  pages = {290--300}
}

@article{Altschul1991,
  author = {S. F. Altschul},
  title = {Amino acid substitution matrices from an information theoretic perspective},
  journal = {J. Mol. Biol.},
  year = {1991},
  volume = {219},
  pages = {555--565}
}

@article{Altschul1989,
  author = {S. F. Altschul},
  title = {Gap costs for multiple sequence alignment},
  journal = {J. Theor. Biol.},
  year = {1989},
  volume = {138},
  pages = {297--309}
}

@article{Altschul1989a,
  author = {S. F. Altschul and R. J. Carroll and D. J. Lipman},
  title = {Weights for data related by a tree},
  journal = {J. Mol. Biol.},
  year = {1989},
  volume = {207},
  pages = {647--653}
}

@article{Altschul1986,
  author = {S. F. Altschul and B. W. Erickson},
  title = {A Nonlinear Measure of Subalignment Similarity and its Signifiance Level},
  journal = {Bull. Math. Biol.},
  year = {1986},
  volume = {48},
  number = {5},
  pages = {617--632}
}

@article{Altschul1986a,
  author = {S. F. Altschul and B. W. Erickson},
  title = {Optimal Sequence Alignment Using Affine Gap Costs},
  journal = {Bull. Math. Biol.},
  year = {1986},
  volume = {48},
  number = {5},
  pages = {603--616}
}

@article{Altschul1990,
  author = {S. F. Altschul and W. Gish and W. Miller and E. W. Myers and D. J. Lipman},
  title = {A basic local alignment search tool},
  journal = {J. Mol. Biol.},
  year = {1990},
  volume = {215},
  pages = {403--410}
}

@article{Altschul1990a,
  author = {S. F. Altschul and D. J. Lipman},
  title = {Protein database searches for multiple alignments},
  journal = {Proc. Natl. Acad. Sci. U.S.A.},
  year = {1990},
  volume = {87},
  pages = {5509--5513}
}

@article{Altschul1989b,
  author = {S. F. Altschul and D. J. Lipman},
  title = {Trees, stars, and multiple biological sequence alignment},
  journal = {SIAM J. Appl. Math.},
  year = {1989},
  volume = {49},
  pages = {197--209}
}

@article{Altschul1997,
  author = {S. F. Altschul and T. L. Madden and A. A. Schaffer and J. Zhang and Z. Zhang and W. Miller and D. J. Lipman},
  title = {Gapped {Blast} and {Psi-Blast}: a new generation of protein database search programs},
  journal = {Nucleic Acids Res.},
  year = {1997},
  volume = {25},
  pages = {3389--3402}
}

@unpublished{Amir1991,
  author = {A. Amir},
  title = {Multidimensional pattern matching},
  year = {1991},
  note = {Manuscript}
}

@techreport{Amir1987,
  author = {A. Amir},
  title = {Multidimensional and relative approximate pattern matching},
  year = {1987},
  number = {UMIACS-TR-87-41 and CS-TR-1912}
}

@article{Amir1997,
  author = {A. Amir and A. Apostolico and M. Lewenstein},
  title = {Inverse Pattern Matching},
  journal = {J. Algorithms},
  year = {1997},
  volume = {24},
  number = {2},
  pages = {325--339}
}

@article{Amir2000,
  author = {A. Amir and Y. Aumann and G, Landau and M. Lewenstein and N. Lewenstein},
  title = {Pattern Matching with Swaps},
  journal = {J. Algorithms},
  year = {2000},
  volume = {37},
  number = {2},
  pages = {247--266}
}

@inproceedings{Amir1997a,
  author = {A. Amir and Y. Aumann and G, Landau and M. Lewenstein and N. Lewenstein},
  title = {Pattern Matching with Swaps},
  booktitle = {Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science},
  year = {1997},
  pages = {144--153}
}

@article{Amir1998,
  author = {A. Amir and G. Benson},
  title = {Two-Dimensional Periodicity in Rectangular Arrays},
  journal = {SIAM J. Comput.},
  year = {1998},
  volume = {27},
  number = {1},
  pages = {90--106}
}

@inproceedings{Amir1992,
  author = {A. Amir and G. Benson},
  title = {Two-dimensional periodicity and its applications},
  booktitle = {Proceedings of the 3rd ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1992},
  pages = {440--452}
}

@article{Amir1998a,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Optimal Parallel Two Dimensional Text Searching on a {CREW PRAM}},
  journal = {Inf. Comput.},
  year = {1998},
  volume = {144},
  number = {1},
  pages = {1--17}
}

@article{Amir1997b,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Optimal two-dimensional compressed matching},
  journal = {J. Algorithms},
  year = {1997},
  volume = {24},
  number = {2},
  pages = {354--379}
}

@article{Amir1996,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Let Sleeping Files Lie: Pattern Matching in {Z}-Compressed Files},
  journal = {J. Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  number = {2},
  pages = {299--307}
}

@inproceedings{Amir1994,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Optimal two-dimensional compressed matching},
  booktitle = {Proceedings of the 21st International Colloquium on Automata, Languages and Programming},
  year = {1994},
  volume = {820},
  pages = {215--226}
}

@article{Amir1994a,
  author = {A. Amir and G. Benson and M. Farach},
  title = {An alphabet independent approach to two-dimensional pattern matching},
  journal = {SIAM J. Comput.},
  year = {1994},
  volume = {23},
  number = {2},
  pages = {313--323}
}

@inproceedings{Amir1994b,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Let Sleeping Files Lie: Pattern Matching in {Z}-Compressed Files},
  booktitle = {Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1994},
  pages = {705--714}
}

@inproceedings{Amir1993,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Optimal parallel two-dimensional pattern matching},
  booktitle = {Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures},
  publisher = {ACM Press},
  year = {1993},
  pages = {79--85}
}

@techreport{Amir1993a,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Let Sleeping Files Lie: Pattern Matching in {Z}-Compressed Files},
  year = {1993},
  number = {GIT-CC-93-42}
}

@inproceedings{Amir1992a,
  author = {A. Amir and G. Benson and M. Farach},
  title = {Alphabet independent two dimensional matching},
  booktitle = {Proceedings of the 24th ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1992},
  pages = {59--68}
}

@techreport{Amir1992b,
  author = {A. Amir and G. Benson and M. Farach},
  title = {The truth, the whole truth and nothing but the truth: alphabet independent 2-d witness table construction},
  year = {1992},
  number = {GIT-CC-92-51}
}

@article{Amir2004,
  author = {Amihood Amir and Ayelet Butman and Maxime Crochemore and Gad M. Landau and Mary Schaps},
  title = {{T}wo-dimensional {P}attern {M}atching with {R}otations},
  journal = {Theoretical Computer Science},
  year = {2004},
  volume = {314},
  pages = {173–187}
}

@inproceedings{Amir2000a,
  author = {A. Amir and A. Butman and M. Lewenstein},
  title = {Real Scaled Matching},
  booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {815--816}
}

@article{Amir2000b,
  author = {A. Amir and G. C\v{a}linescu},
  title = {Alphabet Independent and Dictionary Scaled Matching},
  journal = {J. Algorithms},
  year = {2000},
  volume = {36},
  number = {1},
  pages = {34--62}
}

@inproceedings{Amir2006,
  author = {A. Amir and E. Chencinski and C. S. Iliopoulos and T. Kopelowitz and H. Zhang},
  title = {Property matching and weighted matching},
  booktitle = {Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06)},
  year = {2006}
}

@inproceedings{Amir1996a,
  author = {A. Amir and G. C{\v{a}}linescu},
  title = {Alphabet Independent and Dictionary Scaled Matching},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {320--334}
}

@techreport{Amir1993b,
  author = {A. Amir and G. C{\v{a}}linescu},
  title = {Faster Scaled Matching},
  year = {1993},
  number = {GIT-CC-93-40}
}

@incollection{Amir1997c,
  author = {A. Amir and M. Farach},
  title = {Two dimensional matching},
  booktitle = {Pattern matching algorithms},
  publisher = {Oxford University Press},
  year = {1997},
  pages = {267--292}
}

@article{Amir1995,
  author = {A. Amir and M. Farach},
  title = {Efficient 2-dimensional approximate matching of half-rectangular figures},
  journal = {Inf. Comput.},
  year = {1995},
  volume = {118},
  number = {1},
  pages = {1--11}
}

@article{Amir1992c,
  author = {A. Amir and M. Farach},
  title = {Two-dimensional dictionary matching},
  journal = {Inf. Process. Lett.},
  year = {1992},
  volume = {44},
  number = {5},
  pages = {233--239}
}

@inproceedings{Amir1991a,
  author = {A. Amir and M. Farach},
  title = {Adaptative dictionary matching},
  booktitle = {Proceedings of the 32nd IEEE Annual Symposium on Foundations of Computer Science},
  publisher = {IEEE Computer Society Press},
  year = {1991},
  pages = {760--766}
}

@inproceedings{Amir1991b,
  author = {A. Amir and M. Farach},
  title = {Efficient 2-dimensional approximate matching of non-rectangular figures},
  booktitle = {Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1991},
  pages = {212--223}
}

@article{Amir1994c,
  author = {A. Amir and M. Farach and Z. Galil and R. Giancarlo and K. Park},
  title = {Fully dynamic dictionary matching},
  journal = {J. Comput. Syst. Sci.},
  year = {1994},
  volume = {49},
  number = {2},
  pages = {208--222}
}

@article{Amir1995a,
  author = {A. Amir and M. Farach and R. Idury and La Poutr{\'e}, J. and A. Sch{\"a}ffer},
  title = {Improved dynamic dictionary matching},
  journal = {Inf. Comput.},
  year = {1995},
  volume = {119},
  number = {2},
  pages = {258--282}
}

@inproceedings{Amir1993c,
  author = {A. Amir and M. Farach and R. Idury and La Poutr{\'e}, J. and A. Sch{\"a}ffer},
  title = {Improved dynamic dictionary matching},
  booktitle = {Proceedings of the 4th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1993},
  pages = {392--401}
}

@inproceedings{Amir1992d,
  author = {A. Amir and M. Farach and Y. Matias},
  title = {Efficient randomized dictionary matching algorithms},
  booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {664},
  pages = {262--275}
}

@article{Amir1994d,
  author = {A. Amir and M. Farach and S. Muthukrishnan},
  title = {Alphabet dependence in parameterized matching},
  journal = {Inf. Process. Lett.},
  year = {1994},
  volume = {49},
  number = {3},
  pages = {111--115}
}

@techreport{Amir1993d,
  author = {A. Amir and M. Farach and Y. Muthukrishnan},
  title = {Alphabet Dependence in Parametrized Matching},
  year = {1993},
  number = {GIT-CC-93-44}
}

@inproceedings{Amir2006a,
  author = {A. Amir and C. S. Iliopoulos and O. Kapah and E. Porat},
  title = {Approximate matching in weighted sequences},
  booktitle = {Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06)},
  publisher = {Springer Berlin / Heidelberg},
  year = {2006},
  volume = {4009 2006},
  pages = {365-376}
}

@article{Amir2000c,
  author = {A. Amir and D. Keselman and G. M. Landau and M. Lewenstein and N. Lewenstein and M. Rodeh},
  title = {Text Indexing and Dictionary Matching with One Error},
  journal = {J. Algorithms},
  year = {2000},
  volume = {37},
  number = {2},
  pages = {309--325}
}

@inproceedings{Amir1998b,
  author = {A. Amir and G. Landau and M. Lewenstein and N. Lewenstein},
  title = {Efficient Special Cases of Pattern Matching with Swaps},
  booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1998},
  number = {1448},
  pages = {209--220}
}

@article{Amir1998c,
  author = {A. Amir and G. Landau and M. Lewenstein and N. Lewenstein},
  title = {Efficient Special Cases of Pattern Matching with Swaps},
  journal = {Inf. Process. Lett.},
  year = {1998},
  volume = {68},
  number = {3},
  pages = {125--132}
}

@article{Amir1991c,
  author = {A. Amir and G. M. Landau},
  title = {Fast parallel and serial multidimensional approximate array matching},
  journal = {Theor. Comput. Sci.},
  year = {1991},
  volume = {81},
  number = {1},
  pages = {97--115}
}

@inproceedings{Amir2000d,
  author = {A. Amir and G. M. Landau and D. Sokol},
  title = {Inplace Run-Length \emph{2d} Compressed Search},
  booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {817--818}
}

@article{Amir1992e,
  author = {A. Amir and G. M. Landau and U. Vishkin},
  title = {Efficient pattern matching with scaling},
  journal = {J. Algorithms},
  year = {1992},
  volume = {13},
  number = {1},
  pages = {2--32}
}

@inproceedings{Amir1990,
  author = {A. Amir and G. M. Landau and U. Vishkin},
  title = {Efficient pattern matching with scaling},
  booktitle = {Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1990},
  pages = {344--457}
}

@article{Amir2000e,
  author = {A. Amir and M. Lewenstein and N. Lewenstein},
  title = {Pattern Matching in Hypertext},
  journal = {J. Algorithms},
  year = {2000},
  volume = {35},
  number = {1},
  pages = {82--99}
}

@inproceedings{Amir1997d,
  author = {A. Amir and M. Lewenstein and N. Lewenstein},
  title = {Pattern Matching In Hypertext},
  booktitle = {Proceedings of the 5th Workshop on Algorithms and Data Structures},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1272},
  pages = {160--173}
}

@inproceedings{Amir2000f,
  author = {A. Amir and M. Lewenstein and E. Porat},
  title = {Faster Algorithms for String Matching with \emph{k} Mismatches},
  booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {794--803}
}

@inproceedings{Anderson1994,
  author = {A. Anderson and T. Hagerup and J. Hastad and O. Petersson},
  title = {The complexity of searching a sorted array of strings},
  booktitle = {Proceedings of the 26th ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1994},
  pages = {317--325}
}

@article{Andersson1999,
  author = {A. Andersson and N. J. Larsson and K. Swanson},
  title = {Suffix Trees on Words},
  journal = {Algorithmica},
  year = {1999},
  volume = {23},
  number = {3},
  pages = {246--260}
}

@inproceedings{Andersson1996,
  author = {A. Andersson and N. J. Larsson and K. Swanson},
  title = {Suffix Trees on Words},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {102--115}
}

@inproceedings{Andersson1994,
  author = {A. Andersson and S. Nilsson},
  title = {Faster Searching in Tries and Quadtrees---An Analysis of Level Compression},
  booktitle = {Proceedings of the 2nd Annual European Symposium},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  volume = {855},
  pages = {82--93}
}

@article{Andersson1993,
  author = {A. Andersson and S. Nilsson},
  title = {Improved behavior of tries by adaptive branching},
  journal = {Inf. Process. Lett.},
  year = {1993},
  volume = {46},
  number = {6},
  pages = {295--300}
}

@inproceedings{Ando1998,
  author = {K. Ando and K. Iwasaki and M. Fuketa and J.-I. Aoe},
  title = {A fast morphological analysis using the extended {AC} machine for oriental languages},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'98},
  year = {1998},
  pages = {1--13},
  note = {Collaborative Report DC--98--06}
}

@inproceedings{Ando1996,
  author = {K. Ando and M. Shishibori and J.-I. Aoe},
  title = {An efficient multi-attribute pattern matching machine},
  booktitle = {Proceedings of the Prague Stringologic Club Workshop~'96},
  year = {1996},
  pages = {1--14},
  note = {Collaborative Report DC--96--10}
}

@mastersthesis{Andrade1993,
  author = {M. V. A. Andrade},
  title = {M{\'e}todos eficientes para reconhecimento de padr{\~o}es em Texto (in portuguese)},
  school = {UNICAMP, Campinas, Brazil},
  year = {1993}
}

@inproceedings{Andrejkov'a2000,
  author = {G. Andrejkov{\'a}},
  title = {The Set-Set closest common subsequence problem},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia},
  year = {2000},
  pages = {1--12},
  note = {Collaborative Report DC--2000--03}
}

@inproceedings{Andrejkov'a1999,
  author = {G. Andrejkov{\'a}},
  title = {The closest common subsequence problems},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'99},
  year = {1999},
  pages = {1--15},
  note = {Collaborative Report DC--99--05}
}

@inproceedings{Andrejkov'a1998,
  author = {G. Andrejkov{\'a}},
  title = {The longest restricted common subsequence problem},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'98},
  year = {1998},
  pages = {14--25},
  note = {Collaborative Report DC--98--06}
}

@article{Andrejkov'a1986,
  author = {G. Andrejkov{\'a}},
  title = {Systolic systems for the longest common subsequence problem},
  journal = {Computers and Artificial Intelligence},
  year = {1986},
  volume = {5},
  number = {3},
  pages = {199--212}
}

@article{Angell1993,
  author = {R. C. Angell and G. E. Freund and P. Willet},
  title = {Automatic spelling correction using a trigram measure},
  journal = {Inf. Process. Manage.},
  year = {1993},
  volume = {19},
  pages = {255--261}
}

@article{Angluin1980,
  author = {D. Angluin},
  title = {Finding patterns common to a set of strings},
  journal = {J. Comput. Syst. Sci.},
  year = {1980},
  volume = {21},
  number = {1},
  pages = {46--62}
}

@inproceedings{Angluin1979,
  author = {D. Angluin},
  title = {Finding patterns common to a set of strings},
  booktitle = {Proceedings of the 11th ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1979},
  pages = {130--141}
}

@inproceedings{Anson1997,
  author = {E. L. Anson and E. W. Myers},
  title = {{ReAligner}: {A} Program for Refining {DNA} Sequence Multi-Alignments},
  booktitle = {Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1997},
  pages = {9--16}
}

@inproceedings{Antoniou2006,
  author = {P. Antoniou and Jan Holub and C. S. Iliopoulos and B. Melichar and P. Peterlongo},
  title = {Finding Common Motifs with Gaps using Finite Automata},
  booktitle = {Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06)},
  publisher = {Springer Berlin / Heidelberg},
  year = {2006},
  volume = {4094 2006},
  pages = {69-77}
}

@inproceedings{Antoniou2006,
  author = {P. Antoniou and Jan Holub and C. S. Iliopoulos and B. Melichar and P. Peterlongo},
  title = {Finding Common Motifs with Gaps using Finite Automata},
  booktitle = {Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06)},
  publisher = {Springer Berlin / Heidelberg},
  year = {2006},
  volume = {4094 2006},
  pages = {69-77}
}

@article{Aoe1989,
  author = {J.-I. Aoe},
  title = {An efficient implementation of string pattern matching machines for a finite number of keywords},
  journal = {SIGIR Forum},
  year = {1989},
  pages = {22--33}
}

@article{Aoe1989a,
  author = {J.-I. Aoe},
  title = {An Efficient Implementation of Static String Pattern Matching Machines},
  journal = {IEEE Trans. Softw. Eng.},
  year = {1989},
  volume = {15},
  number = {8},
  pages = {1010--1016}
}

@article{Aoe1989b,
  author = {J.-I. Aoe},
  title = {An Efficient Digital Search Algorithm by Using a Double-Array Structure},
  journal = {IEEE Trans. Softw. Eng.},
  year = {1989},
  volume = {15},
  number = {9},
  pages = {1066--1077}
}

@article{Aoe1992,
  author = {J.-I Aoe and K. Morimoto and T. Sato},
  title = {An Efficient Implementation of Trie Structure},
  journal = {Softw. Pract. Exp.},
  year = {1992},
  volume = {22},
  number = {9},
  pages = {695--721}
}

@inproceedings{Aoe1985,
  author = {J.-I. Aoe and Y. Yamamoto and R. Shimada},
  title = {An efficient implementation of static string pattern matching machines},
  booktitle = {Proceedings of the 1st International Conference on Supercomputing},
  year = {1985},
  pages = {491--498}
}

@article{Aoe1984,
  author = {J.-I. Aoe and Y. Yamamoto and R. Shimada},
  title = {A method for improving string pattern matching machines},
  journal = {IEEE Trans. Softw. Eng.},
  year = {1984},
  volume = {10},
  number = {1},
  pages = {116--120}
}

@inproceedings{Aoe1988,
  author = {J.-I. Aoe and Y. Yasutome and T. Sato},
  title = {An efficient digital search algorithm by using a double-array structure},
  booktitle = {Proceedings of the 12th International Conference on Computer Software and Applications},
  year = {1988},
  pages = {472--479}
}

@incollection{Apostolico1998,
  author = {A. Apostolico},
  title = {General Pattern Matching},
  booktitle = {Algorithms and Theory of Computation Handbook},
  publisher = {CRC Press Inc.},
  year = {1998}
}

@incollection{Apostolico1997,
  author = {A. Apostolico},
  title = {On-line string searching},
  booktitle = {Pattern matching algorithms},
  publisher = {Oxford University Press},
  year = {1997},
  pages = {89--122}
}

@incollection{Apostolico1997a,
  author = {A. Apostolico},
  title = {String Editing and Longest Common Subsequences},
  booktitle = {Handbook of Formal Languages},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  volume = {2 Linear Modeling: Background and Application},
  pages = {361--398}
}

@article{Apostolico1993,
  author = {A. Apostolico},
  title = {Efficient {CRCW-PRAM} algorithms for universal substring searching},
  journal = {Theor. Comput. Sci.},
  year = {1993},
  volume = {108},
  number = {2},
  pages = {331--344}
}

@article{Apostolico1992,
  author = {A. Apostolico},
  title = {Fast parallel detection of squares in strings},
  journal = {Algorithmica},
  year = {1992},
  volume = {8},
  number = {4},
  pages = {285--319}
}

@techreport{Apostolico1990,
  author = {A. Apostolico},
  title = {Optimal parallel detection of squares in string},
  year = {1990},
  number = {CSD-TR-932 and CSD-TR-1012}
}

@article{Apostolico1987,
  author = {A. Apostolico},
  title = {Remark on the {Hsu-Du} new algorithm for the longest common subsequence problem},
  journal = {Inf. Process. Lett.},
  year = {1987},
  volume = {25},
  number = {4},
  pages = {235--236}
}

@article{Apostolico1986,
  author = {A. Apostolico},
  title = {Improving the worst-case performance of the {Hunt-Szymanski} strategy for the longest common subsequence of two strings},
  journal = {Inf. Process. Lett.},
  year = {1986},
  volume = {23},
  number = {2},
  pages = {63--69}
}

@techreport{Apostolico1986a,
  author = {A. Apostolico},
  title = {Parallel Log--Time Construction of Suffix Trees},
  year = {1986},
  number = {CSD-TR-632}
}

@incollection{Apostolico1985,
  author = {A. Apostolico},
  title = {The myriad virtues of suffix trees},
  booktitle = {Combinatorial Algorithms on Words},
  publisher = {Springer-Verlag, Berlin},
  year = {1985},
  volume = {12},
  pages = {85--96}
}

@article{Apostolico1984,
  author = {A. Apostolico},
  title = {On context-constrained squares and repetitions in a string},
  journal = {RAIRO Inform. Th{\'e}or.},
  year = {1984},
  volume = {18},
  number = {2},
  pages = {147--159}
}

@inproceedings{Apostolico1979,
  author = {A. Apostolico},
  title = {Linear Pattern Matching and Problems of Data Compression},
  booktitle = {IEEE International Symposium on Information Theory},
  year = {1979}
}

@incollection{Apostolico1997b,
  author = {A. Apostolico and M. J. Atallah},
  title = {Parallel computations of {Levenshtein} distances},
  booktitle = {Pattern matching algorithms},
  publisher = {Oxford University Press},
  year = {1997},
  pages = {143--184}
}

@article{Apostolico1990a,
  author = {A. Apostolico and M. J. Atallah and L. L. Larmore and S. McFaddin},
  title = {Efficient parallel algorithms for string editing and related problems},
  journal = {SIAM J. Comput.},
  year = {1990},
  volume = {19},
  number = {5},
  pages = {968--988}
}

@inproceedings{Apostolico1999,
  author = {A. Apostolico and M. E. Bock and S. Lonardi},
  title = {Linear Global Detectors of Redundant and Rare Substrings},
  booktitle = {Proceedings Data Compression Conference},
  publisher = {IEEE Computer Society Press},
  year = {1999},
  pages = {168--177}
}

@article{Apostolico2000,
  author = {A. Apostolico and M. E. Bock and S. Lonardi and X. Xu},
  title = {Efficient Detection of Unusual Words},
  journal = {J. Comput. Bio.},
  year = {2000},
  volume = {7},
  number = {1/2},
  pages = {71--94}
}

@inproceedings{Apostolico1998a,
  author = {A. Apostolico and M. E. Bock and X. Xu},
  title = {Annotated Statistical Indices for Sequence Analysis},
  booktitle = {Sequences},
  publisher = {IEEE Computer Society Press},
  year = {1998},
  pages = {215--229}
}

@incollection{Apostolico1997c,
  author = {A. Apostolico and D. Breslauer},
  title = {Of Periods, Quasiperiods, Repetitions and Covers},
  booktitle = {Structures in Logic and Computer Science, A Selection of Essays in honor of A. Ehrenfeucht},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1261},
  pages = {236--248}
}

@article{Apostolico1996,
  author = {A. Apostolico and D. Breslauer},
  title = {An optimal {\emph{O(\log \log N)}} time parallel algorithm for detecting all squares in a string},
  journal = {SIAM J. Comput.},
  year = {1996},
  volume = {25},
  number = {6},
  pages = {1318--1331}
}

@inproceedings{Apostolico1992a,
  author = {A. Apostolico and D. Breslauer},
  title = {Optimal parallel algorithms for periods, palindromes and squares},
  booktitle = {Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {621},
  pages = {296--307}
}

@techreport{Apostolico1992b,
  author = {A. Apostolico and D. Breslauer},
  title = {An optimal {\emph{O(\log n)}} time parallel algorithm for detecting all squares in a string},
  year = {1992},
  number = {CUCS-040-92}
}

@article{Apostolico1995,
  author = {A. Apostolico and D. Breslauer and Z. Galil},
  title = {Parallel detection of all palindromes in a string},
  journal = {Theor. Comput. Sci.},
  year = {1995},
  volume = {141},
  number = {1--2},
  pages = {163--173}
}

@inproceedings{Apostolico1994,
  author = {A. Apostolico and D. Breslauer and Z. Galil},
  title = {Parallel detection of all palindromes in a string},
  booktitle = {Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {775},
  pages = {497--506}
}

@incollection{Apostolico1992c,
  author = {A. Apostolico and D. Breslauer and Z. Galil},
  title = {Optimal parallel algorithms for periods, palindromes and squares},
  booktitle = {Proceedings of the 19th International Colloquium on Automata, Languages and Programming},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  pages = {296--307}
}

@article{Apostolico2000a,
  author = {A. Apostolico and V. E. Brimkov},
  title = {Fibonacci arrays and their two-dimensional repetitions},
  journal = {Theor. Comput. Sci.},
  year = {2000},
  volume = {237},
  number = {1--2},
  pages = {263--273}
}

@article{Apostolico1992d,
  author = {A. Apostolico and S. Browne and C. Guerra},
  title = {Fast linear-space computations of longest common subsequences},
  journal = {Theor. Comput. Sci.},
  year = {1992},
  volume = {92},
  number = {1},
  pages = {3--17}
}

@article{Apostolico1995a,
  author = {A. Apostolico and M. Crochemore},
  title = {Fast Parallel {Lyndon} Factorization with Applications},
  journal = {Math. Syst. Theory},
  year = {1995},
  volume = {28},
  number = {2},
  pages = {89--108}
}

@article{Apostolico1991,
  author = {A. Apostolico and M. Crochemore},
  title = {Optimal canonization of all substrings of a string},
  journal = {Inf. Comput.},
  year = {1991},
  volume = {95},
  number = {1},
  pages = {76--95}
}

@techreport{Apostolico1990b,
  author = {A. Apostolico and M. Crochemore},
  title = {Fast parallel {Lyndon} factorization with applications},
  year = {1990},
  number = {CSD-TR-931}
}

@techreport{Apostolico1989,
  author = {A. Apostolico and M. Crochemore},
  title = {Optimal canonization of all substrings of a string},
  year = {1989},
  number = {LITP 89.75}
}

@article{Apostolico1993a,
  author = {A. Apostolico and A. Ehrenfeucht},
  title = {Efficient detection of quasiperiodicities in strings},
  journal = {Theor. Comput. Sci.},
  year = {1993},
  volume = {119},
  number = {2},
  pages = {247--265}
}

@techreport{Apostolico1990c,
  author = {A. Apostolico and A. Ehrenfeucht},
  title = {Efficient detection of quasiperiodicities in strings},
  year = {1990},
  number = {90.5}
}

@article{Apostolico1991a,
  author = {A. Apostolico and M. Farach and C. S. Iliopoulos},
  title = {Optimal superprimitivity testing for strings},
  journal = {Inf. Process. Lett.},
  year = {1991},
  volume = {39},
  number = {1},
  pages = {17--20}
}

@article{Apostolico1987a,
  author = {A. Apostolico and A. Fraenkel},
  title = {Robust Transmission of Unbounded Strings Using {F}ibonacci Representations},
  journal = {IEEE Trans. Inf. Theory},
  year = {1987},
  volume = {33},
  number = {2},
  pages = {238--245}
}

@article{Apostolico1998b,
  author = {A. Apostolico and R. Giancarlo},
  title = {Sequence alignment in molecular biology},
  journal = {J. Comput. Bio.},
  year = {1998},
  volume = {5},
  number = {2},
  pages = {173--196}
}

@article{Apostolico1986b,
  author = {A. Apostolico and R. Giancarlo},
  title = {The {Boyer-Moore-Galil} string searching strategies revisited},
  journal = {SIAM J. Comput.},
  year = {1986},
  volume = {15},
  number = {1},
  pages = {98--105}
}

@article{Apostolico1984a,
  author = {A. Apostolico and R. Giancarlo},
  title = {Pattern matching implementation of a fast test for unique decipherability},
  journal = {Inf. Process. Lett.},
  year = {1984},
  volume = {18},
  number = {3},
  pages = {155--158}
}

@article{Apostolico1987b,
  author = {A. Apostolico and C. Guerra},
  title = {The longest common subsequence problem revisited},
  journal = {Algorithmica},
  year = {1987},
  volume = {2},
  pages = {315--336}
}

@inproceedings{Apostolico1985a,
  author = {A. Apostolico and C. Guerra},
  title = {A fast linear-space algorithm for computing longest common subsequences},
  booktitle = {Proceedings of the 23rd Allerton Conference},
  year = {1985},
  pages = {?--?}
}

@article{Apostolico1988,
  author = {A. Apostolico and C. Iliopoulos and G. M. Landau and B. Schieber and U. Vishkin},
  title = {Parallel construction of a suffix tree with applications},
  journal = {Algorithmica},
  year = {1988},
  volume = {3},
  pages = {347--365}
}

@article{Apostolico1999a,
  author = {A. Apostolico and G. M. Landau and S. Skiena},
  title = {Matching for Run-Length Encoded Strings},
  journal = {J. Complexity},
  year = {1999},
  volume = {15},
  pages = {4--16}
}

@inproceedings{Apostolico1997d,
  author = {A. Apostolico and G. M. Landau and S. Skiena},
  title = {Matching for Run-Length Encoded Strings},
  booktitle = {Proceedings Complexity and Compression of SEQUENCES97},
  year = {1997},
  pages = {137--146}
}

@inproceedings{Apostolico2000b,
  author = {A. Apostolico and S. Lonardi},
  title = {Compression of Biological Sequences by Greedy Off-Line Textual Substitution},
  booktitle = {Proceedings Data Compression Conference},
  publisher = {IEEE Computer Society Press},
  year = {2000},
  pages = {143--152}
}

@article{Apostolico2000c,
  author = {A. Apostolico and S. Lonardi},
  title = {Off-Line Compression by Greedy Textual Substitution},
  journal = {?},
  year = {2000},
  volume = {88},
  number = {11},
  pages = {1733--1744}
}

@techreport{Apostolico1999b,
  author = {A. Apostolico and S. Lonardi},
  title = {Compression of Biological Sequences by Greedy Off-Line Textual Substitution},
  year = {1999},
  number = {TR-99-037}
}

@article{Apostolico1985b,
  author = {A. Apostolico and F. P. Preparata},
  title = {Structural properties of the string statistics problem},
  journal = {J. Comput. Syst. Sci.},
  year = {1985},
  volume = {31},
  number = {3},
  pages = {394--411}
}

@techreport{Apostolico1985c,
  author = {A. Apostolico and F. P. Preparata},
  title = {Data structures and algorithms for the string statistics problem},
  year = {1985},
  number = {CSD-TR-547}
}

@article{Apostolico1983,
  author = {A. Apostolico and F. P. Preparata},
  title = {Optimal off-line detection of repetitions in a string},
  journal = {Theor. Comput. Sci.},
  year = {1983},
  volume = {22},
  number = {3},
  pages = {297--315}
}

@article{Apostolico1992e,
  author = {A. Apostolico and W. Szpankowski},
  title = {Self-alignment in words and their applications},
  journal = {J. Algorithms},
  year = {1992},
  volume = {13},
  number = {3},
  pages = {446--467}
}

@article{Appel1988,
  author = {A. W. Appel and G. J. Jacobson},
  title = {The world's fastest scrabble program},
  journal = {Commun. ACM},
  year = {1988},
  volume = {31},
  number = {5},
  pages = {572--%78}
}

@inproceedings{Ara'ujo1997,
  author = {M.D. Ara{\'u}jo and G. Navarro and N. Ziviani},
  title = {Large Text Searching Allowing Errors},
  booktitle = {Proceedings of the 4th South American Workshop on String Processing},
  publisher = {Carleton University Press},
  year = {1997},
  pages = {2--20}
}

@inproceedings{Arcangeli1993,
  author = {J.-P. Arcangeli and M. Crochemore and J.-N. Hourcastagnou and J.-E. Pin},
  title = {Compression for an effective management of telemetry data},
  booktitle = {Proceedings of the 2nd International Symposium on Ground Data Systems for Space Operations},
  publisher = {Jet Propulsion Laboratory Publications},
  year = {1993},
  pages = {823--830}
}

@inproceedings{Arge1997,
  author = {L. Arge and P. Ferragina and R. Grossi and J.S. Vitter},
  title = {On Sorting Strings in External Memory (Extended Abstract)},
  booktitle = {Proceedings of the 29th ACM Symposium on the Theory of Computing},
  year = {1997},
  pages = {540--548}
}

@article{Argos1987,
  author = {P. Argos},
  title = {A sensitive procedure to compare amino acid sequences},
  journal = {J. Mol. Biol.},
  year = {1987},
  volume = {193},
  pages = {385--396}
}

@article{Argos1990,
  author = {P. Argos and M. Vingron},
  title = {Sensitivity comparison of protein amino acid sequences},
  journal = {Methods Enzymol.},
  year = {1990},
  volume = {188},
  pages = {352--365}
}

@article{Argos1991,
  author = {P. Argos and M. Vingron and G. Vogt},
  title = {Protein sequence comparison: methods and significance},
  journal = {Protein Engineering},
  year = {1991},
  volume = {4},
  pages = {375--383}
}

@inproceedings{Arikat2005,
  author = {F. Arikat and A. Bakalis and M. Christodoulakis and C. S. Iliopoulos and L. Mouchard},
  title = {Experimental Results in Pattern Matching on Weighted Sequences},
  booktitle = {Proceedings of the International Conference on Numerical Analysis and Applied Mathematics ICNAAM'05)},
  year = {2005}
}

@inproceedings{Arikat2005,
  author = {F. Arikat and A. Bakalis and M. Christodoulakis and C. S. Iliopoulos and L. Mouchard},
  title = {Experimental Results in Pattern Matching on Weighted Sequences},
  booktitle = {Proceedings of the International Conference on Numerical Analysis and Applied Mathematics ICNAAM'05)},
  year = {2005}
}

@article{Arikati2001,
  author = {S. R. Arikati and A. Dessmark and A. Lingas and M. V. Marathe},
  title = {Approximation Algorithms for Maximum Two-Dimensional Pattern Matching},
  journal = {Theor. Comput. Sci.},
  year = {2001},
  volume = {255},
  number = {1--2},
  pages = {51--62}
}

@inproceedings{Arikati1996,
  author = {S. R. Arikati and A. Dessmark and A. Lingas and M. V. Marathe},
  title = {Approximation Algorithms for Maximum Two-Dimensional Pattern Matching},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {348--360}
}

@article{Arikawa1981,
  author = {S. Arikawa},
  title = {One-way sequential search systems and their powers},
  journal = {Bull. Math. Stat.},
  year = {1981},
  volume = {19},
  number = {3,4},
  pages = {69--83}
}

@article{Arikawa1984,
  author = {S. Arikawa and T. Shinohara},
  title = {A run-time efficient realization of Aho-Corasick pattern matching machines},
  journal = {New Gener. Comput.},
  year = {1984},
  volume = {2},
  pages = {171--186}
}

@article{Arikawa1982,
  author = {S. Arikawa and T. Shinohara and S. Shiraishi and Y. Tamakoshi},
  title = {An information system for researchers use},
  journal = {Bull. Inform. Cybern.},
  year = {1982},
  volume = {20},
  number = {1,2},
  pages = {97--114}
}

@inproceedings{Arimura1994,
  author = {H. Arimura and T. Shinohara and S. Otsuki},
  title = {Finding minimal generalizations for unions of pattern languages and its application to inductive inference fom positive data},
  booktitle = {Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {775},
  pages = {649--660}
}

@article{Arimura1992,
  author = {H. Arimura and T. Shinohara and S. Otsuki},
  title = {Polynomial time inference of unions of two tree pattern languages},
  journal = {IEICE Trans. Inform. Syst. D},
  year = {1992},
  volume = {E75},
  pages = {426--434}
}

@article{Arita1998,
  author = {T. Arita and M. Shishibori and J.-I. Aoe},
  title = {An efficient algorithm for full text retrieval for multiple keywords},
  journal = {Inf. Sci.},
  year = {1998},
  volume = {104},
  number = {3--4},
  pages = {345--363}
}

@inproceedings{Armen1996,
  author = {C. Armen and C. Stein},
  title = {Algorithm for the Shortest Superstring Problem},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {87--101 }
}

@article{Armen1996a,
  author = {C. Armen and C. Stein},
  title = {Short superstrings and the structure of overlapping strings},
  journal = {J. Comput. Bio.},
  year = {1996},
  volume = {2},
  number = {2},
  pages = {307--332}
}

@inproceedings{Armen1995,
  author = {C. Armen and C. Stein},
  title = {Improved length for the shortest superstring problem},
  booktitle = {Proceedings of the 4th Workshop on Algorithms and Data Structures},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  number = {955},
  pages = {494--505}
}

@article{Arnold1980,
  author = {D. B. Arnold and M. R. Sleep},
  title = {Uniform random generation of balanced parenthesis strings},
  journal = {ACM Trans. Program. Lang. Syst.},
  year = {1980},
  volume = {2},
  pages = {122--128}
}

@article{Arratia1990,
  author = {R. Arratia and L. Gordon and M. S. Waterman},
  title = {The {Erd{\"o}s-R{\'e}nyi} law in distribution, for coin tossing and sequence matching},
  journal = {Ann. Stat.},
  year = {1990},
  volume = {18},
  pages = {539--570}
}

@article{Arratia1986,
  author = {R. Arratia and L. Gordon and M. S. Waterman},
  title = {An extreme value theory for sequence matching},
  journal = {Ann. Stat.},
  year = {1986},
  volume = {14},
  pages = {971--993}
}

@inproceedings{Arratia1996,
  author = {R. Arratia and G. Reinert},
  title = {Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {209--219}
}

@article{Arratia1994,
  author = {R. Arratia and M. S. Waterman},
  title = {A phase transition for the score in matching random sequences allowing deletions},
  journal = {Ann. Appl. Probab.},
  year = {1994},
  volume = {4},
  number = {1},
  pages = {200--225}
}

@article{Arratia1989,
  author = {R. Arratia and M. S. Waterman},
  title = {The {Erd{\"o}s-R{\'e}nyi} strong law for pattern matching with a given proportion of mismatches},
  journal = {Ann. Probab.},
  year = {1989},
  volume = {17},
  pages = {1152--1169}
}

@article{Arratia1985,
  author = {R. Arratia and M. S. Waterman},
  title = {Critical phenomena in sequence matching},
  journal = {Ann. Probab.},
  year = {1985},
  volume = {13},
  number = {4},
  pages = {1236--1249}
}

@inproceedings{Arroyuelo2006,
  author = {D. Arroyuelo and G. Navarro and K. Sadakane},
  title = {Reducing the Space Requirement of {LZ}-index},
  booktitle = {Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006)},
  year = {2006},
  pages = {319--330}
}

@article{Arslan2000,
  author = {A. N. Arslan and O. Egecioglu},
  title = {Efficient Algorithms For Normalized Edit Distance},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {3--20}
}

@inproceedings{Arvestad1997,
  author = {L. Arvestad},
  title = {Aligning coding {DNA} in the presence of frame-shift errors},
  booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1264},
  pages = {180--190}
}

@article{Ashdown1985,
  author = {I. Ashdown},
  title = {Parallel pattern matching and FGREP},
  journal = {Dr. Dobbs J.},
  year = {1985},
  volume = {10},
  number = {9},
  pages = {46--67}
}

@article{Atallah1999,
  author = {M. J. Atallah and Y. G{\'e}nin and W. Szpankowski},
  title = {Structural Pattern Analysis},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1999},
  volume = {21},
  number = {7},
  pages = {614--627}
}

@inproceedings{Atallah1996,
  author = {M. J. Atallah and Y. G{\'e}nin and W. Szpankowski},
  title = {Pattern Matching Image Compression},
  booktitle = {Proceedings of the 6th Data Compression Conference},
  publisher = {IEEE Computer Society Press},
  year = {1996},
  pages = {421}
}

@article{Atallah1993,
  author = {M. J. Atallah and P. Jacquet and W. Szpankowski},
  title = {A probabilistic approach to pattern matching with mismatches},
  journal = {Random Struct. Algorithms},
  year = {1993},
  volume = {4},
  pages = {191--213}
}

@inproceedings{Atallah1992,
  author = {M. J. Atallah and P. Jacquet and W. Szpankowski},
  title = {Pattern matching with mismatches: a probabilistic analysis and a randomized algorithm},
  booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {664},
  pages = {27--40}
}

@techreport{Atallah1989,
  author = {M. J. Atallah and S. R. Kosaraju and L. L. Larmore and G. L. Miller and S. H. Teng},
  title = {Constructing trees in parallel},
  year = {1989},
  number = {CSD-TR-883}
}

@book{Attwood1999,
  author = {T. K. Attwood and D. J. Parry-Smith},
  title = {Introduction to bioinformatics},
  publisher = {Addison Wesley Longman},
  year = {1999}
}

@article{Audoire1995,
  author = {L. Audoire and J.-J. Codani and D. Lavenier and P. Quinton},
  title = {{Machines Sp\'ecialis\'ees pour la Comparaison de S\'equences Biologiques}},
  journal = {Tech. Sci. Inform.},
  year = {1995},
  volume = {14},
  number = {1}
}

@article{Awerbuch1998,
  author = {B. Awerbuch and B. Berger and L. Cowen and D. Peleg },
  title = {Near-Linear Time Construction of Sparse Neighborhood Covers },
  journal = {SIAM J. Comput.},
  year = {1998},
  volume = {28},
  number = {1},
  pages = {263--277}
}

@book{Baase1988,
  author = {S. Baase},
  title = {Computer algorithms -- Introduction to design and analysis},
  publisher = {Addison-Wesley},
  year = {1988}
}

@inproceedings{Baba2002,
  author = {K. Baba and A. Shinohara and M. Takeda and S. Inenaga and S. Arikawa},
  title = {A Note on Randomized Algorithm for String Matching with Mismatches},
  booktitle = {Proceedings of the Prague Stringology Conference~'02},
  year = {2002},
  pages = {9--17},
  note = {Research Report DC--2002--03}
}

@inproceedings{Backofen2000,
  author = {R. Backofen},
  title = {An Upper Bound for Number of Contacts in the {HP}-Model on the {Face-Centered-Cubic Lattice (FCC)}},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {277--292}
}

@article{Bacon1990,
  author = {D. J. Bacon and W. F. Anderson},
  title = {Multiple sequence comparison},
  journal = {Methods Enzymol.},
  year = {1990},
  volume = {183},
  pages = {438--447}
}

@article{Bacon1986,
  author = {D. J. Bacon and W. F. Anderson},
  title = {Multiple sequence comparison},
  journal = {J. Mol. Biol.},
  year = {1986},
  volume = {191},
  pages = {153--161}
}

@inproceedings{Baeza-Yates1996,
  author = {R. A. Baeza-Yates},
  title = {A unified view to pattern-matching problems},
  booktitle = {Proceedings PANEL'96},
  year = {1996}
}

@inproceedings{Baeza-Yates1996a,
  author = {R. A. Baeza-Yates},
  title = {A unified view of string matching algorithms},
  booktitle = {Proceedings SOFSEM'96: Theory and Practice of Informatics},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1175},
  pages = {1--15}
}

@inproceedings{Baeza-Yates1992,
  author = {R. A. Baeza-Yates},
  title = {Text retrieval: theory and practice},
  booktitle = {Proceedings of the 12th IFIP World Computer Congress},
  publisher = {North-Holland},
  year = {1992},
  pages = {465--476}
}

@article{Baeza-Yates1992a,
  author = {R. A. Baeza-Yates},
  title = {Notes on a Very Fast Substring Search Algorithm},
  journal = {Commun. ACM},
  year = {1992},
  volume = {35},
  number = {4},
  pages = {132}
}

@article{Baeza-Yates1991,
  author = {R. A. Baeza-Yates},
  title = {Searching subsequences},
  journal = {Theor. Comput. Sci.},
  year = {1991},
  volume = {78},
  number = {2},
  pages = {363--376}
}

@inproceedings{Baeza-Yates1989,
  author = {R. A. Baeza-Yates},
  title = {String searching algorithms revisited},
  booktitle = {Proceedings of the 1st Workshop on Algorithms and Data Structures},
  publisher = {Springer-Verlag, Berlin},
  year = {1989},
  number = {382},
  pages = {75--96}
}

@inproceedings{Baeza-Yates1989a,
  author = {R. A. Baeza-Yates},
  title = {The Subsequence Graph of a Text},
  booktitle = {Proceedings of the 3rd Theory and Practice of Software Development},
  publisher = {Springer-Verlag, Berlin},
  year = {1989},
  number = {351},
  pages = {104--118}
}

@article{Baeza-Yates1989b,
  author = {R. A. Baeza-Yates},
  title = {Improved string searching},
  journal = {Softw. Pract. Exp.},
  year = {1989},
  volume = {19},
  number = {3},
  pages = {257--271}
}

@phdthesis{Baeza-Yates1989c,
  author = {R. A. Baeza-Yates},
  title = {Efficient text searching},
  school = {Department of Computer Science, University of Waterloo, Ontario},
  year = {1989}
}

@article{Baeza-Yates1989d,
  author = {R. A. Baeza-Yates},
  title = {Algorithms for string searching: a survey},
  journal = {SIGIR Forum},
  year = {1989},
  volume = {23},
  number = {3,4},
  pages = {34--58}
}

@techreport{Baeza-Yates1988,
  author = {R. A. Baeza-Yates},
  title = {The subsequence graph of a text},
  year = {1988},
  number = {CS-88-34}
}

@techreport{Baeza-Yates1987,
  author = {R. A. Baeza-Yates},
  title = {On the average case on string matching algorithms},
  year = {1987},
  number = {CS-87-66}
}

@article{Baeza-Yates1996b,
  author = {R. A. Baeza-Yates and E. F. Barbosa and N. Ziviani},
  title = {Hierarchies of Indices for Text Searching},
  journal = {Inf. Syst.},
  year = {1996},
  volume = {21},
  number = {6},
  pages = {497--514}
}

@inproceedings{Baeza-Yates1996c,
  author = {R. A. Baeza-Yates and R. Gavald{\`a} and G. Navarro},
  title = {Bounding the expected length of longest common subsequences and forests},
  booktitle = {Proceedings of the 3rd South American Workshop on String Processing},
  publisher = {Carleton University Press},
  year = {1996},
  pages = {1--15}
}

@article{Baeza-Yates1999,
  author = {R. A. Baeza-Yates and R. Gavald{\`a} and G. Navarro and R. Scheihing},
  title = {Bounding the expected length of longest common subsequences and forests},
  journal = {Theor. Comput. Syst.},
  year = {1999},
  volume = {32},
  number = {4},
  pages = {435--452}
}

@article{Baeza-Yates1996d,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {Fast text searching for regular expressions or automaton searching on tries},
  journal = {J. Assoc. Comput. Mach.},
  year = {1996},
  volume = {43},
  number = {6},
  pages = {915--936}
}

@article{Baeza-Yates1994,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {Fast string matching with mismatches},
  journal = {Inf. Comput.},
  year = {1994},
  volume = {108},
  number = {2},
  pages = {187--199}
}

@article{Baeza-Yates1992b,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {A new approach to text searching},
  journal = {Commun. ACM},
  year = {1992},
  volume = {35},
  number = {10},
  pages = {74--82}
}

@techreport{Baeza-Yates1990,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {All-against-all sequence matching},
  year = {1990}
}

@inproceedings{Baeza-Yates1989e,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {Efficient text searching of regular expressions},
  booktitle = {Proceedings of the 16th International Colloquium on Automata, Languages and Programming},
  publisher = {Springer-Verlag, Berlin},
  year = {1989},
  number = {372},
  pages = {46--62}
}

@inproceedings{Baeza-Yates1989f,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {A new approach to text searching},
  booktitle = {Proceedings of the 12th International Conference on Research and Development in Information Retrieval},
  publisher = {ACM Press},
  year = {1989},
  pages = {168--175}
}

@techreport{Baeza-Yates1989g,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {{Boyer-Moore} automata},
  year = {1989}
}

@techreport{Baeza-Yates1988a,
  author = {R. A. Baeza-Yates and G. H. Gonnet},
  title = {New algorithm for pattern matching with and without mismatches},
  year = {1988},
  number = {CS-88-37}
}

@inproceedings{Baeza-Yates1990a,
  author = {R. A. Baeza-Yates and G. H. Gonnet and M. R{\'e}gnier},
  title = {Analysis of {Boyer-Moore} type string searching algorithms},
  booktitle = {Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1990},
  pages = {328--343}
}

@article{Baeza-Yates1999a,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {Faster Approximate String Matching},
  journal = {Algorithmica},
  year = {1999},
  volume = {23},
  number = {2},
  pages = {127--158}
}

@inproceedings{Baeza-Yates1998,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {Fast Two-Dimensional Approximate Pattern Matching},
  booktitle = {Proceedings of the 3rd Latin American Symposium},
  publisher = {Springer-Verlag, Berlin},
  year = {1998},
  number = {1380},
  pages = {341--351}
}

@techreport{Baeza-Yates1998a,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {New and faster filters for multiple approximate string matching},
  year = {1998},
  number = {TR/DCC-98-10}
}

@inproceedings{Baeza-Yates1997,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {Multiple Approximate String Matching},
  booktitle = {Proceedings of the 5th Workshop on Algorithms and Data Structures},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1272},
  pages = {174--184}
}

@inproceedings{Baeza-Yates1997a,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {Block-addressing indices for approximate text retrieval},
  booktitle = {Proceedings ACM CIKM'97},
  year = {1997},
  pages = {1--8}
}

@inproceedings{Baeza-Yates1996e,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {A faster algorithm for approximate string matching},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {1--23}
}

@inproceedings{Baeza-Yates1996f,
  author = {R. A. Baeza-Yates and G. Navarro},
  title = {A fast heuristic for approximate string matching},
  booktitle = {Proceedings of the 3rd South American Workshop on String Processing},
  publisher = {Carleton University Press},
  year = {1996},
  pages = {47--63}
}

@article{Baeza-Yates1996g,
  author = {R. A. Baeza-Yates and C. H. Perleberg},
  title = {Fast and practical approximate string matching},
  journal = {Inf. Process. Lett.},
  year = {1996},
  volume = {59},
  number = {1},
  pages = {21--27}
}

@inproceedings{Baeza-Yates1992c,
  author = {R. A. Baeza-Yates and C. H. Perleberg},
  title = {Fast and practical approximate string matching},
  booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {664},
  pages = {185--192}
}

@article{Baeza-Yates1993,
  author = {R. A. Baeza-Yates and M. R{\'e}gnier},
  title = {Fast two-dimensional pattern matching},
  journal = {Inf. Process. Lett.},
  year = {1993},
  volume = {45},
  number = {1},
  pages = {51--57}
}

@article{Baeza-Yates1992d,
  author = {R. A. Baeza-Yates and M. R{\'e}gnier},
  title = {Average running time of the {Boyer-Moore-Horspool} algorithm},
  journal = {Theor. Comput. Sci.},
  year = {1992},
  volume = {92},
  number = {1},
  pages = {19--31}
}

@inproceedings{Baeza-Yates1990b,
  author = {R. A. Baeza-Yates and M. R{\'e}gnier},
  title = {Fast algorithms for two-dimensional and multiple pattern matching},
  booktitle = {Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory},
  publisher = {Springer-Verlag, Berlin},
  year = {1990},
  number = {447},
  pages = {332--347}
}

@inproceedings{Baeza-Yates1995,
  author = {R. A. Baeza-Yates and R. Scheihing},
  title = {New lower bounds for the expected length of longest common subsequences and forests},
  booktitle = {Proceedings of the 15th International Conference of the Chilean Computer Science Society},
  year = {1995},
  pages = {48--58}
}

@article{Baeza-Yates1994a,
  author = {R.A. Baeza-Yates and C. Choffrut and G.H. Gonnet},
  title = {On {Boyer-Moore} automata},
  journal = {Algorithmica},
  year = {1994},
  volume = {12},
  number = {4/5},
  pages = {268--292}
}

@article{Baeza-Yates1996h,
  author = {R.A. Baeza-Yates and L.O. Fuentes},
  title = {A framework to animate string algorithms},
  journal = {Inf. Process. Lett.},
  year = {1996},
  volume = {59},
  number = {5},
  pages = {241--244}
}

@article{Baeza-Yates2000,
  author = {R. Baeza-Yates and G. Navarro},
  title = {New Models and Algorithms for Multidimensional Approximate Pattern Matching},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {21--49}
}

@inproceedings{Baeza-Yates1994b,
  author = {R. A. {Baeza-Yates} and W. Cunto and U. Manber and S. Wu},
  title = {Proximity Matching Using Fixed-Queries Trees},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {198--212}
}

@article{Bafna1997,
  author = {V. Bafna and E. L. Lawler and P. A. Pevzner},
  title = {Approximation Algorithms for Multiple Sequence Aligmnent},
  journal = {Theor. Comput. Sci.},
  year = {1997},
  volume = {182},
  number = {1--2},
  pages = {233--244}
}

@inproceedings{Bafna1994,
  author = {V. Bafna and E. L. Lawler and P. A. Pevzner},
  title = {Approximation Algorithms for Multiple Sequence Aligmnent},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {43--53}
}

@inproceedings{Bafna1995,
  author = {V. Bafna and S. Muthukrishnan and R. Ravi},
  title = {Computing similarity between {RNA} strings},
  booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  number = {937},
  pages = {1--16}
}

@article{Bafna1996,
  author = {V. Bafna and P. Pevzner},
  title = {Genome rearrangments and sorting by reversal},
  journal = {SIAM J. Comput.},
  year = {1996},
  volume = {25},
  number = {2},
  pages = {272--289}
}

@article{Bafna1998,
  author = {V. Bafna and P. A. Pevzner},
  title = {Sorting by Transpositions},
  journal = {SIAM J. Discret. Math.},
  year = {1998},
  volume = {11},
  number = {2},
  pages = {224--240}
}

@inproceedings{Bafna1993,
  author = {V. Bafna and P. A. Pevzner},
  title = {Genome Rearrangements and Sorting by Reversals},
  booktitle = {Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science},
  publisher = {IEEE Computer Society Press},
  year = {1993},
  pages = {148--157}
}

@article{Bailey1980,
  author = {T. A. Bailey and R. G. Dromey},
  title = {Fast string searching by finding subkeys in subtext},
  journal = {Inf. Process. Lett.},
  year = {1980},
  volume = {11},
  number = {3},
  pages = {130--133}
}

@article{Bains1989,
  author = {W. Bains},
  title = {{MULTAN} (2), A multiple string alignment program for nucleic acids and proteins},
  journal = {Comput. Appl. Biosci.},
  year = {1989},
  volume = {5},
  pages = {51--52}
}

@article{Bains1986,
  author = {W. Bains},
  title = {{MULTAN}: a program to align multiple {DNA} sequences},
  journal = {Nucleic Acids Res.},
  year = {1986},
  volume = {14},
  pages = {159--177}
}

@inproceedings{Bakalis2006,
  author = {A. Bakalis and C. S. Iliopoulos and S. Sioutas and K. Tsichlas},
  title = {Algorithms for Bitmasking Strings},
  booktitle = {Proceedings of International Conference of Computational Methods in Sciences and Engineering},
  year = {2006}
}

@inproceedings{Bakalis2006,
  author = {A. Bakalis and C. S. Iliopoulos and S. Sioutas and K. Tsichlas},
  title = {Algorithms for Bitmasking Strings},
  booktitle = {Proceedings of International Conference of Computational Methods in Sciences and Engineering},
  year = {2006}
}

@article{Baker1997,
  author = {B. S. Baker},
  title = {Parameterized duplication in strings: algorithms and an application to software maintenance},
  journal = {SIAM J. Comput.},
  year = {1997},
  volume = {26},
  number = {5},
  pages = {1343--1362}
}

@article{Baker1996,
  author = {B. S. Baker},
  title = {Parameterized pattern matching: algorithms and applications},
  journal = {J. Comput. Syst. Sci.},
  year = {1996},
  volume = {52},
  number = {1},
  pages = {28--42}
}

@inproceedings{Baker1995,
  author = {B. S. Baker},
  title = {Parameterized pattern matching by {Boyer-Moore-type} algorithms},
  booktitle = {Proceedings of the 6th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1995},
  pages = {541--550}
}

@inproceedings{Baker1993,
  author = {B. S. Baker},
  title = {A theory of parameterized pattern matching: algorithms and applications},
  booktitle = {Proceedings of the 25th ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1993},
  pages = {71--80}
}

@inproceedings{Baker1992,
  author = {B. S. Baker},
  title = {A program for identifying duplicated code},
  booktitle = {Proceedings of the 24th Symposium on the Interface: Computer Science and Statistics},
  publisher = {ACM Press},
  year = {1992},
  pages = {18--21}
}

@inproceedings{Baker1998,
  author = {B. S. Baker and R. Giancarlo},
  title = {Longest Common Subsequence from Fragments via Sparse Dynamic Programming},
  booktitle = {Proceedings of the 6th Annual European Symposium},
  publisher = {Springer-Verlag, Berlin},
  year = {1998},
  number = {1461},
  pages = {79--90}
}

@article{Baker1989,
  author = {K. A. Baker and G. F. McNulty and W. Taylor},
  title = {Growth problems for avoidable words},
  journal = {Theor. Comput. Sci.},
  year = {1989},
  volume = {69},
  number = {3},
  pages = {319--345}
}

@article{Baker1978,
  author = {T. P. Baker},
  title = {A technique for extending rapid exact-match string matching to arrays of more than one dimension},
  journal = {SIAM J. Comput.},
  year = {1978},
  volume = {7},
  number = {4},
  pages = {533--541}
}

@inproceedings{Bal'2000,
  author = {M. Bal{\'i}k},
  title = {Condensation principle},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia},
  year = {2000},
  pages = {13--23},
  note = {Collaborative Report DC--2000--03}
}

@inproceedings{Bal'1998,
  author = {M. Bal{\'i}k},
  title = {Implementation of {DAWG}},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'98},
  year = {1998},
  pages = {26--35},
  note = {Collaborative Report DC--98--06}
}

@article{Barber1990,
  author = {A. M. Barber and Maizel, Jr, J. V.},
  title = {{SequenceEditingAligner}: a multiple sequence editor and aligner},
  journal = {Gene Anal. Tech. Appl.},
  year = {1990},
  volume = {7},
  pages = {39--45}
}

@article{Barnett1990,
  author = {M. P. Barnett},
  title = {Primitive String Transformations as Reductions to Normal Form},
  journal = {SIGPLAN Not.},
  year = {1990},
  volume = {25},
  number = {5},
  pages = {29--33}
}

@incollection{Barth1985,
  author = {G. Barth},
  title = {Relating the average-case cost of the brute-force and the {Knuth-Morris-Pratt} string matching algorithm},
  booktitle = {Combinatorial Algorithms on Words},
  publisher = {Springer-Verlag, Berlin},
  year = {1985},
  volume = {12},
  pages = {45--58}
}

@article{Barth1984,
  author = {G. Barth},
  title = {An analytical comparison of two string searching algorithms},
  journal = {Inf. Process. Lett.},
  year = {1984},
  volume = {18},
  number = {5},
  pages = {249--256}
}

@article{Barth1981,
  author = {G. Barth},
  title = {An alternative for the implementation of {Knuth-Morris-Pratt} algorithm},
  journal = {Inf. Process. Lett.},
  year = {1981},
  volume = {13},
  number = {4/5},
  pages = {134--137}
}

@article{Barton1993,
  author = {G. J. Barton},
  title = {An efficient algorithm to locate all locally optimal alignments between two sequences allowing for gaps},
  journal = {Comput. Appl. Biosci.},
  year = {1993},
  volume = {9},
  number = {6},
  pages = {729--734}
}

@article{Barton1990,
  author = {G. J. Barton},
  title = {Protein multiple sequence alignment and flexible pattern matching},
  journal = {Methods Enzymol.},
  year = {1990},
  volume = {188},
  pages = {403--428}
}

@article{Barton1987,
  author = {G. J. Barton and M. J. E. Sternberg},
  title = {A strategy for the rapid multiple alignment of protein sequences},
  journal = {J. Mol. Biol.},
  year = {1987},
  volume = {198},
  pages = {327--337}
}

@article{Batzoglou2000,
  author = {S. Batzoglou and S. Istrail},
  title = {Physical Mapping With Repeated Probes: The Hypergraph Superstring Problem},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {51--76}
}

@inproceedings{Batzoglou1999,
  author = {S. Batzoglou and S. Istrail},
  title = {Physical Mapping With Repeated Probes: The Hypergraph Superstring Problem},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {66--77}
}

@article{Bean1979,
  author = {D. R. Bean and A. Ehrenfeucht and G. F. McNulty},
  title = {Avoidable patterns in strings of symbols},
  journal = {Pac. J. Math.},
  year = {1979},
  volume = {85},
  pages = {261--294}
}

@book{Beauquier1992,
  author = {D. Beauquier and J. Berstel and P. Chr{\'e}tienne},
  title = {{\'E}l{\'e}ments d'algorithmique},
  publisher = {Masson},
  year = {1992}
}

@inproceedings{Beauquier1989,
  author = {D. Beauquier and J.-E. Pin},
  title = {Factors of words},
  booktitle = {Proceedings of the 16th International Colloquium on Automata, Languages and Programming},
  publisher = {Springer-Verlag, Berlin},
  year = {1989},
  number = {372},
  pages = {190--200}
}

@inproceedings{Bejerano1999,
  author = {G. Bejerano and G. Yona},
  title = {Modeling protein families using probabilistic suffix trees},
  booktitle = {Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1999},
  pages = {15--24}
}

@article{Bell1993,
  author = {G. I. Bell and R. L. Bivins and J. D. Louck and N. Metropolis and M. L. Stein},
  title = {Properties of words on four letters from those on two letters with an application to {DNA} sequences},
  journal = {Adv. Appl. Math.},
  year = {1993},
  volume = {14},
  number = {3},
  pages = {348--366}
}

@article{Bell1993a,
  author = {T. Bell and D. Kulp},
  title = {Longest-match string searching for {Z}iv-{L}empel compression},
  journal = {Softw. Pract. Exp.},
  year = {1993},
  volume = {23},
  number = {7},
  pages = {757--771}
}

@book{Bellman1957,
  author = {R. Bellman},
  title = {Dynamic Programming},
  publisher = {Princeton University Press},
  year = {1957}
}

@inproceedings{Ben-Amram1994,
  author = {A. {Ben-Amram} and O. Berkman and C. S. Iliopoulos and K. Park},
  title = {The Subtree Max Gap Problem with Application to Parallel String Covering},
  booktitle = {Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1994},
  pages = {501--510}
}

@inproceedings{Ben-Dor1997,
  author = {A. {Ben-Dor} and G. Lancia and J. Perone and R. Ravi},
  title = {Banishing bias from consensus sequences},
  booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1264},
  pages = {247--261}
}

@inproceedings{Ben-Dor1999,
  author = {A. {Ben-Dor} and I. Pe'er and R. Shamir and R. Sharan},
  title = {On the Complexity of Positional Sequencing by Hybridization},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {88--100}
}

@inproceedings{Ben-Yehuda1989,
  author = {S. Ben-Yehuda and R. Y. Pinter},
  title = {Symbolic layout improvement using string matching based local transformation},
  booktitle = {Proceedings of the Decennial Caltech Conference on VLSI},
  year = {1989},
  pages = {227--239}
}

@inproceedings{Benham1995,
  author = {C. Benham and S. Kannan and T. Warnow},
  title = {Of chicken teeth and mouse eyes, or generalized character compatibility},
  booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  number = {937},
  pages = {17--26}
}

@inproceedings{Benson1998,
  author = {G. Benson},
  title = {An Algorithm for Finding Tandem Repeats of Unspecified Pattern Size},
  booktitle = {Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1998},
  pages = {20--29}
}

@inproceedings{Benson1997,
  author = {G. Benson},
  title = {Sequence Alignment with Tandem Duplication},
  booktitle = {Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1997},
  pages = {27--36}
}

@inproceedings{Benson1994,
  author = {G. Benson},
  title = {A space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {1--14}
}

@article{Benson1998a,
  author = {G. Benson and M. S. Waterman},
  title = {A method for fast database search for all \emph{k}-nucleotide repeats},
  journal = {Nucleic Acids Res.},
  year = {1998},
  volume = {22},
  pages = {4828--4836}
}

@phdthesis{Benson1992,
  author = {G. E. Benson},
  title = {Two-dimensional periodicity and matching algorithms},
  school = {Department of Computer Science, University of Maryland},
  year = {1992}
}

@inproceedings{Bent2002,
  author = {K. Bent},
  title = {A Recursive Function for Calculating the Number of Legal Strings of Parentheses and for Calculating Catalan Numbers},
  booktitle = {Proceedings of the Prague Stringology Conference~'02},
  year = {2002},
  pages = {18--27},
  note = {Research Report DC--2002--03}
}

@inproceedings{Bentley1999,
  author = {J. Bentley and D. McIlroy},
  title = {Data Compression using Long Common Strings},
  booktitle = {Proceedings Data Compression Conference},
  year = {1999},
  pages = {287--295}
}

@inproceedings{Bentley1997,
  author = {J. L. Bentley and R. Sedgewick},
  title = {Fast Algorithms for Sorting and Searching Strings},
  booktitle = {Proceedings of the 8th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1997},
  pages = {360--369}
}

@inproceedings{Bergroth1998,
  author = {L. Bergroth and H. Hakonen and T. Raita},
  title = {New Approximation Algorithms for Longest Common Subsequences},
  booktitle = {Proceedings String Processing and Information Retrieval: A South American Symposium},
  publisher = {IEEE Computer Society Press},
  year = {1998},
  pages = {32--40}
}

@inproceedings{Berkman1989,
  author = {O. Berkman and D. Breslauer and Z. Galil and B. Schieber and U. Vishkin},
  title = {Highly parallelizable problems},
  booktitle = {Proceedings of the 21st ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1989},
  pages = {309--319}
}

@article{Berkman1995,
  author = {O. Berkman and C.S. Iliopoulos and K. Park},
  title = {The subtree max gap problem with application to parallel string covering},
  journal = {Inf. Comput.},
  year = {1995},
  volume = {123},
  number = {1},
  pages = {127--137}
}

@inproceedings{Berkovich1985,
  author = {S. Y. Berkovich and A. E. F. A. Hegazy},
  title = {Matching String Patterns in Large Textual Files},
  booktitle = {International Symposium on New Directions in Computing},
  publisher = {IEEE Computer Society Press},
  year = {1985},
  pages = {122--127}
}

@inproceedings{Berman1996,
  author = {P. Berman and S. Hannenhalli},
  title = {Fast Sorting by Reversal},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {168--185}
}

@inproceedings{Berman1997,
  author = {P. Berman and M. Karpinski and L. L. Larmore and W. Plandowski and W. Rytter},
  title = {On the complexity of pattern matching for highly compressed two-dimensional texts},
  booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1264},
  pages = {40--51}
}

@inproceedings{Berman1999,
  author = {P. Berman and Z. Zhang and Y. I. Wolf and E. V. Koonin and W. Miller},
  title = {Winnowing Sequences from a Database Search},
  booktitle = {Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1999},
  pages = {50--58}
}

@article{Berry1986,
  author = {G. Berry and R. Sethi},
  title = {From regular expression to deterministic automata},
  journal = {Theor. Comput. Sci.},
  year = {1986},
  volume = {48},
  number = {1},
  pages = {117--126}
}

@inproceedings{Berry1999,
  author = {T. Berry and S. Ravindran},
  title = {A fast string matching algorithm and experimental results},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'99},
  year = {1999},
  pages = {16--28},
  note = {Collaborative Report DC--99--05}
}

@inproceedings{Berry1999a,
  author = {T. Berry and S. Ravindran},
  title = {String matching in a compressed {DNA} text},
  booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms},
  year = {1999},
  pages = {53--62}
}

@techreport{Berstel1984,
  author = {J. Berstel},
  title = {Some recent results on squarefree words},
  year = {1984},
  number = {LITP 84-2}
}

@techreport{Berstel1978,
  author = {J. Berstel},
  title = {Mots sans carr{\'e}s et morphismes it{\'e}r{\'e}s},
  year = {1978},
  number = {LITP 78-42}
}

@article{Berstel1999,
  author = {J. Berstel and L. Boasson},
  title = {Partial words and a theorem of {Fine and Wilf}},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {135--141}
}

@book{Berstel1985,
  author = {J. Berstel and D. Perrin},
  title = {Theory of codes},
  publisher = {Academic Press},
  year = {1985}
}

@article{Berstel1979,
  author = {J. Berstel and D. Perrin and J.-F. Perrot and A. Restivo},
  title = {Sur le th{\'e}or{\`e}me du d{\'e}faut},
  journal = {J. Algorithms},
  year = {1979},
  volume = {60},
  number = {1},
  pages = {169--181}
}

@techreport{Berstel1978a,
  author = {J. Berstel and D. Perrin and J.-F. Perrot and A. Restivo},
  title = {Sur le th{\'e}or{\`e}me du d{\'e}faut},
  year = {1978},
  number = {LITP 78-17}
}

@article{Berstel1994,
  author = {J. Berstel and M. Pocchiola},
  title = {Average cost of {Duval}'s algorithm for generating {Lyndon} words},
  journal = {Theor. Comput. Sci.},
  year = {1994},
  volume = {132},
  number = {1-2},
  pages = {415--425}
}

@article{Berstel1993,
  author = {J. Berstel and M. Pocchiola},
  title = {A geometric proof of the enumeration formula for {Sturmian} words},
  journal = {Int. J. Algebr. Comput.},
  year = {1993},
  volume = {3},
  pages = {349--355}
}

@techreport{Berstel1992,
  author = {J. Berstel and M. Pocchiola},
  title = {Average cost of {Duval}'s algorithm for generating {Lyndon} words},
  year = {1992},
  number = {92-8}
}

@article{Berstel1994a,
  author = {J. Berstel and P. S{\'e}{\'e}bold},
  title = {A remark on morphic {Sturmian} word},
  journal = {RAIRO Inform. Th{\'e}or. Appl.},
  year = {1994},
  volume = {28},
  number = {3-4},
  pages = {255--263}
}

@inproceedings{Berstel1993a,
  author = {J. Berstel and P. S{\'e}{\'e}bold},
  title = {A characterization of {Sturmian} morphisms},
  booktitle = {Proceedings of the 18th Symposium on Mathematical Foundations of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1993},
  number = {711},
  pages = {281--290}
}

@article{Bertossi1990,
  author = {A. A. Bertossi},
  title = {A {VLSI} System for String Matching},
  journal = {Integr., The VLSI J.},
  year = {1990},
  volume = {9},
  pages = {129--139}
}

@inproceedings{Bertossi1990a,
  author = {A. A. Bertossi and E. Lodi and F. Luccio and L. Pagli},
  title = {Context--dependent string matching},
  booktitle = {Sequences, combinatorics, compression, security and transmission},
  publisher = {Springer-Verlag, Berlin},
  year = {1990},
  pages = {25--40}
}

@techreport{Bertossi1987,
  author = {A. A. Bertossi and E. Lodi and F. Luccio and L. Pagli},
  title = {String matching with context dependent errors},
  year = {1987}
}

@article{Bertossi1990b,
  author = {A. A. Bertossi and F. Luccio and E. Lodi and L. Pagli},
  title = {String matching with weighted errors},
  journal = {Theor. Comput. Sci.},
  year = {1990},
  volume = {73},
  number = {3},
  pages = {319--328}
}

@article{Bertossi1992,
  author = {A. A. Bertossi and F. Luccio and L. Pagli and E. Lodi},
  title = {A parallel solution to the approximate string matching algorithm problem},
  journal = {Comput. J.},
  year = {1992},
  volume = {35},
  number = {5},
  pages = {524--526}
}

@article{Bickel1987,
  author = {M. A. Bickel},
  title = {Automatic correction to misspelled names: a fourth-generation language approach},
  journal = {Commun. ACM},
  year = {1987},
  volume = {30},
  number = {3},
  pages = {224--228}
}

@phdthesis{Bieganski1995,
  author = {P. Bieganski},
  title = {Genetic sequence data retrieval and manipulation based on generalized suffix trees},
  school = {University of Minnesota},
  year = {1995}
}

@book{Binstock1995,
  author = {A. Binstock and J. Rex},
  title = {Practical Algorithms for Programmers},
  publisher = {Addison-Wesley},
  year = {1995}
}

@inproceedings{Bird1977,
  author = {R. M. Bird and J. C. Tu and R. M. Worthy},
  title = {Associative/parallel processors for searching very large textual data bases},
  booktitle = {Proceedings of the 3rd Workshop on Computer Architecture for Non-numeric Processing},
  year = {1977},
  pages = {8--16}
}

@article{Bird1977a,
  author = {R. S. Bird},
  title = {Two-dimensional pattern matching},
  journal = {Inf. Process. Lett.},
  year = {1977},
  volume = {6},
  number = {5},
  pages = {168--170}
}

@article{Bird1989,
  author = {R. S. Bird and J. Gibbons and G. Jones},
  title = {Formal derivation of a pattern matching algorithm},
  journal = {Sci. Comp. Program.},
  year = {1989},
  volume = {12},
  number = {2},
  pages = {93--104}
}

@incollection{Bishop1987,
  author = {M. J. Bishop and A. E. Friday and E. A. Thompson},
  title = {Inference of evolutionary relationships},
  booktitle = {Nucleic acid and protein sequence analysis: a practical approach},
  publisher = {IRL Press Limited},
  year = {1987},
  pages = {359--385}
}

@book{Bishop1987a,
  author = {M. J. Bishop and C. J. Rawlings},
  title = {Nucleic acid and protein sequence analysis: a practical approach},
  publisher = {IRL Press Limited},
  year = {1987}
}

@article{Bishop1986,
  author = {M. J. Bishop and E. A. Thompson},
  title = {Maximum likelihood alignment of {DNA} sequences},
  journal = {J. Mol. Biol.},
  year = {1986},
  volume = {190},
  pages = {159--165}
}

@article{Bishop1984,
  author = {M. J. Bishop and E. A. Thompson},
  title = {Fast computer search for similar {DNA} sequences},
  journal = {Nucleic Acids Res.},
  year = {1984},
  volume = {12},
  number = {13},
  pages = {5471--5474}
}

@article{Blair1960,
  author = {C. R. Blair},
  title = {A program for correcting spelling errors},
  journal = {Inf. Control},
  year = {1960},
  volume = {3},
  pages = {60--67}
}

@article{Blaisdell1986,
  author = {B. E. Blaisdell},
  title = {A measure of the similarity of sets of sequences not requiring sequence alignment},
  journal = {Proc. Natl. Acad. Sci. U.S.A.},
  year = {1986},
  volume = {83},
  pages = {5155--5159}
}

@inproceedings{Bloch1996,
  author = {M. Bloch},
  title = {Efficiency of {AC}-machine and {SFNA} in practical string matching},
  booktitle = {Proceedings of the Prague Stringologic Club Workshop~'96},
  year = {1996},
  pages = {15--18},
  note = {Collaborative Report DC--96--10}
}

@phdthesis{Bloch1989,
  author = {M. Bloch},
  title = {Experimental evaluation and optimization of Aho-Corasick pattern matching machine},
  school = {University of Prague, Czech Republic},
  year = {1989}
}

@article{Blum1994,
  author = {A. Blum and T. Jiang and M. Li and J. Tromp and M. Yannakakis},
  title = {Linear approximation of shortest superstrings},
  journal = {J. Assoc. Comput. Mach.},
  year = {1994},
  volume = {41},
  number = {4},
  pages = {630--647}
}

@inproceedings{Blum1991,
  author = {A. Blum and T. Jiang and M. Li and J. Tromp and M. Yannakakis},
  title = {Linear approximation of shortest superstrings},
  booktitle = {Proceedings of the 23rd ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1991},
  pages = {328--336}
}

@article{Blum2000,
  author = {N. Blum},
  title = {Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology},
  journal = {J. Algorithms},
  year = {2000},
  volume = {35},
  number = {2},
  pages = {129--168}
}

@inproceedings{Blum1992,
  author = {N. Blum},
  title = {On locally optimal alignments in genetic sequences},
  booktitle = {Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {577},
  pages = {426--436}
}

@article{Blumer1985,
  author = {A. Blumer and J. Blumer and A. Ehrenfeucht and D. Haussler and M. T. Chen and J. Seiferas},
  title = {The smallest automaton recognizing the subwords of a text},
  journal = {Theor. Comput. Sci.},
  year = {1985},
  volume = {40},
  number = {1},
  pages = {31--55}
}

@article{Blumer1987,
  author = {A. Blumer and J. Blumer and A. Ehrenfeucht and D. Haussler and R. McConnel},
  title = {Complete inverted files for efficient text retrieval and analysis},
  journal = {J. Assoc. Comput. Mach.},
  year = {1987},
  volume = {34},
  number = {3},
  pages = {578--595}
}

@inproceedings{Blumer1984,
  author = {A. Blumer and J. Blumer and A. Ehrenfeucht and D. Haussler and R. McConnel},
  title = {Building the minimal {DFA} for the set of all subwords of a word on-line in linear time},
  booktitle = {Proceedings of the 11th International Colloquium on Automata, Languages and Programming},
  publisher = {Springer-Verlag, Berlin},
  year = {1984},
  number = {172},
  pages = {109--118}
}

@inproceedings{Blumer1984a,
  author = {A. Blumer and J. Blumer and A. Ehrenfeucht and D. Haussler and R. McConnel},
  title = {Building a complete inverted file for a set of text files in linear time},
  booktitle = {Proceedings of the 16th ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1984},
  pages = {349--351}
}

@article{Blumer1983,
  author = {A. Blumer and J. Blumer and A. Ehrenfeucht and D. Haussler and R. McConnel},
  title = {Linear size finite automata for the set of all subwords of a word: an outline of results},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1983},
  volume = {21},
  pages = {12--20}
}

@article{Blumer1989,
  author = {A. Blumer and A. Ehrenfeucht and D. Haussler},
  title = {Average size of suffix trees and {DAWGS}},
  journal = {Discret. Appl. Math.},
  year = {1989},
  volume = {24},
  pages = {37--45}
}

@article{Blumer1987a,
  author = {J. A. Blumer},
  title = {How much is that {DAWG} in the window ? a moving window algorithm for the directed acyclic word graph},
  journal = {J. Algorithms},
  year = {1987},
  volume = {8},
  number = {4},
  pages = {451--469}
}

@techreport{Blumer1986,
  author = {J. Blumer and A. Blumer},
  title = {On-line construction of a complete inverted file},
  year = {1986},
  number = {UCSC-CRL-86-11}
}

@inproceedings{Boasson1999,
  author = {L. Boasson and P. Cegielski and I. Guessarian and Y. Matiyasevich},
  title = {Window-Accumulated Subsequence Matching Problem is Linear},
  booktitle = {Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems},
  publisher = {ACM Press},
  year = {1999},
  pages = {327--336}
}

@inproceedings{Bodlaender1994,
  author = {H. Bodlaender and R.G. Downey and M.R. Fellows and H.T. Wareham},
  title = {The Parametrized Complexity of Sequence Alignment and Consensus},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {15--30}
}

@article{Bodlaender1995,
  author = {H. Bodlaender and R. G. Downey and M. R. Fellows and M. T. Hallett and H. T. Wareham},
  title = {Parametrized Complexity Analysis in Computational Biology},
  journal = {Comput. Appl. Biosci.},
  year = {1995},
  volume = {11},
  number = {1},
  pages = {49--57}
}

@article{Bodlaender1995a,
  author = {H. Bodlaender and R. G. Downey and M. R. Fellows and M. T. Hallett and H. T. Wareham},
  title = {Parametrized Complexity Analysis in Computational Biology},
  journal = {Theor. Comput. Sci.},
  year = {1995},
  volume = {147},
  number = {1--2},
  pages = {31--54}
}

@inproceedings{Bodlaender1996,
  author = {H. L. Bodlaender and M. R. Fellows and P. A. Evans},
  title = {Finite-State Computability of Annotations of Strings and Trees},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {384--391}
}

@techreport{Bonizzoni1994,
  author = {P. Bonizzoni and M. Duella and G. Mauri},
  title = {Approximation complexity of longest common subsequence and shortest common supersequence over fixed alphabet},
  year = {1994},
  number = {117/94}
}

@inproceedings{Bonizzoni2000,
  author = {P. Bonizzoni and G. Della Vedova and G. Mauri},
  title = {Approximating the Maximum Isomorphic Agreement Subtree Is Hard},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {119--128}
}

@article{Bookstein1973,
  author = {A. Bookstein},
  title = {On {Harrison}'s Substring Testing Technique},
  journal = {Commun. ACM},
  year = {1973},
  volume = {16},
  number = {3},
  pages = {180--181}
}

@article{Booth1980,
  author = {K. S. Booth},
  title = {Lexicographically least circular substrings},
  journal = {Inf. Process. Lett.},
  year = {1980},
  volume = {10},
  number = {4},
  pages = {240--242}
}

@article{Boothroyd1963,
  author = {J. Boothroyd},
  title = {Stringsort},
  journal = {Commun. ACM},
  year = {1963},
  volume = {6},
  number = {10},
  pages = {615}
}

@inproceedings{Botstein1997,
  author = {D. Botstein},
  title = {Expression Arrays: An Open Problem for Mathematicians in Post-Genome Sequence Biology},
  booktitle = {Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1997},
  pages = {56--56}
}

@techreport{Boyar1993,
  author = {J. Boyar and K. S. Larsen},
  title = {Faster Parallel Computation of Edit Distances},
  year = {1993}
}

@article{Boyer1977,
  author = {R. S. Boyer and J. S. Moore},
  title = {A fast string searching algorithm},
  journal = {Commun. ACM},
  year = {1977},
  volume = {20},
  number = {10},
  pages = {762--772}
}

@article{Bradford1990,
  author = {J. H. Bradford},
  title = {Sequence matching with binary codes},
  journal = {Inf. Process. Lett.},
  year = {1990},
  volume = {34},
  number = {4},
  pages = {193--196}
}

@article{Bradford1991,
  author = {J. H. Bradford and T. A. Jenkyns},
  title = {On the inadequacy of tournament algorithms for the {\emph{N}}-{SCS} problem},
  journal = {Inf. Process. Lett.},
  year = {1991},
  volume = {38},
  number = {4},
  pages = {169--171}
}

@inproceedings{Bradley1997,
  author = {J. R. Bradley and S. S. Skiena},
  title = {Fabricating Arrays of Strings},
  booktitle = {Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1997},
  pages = {57--66}
}

@inproceedings{Breimer2000,
  author = {E. Breimer and M. Goldberg and D. Lim},
  title = {A learning algorithm for the longest common subsequence problem},
  booktitle = {Proceedings of the 2nd Algorithm Engineering and Experiments},
  year = {2000},
  pages = {147--156}
}

@article{Breslauer1998,
  author = {D. Breslauer},
  title = {The suffix tree of a tree and minimizing sequential transducers},
  journal = {Theor. Comput. Sci.},
  year = {1998},
  volume = {191},
  number = {1--2},
  pages = {131--144}
}

@inproceedings{Breslauer1996,
  author = {D. Breslauer},
  title = {The suffix Tree of a Tree and Minimizing Sequential Transducers},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {116--129}
}

@article{Breslauer1996a,
  author = {D. Breslauer},
  title = {Saving comparisons in the {Crochemore--Perrin} string-matching algorithm},
  journal = {Theor. Comput. Sci.},
  year = {1996},
  volume = {158},
  number = {1--2},
  pages = {177--192}
}

@article{Breslauer1995,
  author = {D. Breslauer},
  title = {Fast parallel string prefix-matching},
  journal = {Theor. Comput. Sci.},
  year = {1995},
  volume = {132},
  number = {2},
  pages = {269--278}
}

@article{Breslauer1995a,
  author = {D. Breslauer},
  title = {Dictionary matching on unbounded alphabets: uniform length dictionaries},
  journal = {J. Algorithms},
  year = {1995},
  volume = {18},
  number = {2},
  pages = {278--295}
}

@inproceedings{Breslauer1994,
  author = {D. Breslauer},
  title = {Dictionary matching on unbounded alphabets: uniform length dictionaries},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {184--197}
}

@article{Breslauer1994a,
  author = {D. Breslauer},
  title = {Testing string superprimitivity in parallel},
  journal = {Inf. Process. Lett.},
  year = {1994},
  volume = {49},
  number = {5},
  pages = {235--241}
}

@inproceedings{Breslauer1993,
  author = {D. Breslauer},
  title = {Saving Comparisons in the {Crochemore-Perrin} String Matching Algorithm},
  booktitle = {Proceedings of the 1st Annual European Symposium},
  publisher = {Springer-Verlag, Berlin},
  year = {1993},
  number = {726},
  pages = {61--72}
}

@article{Breslauer1992,
  author = {D. Breslauer},
  title = {An on-line string superprimitivity test},
  journal = {Inf. Process. Lett.},
  year = {1992},
  volume = {44},
  number = {6},
  pages = {345--347}
}

@techreport{Breslauer1992a,
  author = {D. Breslauer},
  title = {Fast parallel string prefix-matching},
  year = {1992},
  number = {CUCS-041-92}
}

@phdthesis{Breslauer1992b,
  author = {D. Breslauer},
  title = {Efficient string algorithmics},
  school = {Computer Science Department, Columbia University, NY},
  year = {1992}
}

@techreport{Breslauer1992c,
  author = {D. Breslauer},
  title = {Testing String Superprimitivity in Parallel},
  year = {1992},
  number = {CUCS-053-92}
}

@techreport{Breslauer1989,
  author = {D. Breslauer},
  title = {An Optimal {\emph{O(\log \log n)}} Time Parallel String Matching Algorithm},
  year = {1989},
  number = {CUCS-492-89}
}

@article{Breslauer1998a,
  author = {D. Breslauer and L. Colussi and L. Toniolo},
  title = {On the comparison complexity of the string prefix-matching problem},
  journal = {J. Algorithms},
  year = {1998},
  volume = {29},
  number = {1},
  pages = {18--67}
}

@inproceedings{Breslauer1993a,
  author = {D. Breslauer and L. Colussi and L. Toniolo},
  title = {Tight Comparison Bounds for the String Prefix-Matching Problem},
  booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1993},
  number = {684},
  pages = {11--19}
}

@article{Breslauer1993b,
  author = {D. Breslauer and L. Colussi and L. Toniolo},
  title = {Tight comparison bounds for the string prefix-matching problem},
  journal = {Inf. Process. Lett.},
  year = {1993},
  volume = {47},
  number = {1},
  pages = {51--57}
}

@article{Breslauer1995b,
  author = {D. Breslauer and Z. Galil},
  title = {Finding all periods and initial palindromes of a string in parallel},
  journal = {Algorithmica},
  year = {1995},
  volume = {14},
  number = {4},
  pages = {355--366}
}

@article{Breslauer1993c,
  author = {D. Breslauer and Z. Galil},
  title = {Efficient comparison based string matching},
  journal = {J. Complexity},
  year = {1993},
  volume = {9},
  number = {3},
  pages = {339--365}
}

@article{Breslauer1992d,
  author = {D. Breslauer and Z. Galil},
  title = {A lower bound for parallel string matching},
  journal = {SIAM J. Comput.},
  year = {1992},
  volume = {21},
  number = {5},
  pages = {856--862}
}

@techreport{Breslauer1992e,
  author = {D. Breslauer and Z. Galil},
  title = {Finding all periods and initial palindromes of a string in parallel},
  year = {1992},
  number = {CUCS-017-92}
}

@techreport{Breslauer1992f,
  author = {D. Breslauer and Z. Galil},
  title = {Parallel string matching algorithms},
  year = {1992},
  number = {CUCS-002-92}
}

@techreport{Breslauer1992g,
  author = {D. Breslauer and Z. Galil},
  title = {Efficient Comparison Based String Matching},
  year = {1992},
  number = {CUCS-054-92}
}

@inproceedings{Breslauer1991,
  author = {D. Breslauer and Z. Galil},
  title = {A lower bound for parallel string matching},
  booktitle = {Proceedings of the 23rd ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1991},
  pages = {439--443}
}

@article{Breslauer1990,
  author = {D. Breslauer and Z. Galil},
  title = {An optimal {\emph{O(\log \log n)}} time parallel string matching algorithm},
  journal = {SIAM J. Comput.},
  year = {1990},
  volume = {19},
  number = {6},
  pages = {1051--1058}
}

@article{Breslauer1997,
  author = {D. Breslauer and L. G{\c a}sieniec},
  title = {Efficient string matching on packed texts},
  journal = {RAIRO Inform. Th{\'e}or. Appl.},
  year = {1997},
  volume = {30},
  number = {6},
  pages = {521--544}
}

@inproceedings{Breslauer1995c,
  author = {D. Breslauer and L. G{\c a}sieniec},
  title = {Efficient string matching on coded texts},
  booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  number = {937},
  pages = {27--40}
}

@article{Breslauer1996b,
  author = {D. Breslauer and R. Hariharan},
  title = {Optimal parallel construction of minimal suffix and factor automata},
  journal = {Parallel Process. Lett.},
  year = {1996},
  volume = {6},
  number = {1},
  pages = {35--44}
}

@article{Breslauer1997a,
  author = {D. Breslauer and T. Jiang and Z. Jiang},
  title = {Rotations of periodic strings and short superstrings},
  journal = {J. Algorithms},
  year = {1997},
  volume = {24},
  number = {2},
  pages = {340--353}
}

@inproceedings{Briandais1959,
  author = {R. de la Briandais},
  title = {File searching using variable length keys},
  booktitle = {Proceedings of the Western Joint Computer Conference},
  year = {1959},
  pages = {295--298}
}

@article{Brisaboa2007,
  author = {N. Brisaboa and A. Fari\~na and G. Navarro and J. Param\'a},
  title = {Lightweight Natural Language Text Compression},
  journal = {Information Retrieval},
  year = {2007},
  volume = {10},
  pages = {1--33}
}

@inproceedings{Brisaboa2006,
  author = {N. Brisaboa and A. Fari{\~n}a and G. Navarro and J. Param\'a},
  title = {Improving Semistatic Compression via Pair-Based Coding},
  booktitle = {Proceedings of the 6th International Conference onPerspectives of System Informatics (PSI'06)},
  year = {2006},
  pages = {124--134}
}

@article{Brlek1989,
  author = {S. Brlek},
  title = {Enumeration of factors in the {Thue-Morse} word},
  journal = {Discret. Appl. Math.},
  year = {1989},
  volume = {24},
  pages = {83--96}
}

@inproceedings{Brodal1998,
  author = {G. S. Brodal},
  title = {Finger Search Trees with Constant Insertion Time},
  booktitle = {Proceedings ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1998},
  pages = {540--549}
}

@inproceedings{Brodal1996,
  author = {G. S. Brodal and L. G{\c a}sieniec},
  title = {Approximate Dictionary Queries},
  booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1996},
  number = {1075},
  pages = {65--74}
}

@article{Brodal2000,
  author = {G. S. Brodal and R. B. Lyngs{\o} and C. N. S. Pedersen and J. Stoye},
  title = {Finding maximal pairs with bounded gap},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {77--103}
}

@inproceedings{Brodal1999,
  author = {G. S. Brodal and R. B. Lyngs{\o} and C. N. S. Pedersen and J. Stoye},
  title = {Finding maximal pairs with bounded gap},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {134--149}
}

@inproceedings{Brodal2000a,
  author = {G. S. Brodal and C. N. S. Pedersen},
  title = {Finding Maximal Quasiperiodicities in Strings},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {397--411}
}

@article{Brodal2000b,
  author = {G. S. Brodal and S. Venkatesh},
  title = {Improved bounds for dictionary look-up with one error},
  journal = {Inf. Process. Lett.},
  year = {2000},
  volume = {75},
  number = {1--2},
  pages = {57--59}
}

@inproceedings{Broder2000,
  author = {A. Z. Broder},
  title = {Identifying and Filtering Near-Duplicate Documents},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {1--10}
}

@article{Bron1989,
  author = {C. Bron and E. J. Dijkstra},
  title = {A Better Way to Combine Efficient String Length Encoding and Zero-Termination},
  journal = {SIGPLAN Not.},
  year = {1989},
  volume = {24},
  number = {6},
  pages = {11--19}
}

@inproceedings{Brown1991,
  author = {P. Brown and J. Lai and R. Mercer},
  title = {Aligning sentences in parallel corpora},
  booktitle = {Proceedings of the 47th Annual Meeting of the ACL},
  year = {1991}
}

@inproceedings{Brutlag1993,
  author = {D. Brutlag and D. Naor},
  title = {On Suboptimal Alignments of Biological Sequences},
  booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1993},
  number = {684},
  pages = {179--196}
}

@article{Brutlag1990,
  author = {D. L. Brutlag and J. P. Dautricourt and S. Maulik and J. Relph},
  title = {Improved Sensitivity of Biological Sequence Database Searches},
  journal = {Comput. Appl. Biosci.},
  year = {1990},
  volume = {6},
  number = {3},
  pages = {237--245}
}

@phdthesis{Bruy`ere1991,
  author = {V. Bruy{\`e}re},
  title = {Automates de {Boyer-Moore}},
  school = {Universit{\'e} de Mons-Hainaut, Belgique},
  year = {1991}
}

@inproceedings{Bruy`ere1996,
  author = {V. Bruy{\`e}re and R. A. Baeza-Yates and O. Delgrange and R. Scheihing},
  title = {About the size of {Boyer-Moore} automata},
  booktitle = {Proceedings of the 3rd South American Workshop on String Processing},
  publisher = {Carleton University Press},
  year = {1996},
  pages = {31--46}
}

@techreport{Bruy`ere1994,
  author = {V. Bruy{\`e}re and O. Delgrange},
  title = {About the size of the {Boyer-Moore} automaton},
  year = {1994}
}

@article{Bruy`ere1999,
  author = {V. Bruy{\`e}re and D. Perrin},
  title = {Maximal bifix codes},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {107--121}
}

@inproceedings{Bryant2000,
  author = {D. Bryant},
  title = {A Lower Bound for the Breakpoint Phylogeny Problem},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {235--247}
}

@inbook{Brazma1997,
  author = {A. Br{\={a}}zma},
  title = {Efficient learning of regular expressions from approximate examples},
  booktitle = {Computational Learning Theory and Natural Learning Systems},
  publisher = {MIT Press},
  year = {1997},
  volume = {IV: Making Learning Systems Practical},
  pages = {337--352}
}

@inproceedings{Brazma1995,
  author = {A. Br{\={a}}zma},
  title = {Learning of regular expressions by pattern matching},
  booktitle = {Proceedings of the 2nd European Conference on Computational Learning Theory},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  volume = {904},
  pages = {392--403}
}

@article{Brazma1998,
  author = {A. Br{\={a}}zma and I. Jonassen and I. Eidhammer and D. Gilbert},
  title = {Approaches to the automatic Discovery of patterns in Biosequences},
  journal = {J. Comput. Bio.},
  year = {1998},
  volume = {5},
  number = {2},
  pages = {277--304}
}

@article{Brazma1998a,
  author = {A. Br{\={a}}zma and I. Jonassen and E. Ukkonen and J. Vilo},
  title = {Predicting Gene Regulatory Elements in Silico on a Genomic Scale},
  journal = {Genome Research},
  year = {1998},
  volume = {8},
  number = {11},
  pages = {1202--1215}
}

@inproceedings{Brazma1996,
  author = {A. Br{\={a}}zma and I. Jonassen and E. Ukkonen and J. Vilo},
  title = {Discovering Patterns and Subfamilies in Biosequences},
  booktitle = {Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology},
  publisher = {AAAI Press},
  year = {1996},
  pages = {34--43}
}

@inproceedings{Brazma1998b,
  author = {A. Br{\={a}}zma and I. Jonassen and J. Vilo and E. Ukkonen},
  title = {Pattern Discovery in Biosequences},
  booktitle = {Proceedings of the 4th International Colloquium on Grammatical Inference ({ICGI}-98)},
  publisher = {Springer-Verlag, Berlin},
  year = {1998},
  volume = {1433},
  pages = {257--270}
}

@inproceedings{Brazma1997a,
  author = {A. Br{\={a}}zma and J. Vilo and E. Ukkonen and K. Valtonen},
  title = {Data Mining for Regulatory Elements in Yeast Genome},
  booktitle = {Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology},
  publisher = {AAAI Press},
  year = {1997},
  pages = {65--74}
}

@inproceedings{Buchsbaum2000,
  author = {A. L. Buchsbaum and R. Giancarlo},
  title = {Algorithmic Aspects of Speech Recognition: A Synopsis},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {27--32}
}

@inproceedings{Bundschuh1999,
  author = {R. Bundschuh and T. Hwa},
  title = {An Analytic Study of the Phase Transition Line in Local Sequence Alignment with Gaps},
  booktitle = {Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1999},
  pages = {70--76}
}

@article{Bunke1995,
  author = {H. Bunke},
  title = {Fast Approximate Matching of Words Against a Dictionary},
  journal = {Computing},
  year = {1995},
  volume = {55},
  number = {1},
  pages = {75--89}
}

@article{Bunke1993,
  author = {H. Bunke and U. Buehler},
  title = {Applications of approximate string matching to 2{D} shape recognition.},
  journal = {Pattern Recognit.},
  year = {1993},
  volume = {26},
  number = {12},
  pages = {1797--1812}
}

@article{Bunke1995a,
  author = {H. Bunke and J. Csirik},
  title = {An improved algorithm for computing the edit distance of run-length coded strings},
  journal = {Inf. Process. Lett.},
  year = {1995},
  volume = {54},
  number = {2},
  pages = {93--96}
}

@article{Bunke1993a,
  author = {H. Bunke and J. Csirik},
  title = {An algorithm for matching run-length coded strings},
  journal = {Comput.},
  year = {1993},
  volume = {50},
  pages = {297--314}
}

@inproceedings{Burghardt1988,
  author = {J. Burghardt},
  title = {A tree pattern matching algorithm with reasonable space requirements},
  booktitle = {Proceedings of the 13th Colloquium on Trees in Algebra and Programming},
  publisher = {Springer-Verlag, Berlin},
  year = {1988},
  number = {299},
  pages = {1--15}
}

@article{Burkhard1976,
  author = {W. A. Burkhard},
  title = {Hashing and trie algorithms for partial match retrieval},
  journal = {ACM Trans. Database Syst.},
  year = {1976},
  volume = {1},
  pages = {175--187}
}

@inproceedings{Burkhardt1999,
  author = {S. Burkhardt and A. Crauser and P. Ferragina and H.-P. Lenhof and E. Rivals and M. Vingron},
  title = {\emph{q}-gram Based Database Searching Using a Suffix Array},
  booktitle = {Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1999},
  pages = {77--83}
}

@article{Burkowski1982,
  author = {F. J. Burkowski},
  title = {A hardware hashing schemme in the design of a multiterm string comparator},
  journal = {IEEE Trans. Comput.},
  year = {1982},
  volume = {C-31},
  number = {9},
  pages = {825--834}
}

@article{CACM1992,
  author = {CACM},
  title = {Notes on {Sunday}'s paper},
  journal = {Commun. ACM},
  year = {1992},
  volume = {35},
  number = {4},
  pages = {132--137}
}

@article{Cai1992,
  author = {J. Cai and R. Paige and R. Tarjan},
  title = {More efficient bottom-up multi-pattern matching in trees},
  journal = {Theor. Comput. Sci.},
  year = {1992},
  volume = {106},
  number = {1},
  pages = {21--60}
}

@techreport{Cai1992a,
  author = {J. Cai and R. Paige and R. Tarjan},
  title = {More efficient bottom-up multi-pattern matching in trees},
  year = {1992},
  number = {604}
}

@article{Cai1992b,
  author = {J. Cai and R. Paige and R. Tarjan},
  title = {More efficient bottom-up multi-pattern matching in trees},
  journal = {Theor. Comput. Sci.},
  year = {1992},
  volume = {106},
  number = {1},
  pages = {21--60}
}

@article{Califano2000,
  author = {A. Califano},
  title = {{SPLASH}: {S}tructural Pattern Localization Analysis by Sequential Histograming},
  journal = {Bioinformatics},
  year = {2000},
  volume = {15},
  pages = {341--357}
}

@inproceedings{Cambouropoulos1999,
  author = {E. Cambouropoulos and M. Crochemore and C. S. Iliopoulos and L. Mouchard and Y. J. Pinzon},
  title = {Algorithms for computing approximate repetitions in musical sequences},
  booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms},
  year = {1999},
  pages = {129--144}
}

@inproceedings{Cantor1998,
  author = {C. R. Cantor},
  title = {Enhancements in Sequence Analysis with {DNA} Arrays},
  booktitle = {Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1998},
  pages = {50--50}
}

@inproceedings{Caprara1999,
  author = {A. Caprara},
  title = {Formulations and Complexity of Multiple Sorting by Reversals },
  booktitle = {Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1999},
  pages = {84--93}
}

@article{Caprara1999a,
  author = {A. Caprara},
  title = {Sorting Permutations by Reversals and {Eulerian} Cycle Decompositions},
  journal = {SIAM J. Discret. Math.},
  year = {1999},
  volume = {12},
  number = {1},
  pages = {91--110}
}

@inproceedings{Caprara1997,
  author = {A. Caprara},
  title = {Sorting by Reversals is Difficult},
  booktitle = {Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {1997},
  pages = {75--83}
}

@inproceedings{Caprara2000,
  author = {A. Caprara and G. Lancia and See Kiong Ng},
  title = {Fast Practical Solution of Sorting by Reversals},
  booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {12--21}
}

@book{Cardon1996,
  author = {A. Cardon and C. Charras},
  title = {Introduction {\`a} l'algorithmique et {\`a} la programmation},
  publisher = {Ellipses},
  year = {1996}
}

@article{Carillo1988,
  author = {H. Carillo and D. Lipman},
  title = {The multiple sequence alignment problem in biology},
  journal = {SIAM J. Appl. Math.},
  year = {1988},
  volume = {48},
  pages = {1073--1082}
}

@article{Carpi1999,
  author = {A. Carpi},
  title = {On Abelian squares and substitutions},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {61--81}
}

@article{Cassaigne1999,
  author = {J. Cassaigne},
  title = {Limit values of the recurrence quotient of Sturmian sequences},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {3--12}
}

@phdthesis{Cassaigne1994,
  author = {J. Cassaigne},
  title = {Motifs {\'e}vitables et r{\'e}gularit{\'e} dans les mots},
  school = {Universit{\'e} Paris 6, France},
  year = {1994}
}

@techreport{Cassaigne1994a,
  author = {J. Cassaigne},
  title = {Motifs {\'e}vitables et r{\'e}gularit{\'e} dans les mots},
  year = {1994},
  number = {LITP 94-04}
}

@article{Cassaigne1993,
  author = {J. Cassaigne},
  title = {Unavoidable binary patterns},
  journal = {Acta Inform.},
  year = {1993},
  volume = {30},
  number = {4},
  pages = {385--395}
}

@article{Castelli1999,
  author = {G. Castelli and F. Mignosi and A. Restivo},
  title = {{Fine and Wilf}'s theorem for three periods and a generalization of Sturmian words},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {83--94}
}

@article{Cattell2000,
  author = {K. Cattell and F. Ruskey and J. Sawada and M. Serra and C. R. Miers},
  title = {Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over {GF(2)}},
  journal = {J. Algorithms},
  year = {2000},
  volume = {37},
  number = {2},
  pages = {267--282}
}

@inproceedings{Cenk1994,
  author = {S. {Cenk Sahinalp} and U. Vishkin},
  title = {Symmetry Breaking for Suffix Tree Construction},
  booktitle = {Proceedings of the 26th ACM Symposium on the Theory of Computing},
  publisher = {ACM Press},
  year = {1994},
  pages = {300--309}
}

@inbook{Chavez2005,
  author = {E. Ch\'avez and G. Navarro},
  title = {Metric Databases},
  booktitle = {Encyclopedia of Database Technologies and Applications},
  publisher = {Idea Group Inc., Pennsylvania, USA},
  year = {2005},
  pages = {367-372}
}

@inproceedings{Champarnaud2002,
  author = {J.-M. Champarnaud and A. Khorsi and T. Parantho{\"e}n},
  title = {Split and join for minimizing: {B}rzozowski's algorithm },
  booktitle = {Proceedings of the Prague Stringology Conference~'02},
  year = {2002},
  pages = {96--104},
  note = {Research Report DC--2002--03}
}

@article{Champion1987,
  author = {D. M. Champion and J. Rothstein},
  title = {Immediate parallel solution of the longest common subsequence problem},
  journal = {ICPP},
  year = {1987},
  pages = {70--77}
}

@article{Chan1992,
  author = {S. C. Chan and A. K. C. Wong and D. K. Y. Chiu},
  title = {A survey of multiple sequence comparison methods},
  journal = {Bull. Math. Biol.},
  year = {1992},
  volume = {54},
  number = {4},
  pages = {563--598}
}

@inproceedings{Chang1992,
  author = {C.-H. Chang and R. Paige},
  title = {From regular expression to {DFA}'s using {NFA}'s},
  booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {664},
  pages = {90--110}
}

@article{Chang1993,
  author = {D. K. Chang},
  title = {A String Pattern-Matching Algorithm},
  journal = {J. Syst. Softw.},
  year = {1993},
  volume = {22},
  number = {3},
  pages = {207--?}
}

@inproceedings{Chang1994,
  author = {W.I. Chang and T. Marr},
  title = {Approximate String Matching with Local Similarity},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {259--273}
}

@phdthesis{Chang1991,
  author = {W. I. Chang},
  title = {Approximate pattern matching and biological applications},
  school = {University of California, Berkeley},
  year = {1991}
}

@inproceedings{Chang1992a,
  author = {W. I. Chang and J. Lampe},
  title = {Theoretical and empirical comparisons of approximate string matching algorithms},
  booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1992},
  number = {664},
  pages = {175--184}
}

@article{Chang1994a,
  author = {W. I. Chang and E. L. Lawler},
  title = {Sublinear Approximate String Matching and Biological Applications},
  journal = {Algorithmica},
  year = {1994},
  volume = {12},
  number = {4/5},
  pages = {327--344}
}

@inproceedings{Chang1990,
  author = {W. I. Chang and E. L. Lawler},
  title = {Approximated string matching in sublinear expected time},
  booktitle = {Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science},
  publisher = {IEEE Computer Society Press},
  year = {1990},
  pages = {116--124}
}

@inproceedings{Chao1994,
  author = {K-M. Chao},
  title = {Computing All Suboptimal Alignments in Linear Space},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {31--42}
}

@article{Chao1993,
  author = {K.-M. Chao and R. C. Hardison and W. Miller},
  title = {Locating well-conserved regions within a pairwise alignment},
  journal = {Comput. Appl. Biosci.},
  year = {1993},
  volume = {4},
  pages = {387--396}
}

@article{Chao1995,
  author = {K.-M. Chao and W. Miller},
  title = {Linear-space algorithms that build local alignments from fragments},
  journal = {Algorithmica},
  year = {1995},
  volume = {13},
  number = {1/2},
  pages = {106--134}
}

@article{Chao1995a,
  author = {K.-M. Chao and J. Zhang and J. Ostell and W. Miller},
  title = {A local alignment tool for very long {DNA} sequences},
  journal = {Comput. Appl. Biosci.},
  year = {1995},
  volume = {11},
  number = {2},
  pages = {147--154}
}

@inproceedings{Charatonic1991,
  author = {W. Charatonic and L. Pacholski},
  title = {Solving word equations in two variables},
  booktitle = {Proceedings IWWERT},
  publisher = {Springer-Verlag, Berlin},
  year = {1991},
  pages = {43--56}
}

@inproceedings{Charras1999,
  author = {C. Charras and T. Lecroq},
  title = {Java tools to help understanding pattern matching techniques},
  booktitle = {Proceedings of the 5th International Conference on Compute Aided Engineering Education},
  year = {1999},
  pages = {105--111}
}

@inproceedings{Charras1998,
  author = {C. Charras and T. Lecroq},
  title = {Exact string matching animation in Java},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'98},
  year = {1998},
  pages = {36--43},
  note = {Collaborative Report DC--98--06}
}

@misc{Charras1998a,
  author = {C. Charras and T. Lecroq},
  title = {Sequence comparison},
  year = {1998}
}

@techreport{Charras1997,
  author = {C. Charras and T. Lecroq},
  title = {Exact string matching animation in Java},
  year = {1997},
  number = {LIR 97.10}
}

@misc{Charras1996,
  author = {C. Charras and T. Lecroq},
  title = {Exact string matching algorithms},
  year = {1996}
}

@inproceedings{Charras1998b,
  author = {C. Charras and T. Lecroq and J.D. Pehoushek},
  title = {A Very Fast String Matching Algorithm for Small Alphabets and Long Patterns},
  booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1998},
  number = {1448},
  pages = {55--64}
}

@inproceedings{Chase1987,
  author = {D. Chase},
  title = {An improvement to bottom-up tree pattern matching},
  booktitle = {Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages},
  publisher = {ACM Press},
  year = {1987},
  pages = {168--177}
}

@inproceedings{Chavez1997,
  author = {E. Chavez and J.L. Marroqu\'in},
  title = {Proximity Queries in metric spaces},
  booktitle = {Proceedings of the 4th South American Workshop on String Processing},
  publisher = {Carleton University Press},
  year = {1997},
  pages = {21--36}
}

@article{Chen1992,
  author = {G. H. Chen},
  title = {An {\emph{O(1)}} time algorithm for string matching},
  journal = {Int. J. Comput. Math.},
  year = {1992},
  volume = {42},
  number = {3--4},
  pages = {185--191}
}

@incollection{Chen1985,
  author = {M. T. Chen and J. Seiferas},
  title = {Efficient and elegant subword tree construction},
  booktitle = {Combinatorial Algorithms on Words},
  publisher = {Springer-Verlag, Berlin},
  year = {1985},
  volume = {12},
  pages = {97--107}
}

@inproceedings{Chen1997,
  author = {T. Chen and S. S. Skiena},
  title = {Trie-based data structures for sequence assembly},
  booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1997},
  number = {1264},
  pages = {206--223}
}

@article{Chen2000,
  author = {W. Chen},
  title = {Multi-subsequence searching},
  journal = {Inf. Process. Lett.},
  year = {2000},
  volume = {74},
  number = {5--6}
}

@article{Cheng1987,
  author = {H. Cheng and K. Fu},
  title = {{VLSI} architectures for string matching and pattern matching},
  journal = {Pattern Recognit.},
  year = {1987},
  volume = {20},
  number = {1},
  pages = {125--141}
}

@article{Chin1994,
  author = {F. Y. L. Chin and C. K. Poon},
  title = {Performance Analysis of Some Simple Heuristics for Computing Longuest Common subsequences},
  journal = {Algorithmica},
  year = {1994},
  volume = {12},
  number = {4/5},
  pages = {293--311}
}

@article{Chin1990,
  author = {F. Y. L. Chin and C. K. Poon},
  title = {A fast algorithm for computing longest common subsequences of small alphabet size},
  journal = {J. Inform. Process.},
  year = {1990},
  volume = {13},
  number = {4},
  pages = {463--469}
}

@inproceedings{Chlebus1994,
  author = {B. S. Chlebus and L. G{\c a}sieniec},
  title = {Optimal pattern matching on meshes},
  booktitle = {Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {775},
  pages = {213--224}
}

@techreport{Chodorow1990,
  author = {M. Chodorow and J. L. Klarans},
  title = {Locating syntactic patterns in text corpora},
  year = {1990}
}

@techreport{Choffrut1993,
  author = {C. Choffrut},
  title = {The word problem for single relator special monoids - The state of art},
  year = {1993},
  number = {LITP 93.37}
}

@techreport{Choffrut1991,
  author = {C. Choffrut},
  title = {Combinatoire et g{\'e}nome},
  year = {1991},
  number = {LITP 91.72}
}

@article{Choffrut1990,
  author = {C. Choffrut},
  title = {An optimal algorithm for building the {Boyer-Moore} automaton},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1990},
  volume = {40},
  pages = {217--225}
}

@inproceedings{Choffrut1998,
  author = {C. Choffrut and S. Horwath},
  title = {Equations in Transfinite Strings},
  booktitle = {Proceedings of the 23rdSymposium on Mathematical Foundations of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1998},
  number = {1450},
  pages = {656--664}
}

@article{Choi1997,
  author = {Y. Choi and T. W. Lam},
  title = {Dynamic suffix tree and two-dimensional texts management},
  journal = {Inf. Process. Lett.},
  year = {1997},
  volume = {61},
  number = {4},
  pages = {213--220}
}

@inproceedings{Choi1995,
  author = {Y. Choi and T. W. Lam},
  title = {Two-Dimensional Pattern Matching on a Dynamic Library of Texts},
  booktitle = {Proceedings of the 1stAnnual International Conference on Computing and Combinatorics},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  number = {959},
  pages = {530--538}
}

@incollection{Chomsky1963,
  author = {N. Chomsky and M.-P. Sch{\"u}tzenberger},
  title = {The algebraic theory of context-free languages},
  booktitle = {Computer Programming and Formal Systems},
  publisher = {North-Holland},
  year = {1963},
  pages = {118--161}
}

@inproceedings{Chow1991,
  author = {E. T. Chow and T. Hunkapiller and J. C. Peterson and B. A. Zimmerman and M. S. Waterman},
  title = {A Systolic Array Processor for Biological Information Signal Processing},
  booktitle = {Proceedings of the International Conference on Supercomputing},
  year = {1991},
  pages = {216--223}
}

@article{Christodoulakis2005,
  author = {M. Christodoulakis and C. S. Iliopoulos and L. Mouchard and K. Perdikuri and A. Tsakalidis and K. Tsichlas},
  title = {Computation of Repetitions and Regularities on Biological Weighted Sequences},
  journal = {Journal of Computational Biology},
  year = {2005}
}

@article{Christodoulakis2005,
  author = {M. Christodoulakis and C. S. Iliopoulos and L. Mouchard and K. Perdikuri and A. Tsakalidis and K. Tsichlas},
  title = {Computation of Repetitions and Regularities on Biological Weighted Sequences},
  journal = {Journal of Computational Biology},
  year = {2005}
}

@inproceedings{Christodoulakis2004b,
  author = {M. Christodoulakis and C. S. Iliopoulos and L. Mouchard and K. Tsichlas},
  title = {Pattern Matching on Weighted Sequences},
  booktitle = {Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets'04)},
  publisher = {KCL publications},
  year = {2004}
}

@inproceedings{Christodoulakis2004b,
  author = {M. Christodoulakis and C. S. Iliopoulos and L. Mouchard and K. Tsichlas},
  title = {Pattern Matching on Weighted Sequences},
  booktitle = {Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets'04)},
  publisher = {KCL publications},
  year = {2004}
}

@article{Christodoulakis2005a,
  author = {M. Christodoulakis and C. S. Iliopoulos and K. Park and J. S. Sim},
  title = {Approximate Seeds of Strings},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {2005}
}

@article{Christodoulakis2005a,
  author = {M. Christodoulakis and C. S. Iliopoulos and K. Park and J. S. Sim},
  title = {Approximate Seeds of Strings},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {2005}
}

@article{Christodoulakis2004,
  author = {M. Christodoulakis and C. S. Iliopoulos and K. Park and J. S. Sim},
  title = {Implementing Approximate Regularities},
  journal = {Mathematical and Computer Modelling},
  year = {2004}
}

@article{Christodoulakis2004,
  author = {M. Christodoulakis and C. S. Iliopoulos and K. Park and J. S. Sim},
  title = {Implementing Approximate Regularities},
  journal = {Mathematical and Computer Modelling},
  year = {2004}
}

@inproceedings{Christodoulakis2004a,
  author = {M. Christodoulakis and C. S. Iliopoulos and K. Tsichlas and K. Perdikuri},
  title = {Searching for Regularities in Weighted Sequences},
  booktitle = {Lecture Series on Computer and Computational Sciences},
  year = {2004},
  pages = {701-704}
}

@inproceedings{Christodoulakis2004a,
  author = {M. Christodoulakis and C. S. Iliopoulos and K. Tsichlas and K. Perdikuri},
  title = {Searching for Regularities in Weighted Sequences},
  booktitle = {Lecture Series on Computer and Computational Sciences},
  year = {2004},
  pages = {701-704}
}

@article{Chrobak1987,
  author = {M. Chrobak and W. Rytter},
  title = {Remarks on string-matching and one-way multihead automata},
  journal = {Inf. Process. Lett.},
  year = {1987},
  volume = {24},
  number = {5},
  pages = {325--329}
}

@article{Chrobak1987a,
  author = {M. Chrobak and W. Rytter},
  title = {Unique decipherability for partially commutative alphabets},
  journal = {Fundam. Inform.},
  year = {1987},
  pages = {323--336}
}

@article{Chuan1993,
  author = {W.-F. Chuan},
  title = {Symmetric Fibonacci words},
  journal = {Fibonacci Quarterly},
  year = {1993},
  volume = {31},
  pages = {251--255}
}

@article{Chung1998,
  author = {K.-L. Chung},
  title = {An improved algorithm for solving the banded cyclic string-to-string correction problem},
  journal = {Theor. Comput. Sci.},
  year = {1998},
  volume = {201},
  number = {1--2},
  pages = {275--279},
  note = {Abstract}
}

@article{Chung1992,
  author = {K.-L. Chung},
  title = {A randomized parallel algorithm for string matching on hypercube},
  journal = {Pattern Recognit.},
  year = {1992},
  volume = {25},
  number = {10},
  pages = {1265--1268}
}

@article{Chung1987,
  author = {T.-C. Chung and J.-W. Cho},
  title = {History sensitive string for multiple alphabets},
  journal = {Inf. Process. Lett.},
  year = {1987},
  volume = {25},
  number = {3},
  pages = {183--188}
}

@techreport{Chv'atal1972,
  author = {V. Chv\'atal and D.A. Klarner and D.E. Knuth},
  title = {{Selected Combinatorial Research Problems}},
  year = {1972},
  number = {STAN--CS--72--292}
}

@article{Chv'atal1975,
  author = {V. Chv{\'a}tal and D. Sankoff},
  title = {Longest common subsequences of two random sequences},
  journal = {J. Appl. Probab},
  year = {1975},
  volume = {12},
  pages = {306--315}
}

@techreport{Chv'atal1975a,
  author = {V. Chv{\'a}tal and D. Sankoff},
  title = {Longest common subsequences of random sequences},
  year = {1975},
  number = {STAN--CS--75--477}
}

@inproceedings{Chavez2005b,
  author = {E. Ch{\'a}vez and K. Figueroa and G. Navarro},
  title = {Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order},
  booktitle = {Proceedings of the 4th Mexican International Conference on Artificial Intelligence (MICAI'05)},
  year = {2005},
  pages = {405--414}
}

@article{Chavez2005a,
  author = {E. Ch{\'a}vez and G. Navarro},
  title = {A Compact Space Decomposition for Effective Metric Indexing},
  journal = {Pattern Recognition Letters},
  year = {2005},
  volume = {26},
  number = {9},
  pages = {1363--1376}
}

@inproceedings{Clark1996,
  author = {D. R. Clark and J. I. Munro},
  title = {Efficient suffix trees on secondary storage},
  booktitle = {Proceedings of the 7th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1996},
  pages = {383--391}
}

@article{Cleary1984,
  author = {J. G. Cleary and I. H. Witten},
  title = {Data compression using adaptive coding and partial string matching},
  journal = {IEEE Trans. Comput.},
  year = {1984},
  volume = {32},
  pages = {396--402}
}

@inproceedings{Clifford2005,
  author = {P. Clifford and R. Clifford, and C. S. Iliopoulos},
  title = {Faster algorithms for \emph{(δ,γ)}-matching and related problems},
  booktitle = {Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05)},
  year = {2005}
}

@inproceedings{Clifford2005,
  author = {P. Clifford and R. Clifford, and C. S. Iliopoulos},
  title = {Faster algorithms for \emph{(δ,γ)}-matching and related problems},
  booktitle = {Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05)},
  year = {2005}
}

@inproceedings{Clifford2004b,
  author = {R. Clifford and R. Groult and C. Iliopoulos and R. Byrd},
  title = {Music retrieval algorithms for the lead sheet problem},
  booktitle = {Proceedings of the Sound and Music Computing International Conference 2004 (SMC'04)},
  year = {2004}
}

@inproceedings{Clifford2004b,
  author = {R. Clifford and R. Groult and C. Iliopoulos and R. Byrd},
  title = {Music retrieval algorithms for the lead sheet problem},
  booktitle = {Proceedings of the Sound and Music Computing International Conference 2004 (SMC'04)},
  year = {2004}
}

@inproceedings{Clifford2004c,
  author = {R. Clifford and C. Iliopoulos and K. Park},
  title = {Extending the Edit Distance for Musical Applications},
  booktitle = {Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms ((AWOCA'04)},
  year = {2004}
}

@inproceedings{Clifford2004c,
  author = {R. Clifford and C. Iliopoulos and K. Park},
  title = {Extending the Edit Distance for Musical Applications},
  booktitle = {Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms ((AWOCA'04)},
  year = {2004}
}

@article{Clifford2004,
  author = {R. Clifford and C. S. Iliopoulos},
  title = {Approximate String Matching for Music Analysis},
  journal = {Soft Computing},
  year = {2004}
}

@article{Clifford2004,
  author = {R. Clifford and C. S. Iliopoulos},
  title = {Approximate String Matching for Music Analysis},
  journal = {Soft Computing},
  year = {2004}
}

@incollection{Clifford2004a,
  author = {R. Clifford and T. Crawford, C. Iliopoulos and D. Meredith},
  title = {Problems in Computational Musicology},
  booktitle = {String Algorithmics},
  publisher = {King's College Publications},
  year = {2004}
}

@incollection{Clifford2004a,
  author = {R. Clifford and T. Crawford, C. Iliopoulos and D. Meredith},
  title = {Problems in Computational Musicology},
  booktitle = {String Algorithmics},
  publisher = {King's College Publications},
  year = {2004}
}

@article{Clift1986,
  author = {B. Clift and D. Haussler and R. McConnell and T. D. Schneider and G. D. Stormo},
  title = {Sequences landscapes},
  journal = {Nucleic Acids Res.},
  year = {1986},
  volume = {14},
  pages = {141--158}
}

@inproceedings{Cobbs1995,
  author = {A. L. Cobbs},
  title = {Fast approximate matching using suffix trees},
  booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1995},
  number = {937},
  pages = {41--54}
}

@inproceedings{Cobbs1994,
  author = {A. L. Cobbs},
  title = {Fast Identification of Approximately Matching Substrings},
  booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1994},
  number = {807},
  pages = {64--74}
}

@article{Cohen1998,
  author = {J. D. Cohen},
  title = {Hardware-assisted algorithm for full-text large-dictionary string matching using n-gram hashing},
  journal = {Inf. Process. Manage.},
  year = {1998},
  volume = {34},
  number = {4}
}

@inproceedings{Cohn1996,
  author = {M. Cohn and R. Khazan},
  title = {Parsing with Suffix and Prefix Dictionaries},
  booktitle = {Proceedings Data Compression Conference},
  publisher = {IEEE Computer Society Press},
  year = {1996},
  pages = {180--189}
}

@article{Cole1994,
  author = {R. Cole},
  title = {Tight bounds on the complexity of the {Boyer-Moore} string matching algorithm},
  journal = {SIAM J. Comput.},
  year = {1994},
  volume = {23},
  number = {5},
  pages = {1075--1091}
}

@inproceedings{Cole1991,
  author = {R. Cole},
  title = {Tight bounds on the complexity of the {Boyer-Moore} string matching algorithm},
  booktitle = {Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1991},
  pages = {224--233}
}

@inproceedings{Cole1990,
  author = {R. Cole},
  title = {A new proof of the linearity of the {Boyer-Moore} string-matching algorithm},
  booktitle = {3rd Maryland Theoretical Science Day},
  year = {1990},
  pages = {?--?}
}

@techreport{Cole1990a,
  author = {R. Cole},
  title = {Tight bounds on the complexity of the {Boyer-Moore} string matching algorithm},
  year = {1990},
  number = {512}
}

@inproceedings{Cole1993,
  author = {R. Cole and M. Crochemore and Z. Galil and L. G{\c a}sieniec and R. Hariharan and S. Muthukrishnan and K. Park and W. Rytter},
  title = {Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions},
  booktitle = {Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science},
  publisher = {IEEE Computer Society Press},
  year = {1993},
  pages = {248--258}
}

@inproceedings{Cole2000,
  author = {R. Cole and R. Hariharan},
  title = {Faster Suffix Tree Construction with Missing Suffix Links},
  booktitle = {Proceedings ACM Symposium on the Theory of Computing},
  year = {2000},
  pages = {407--415}
}

@inproceedings{Cole1999,
  author = {R. Cole and R. Hariharan},
  title = {Dynamic {LCA} Queries on Trees},
  booktitle = {Proceedings ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1999},
  pages = {235--244}
}

@inproceedings{Cole1998,
  author = {R. Cole and R. Hariharan},
  title = {Approximate String Matching: A Faster Simpler Algorithm},
  booktitle = {Proceedings of the 9th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {1998},
  pages = {463--472}
}

@inproceedings{Cole1997,
  author = {R. Cole and R. Hariharan},
  title = {Tree Pattern Matching and Subset Matching in Randomized \emph{O(n \log^3 m)} Time},
  booktitle = {Proceedings of the 29th ACM Symposium on the Theory of Computing},
  year = {1997},
  pages = {66--75}
}

@article{Cole1997a,
  author = {R. Cole and R. Hariharan},
  title = {Tighter Upper Bounds on the Exact Complexity of String Matching},
  journal = {SIAM J. Comput.},
  year = {1997},
  volume = {26},
  number = {3},
  pages = {803--856}
}

@inproceedings{Cole1992,
  author = {R. Cole and R. Hariharan},
  title = {Tighter bounds on the exact complexity of string matching},
  booktitle = {Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science},
  publisher = {IEEE Computer Society Press},
  year = {1992},
  pages = {600--609}
}

@article{Cole1995,
  author = {R. Cole and R. Hariharan and M. Paterson and U. Zwick},
  title = {Tighter lower bounds on the exact complexity of string matching},
  journal = {SIAM J. Comput.},
  year = {1995},
  volume = {24},
  number = {1},
  pages = {30--45}
}

@inproceedings{Cole1993a,
  author = {R. Cole and R. Hariharan and M. Paterson and U. Zwick},
  title = {Which patterns are hard to find ?},
  booktitle = {Proceedings of the 2nd Israeli Symposium on Theory of Computing and Systems},
  publisher = {IEEE Computer Society Press},
  year = {1993},
  pages = {59--68}
}

@article{Cole2003,
  author = {R. Cole and C. S. Iliopoulos and T. Lecroq and W. Plandowski and W. Rytter},
  title = {On Special Families of Morphisms Related to \emph{\delta}-Matching and Don't Care Symbols},
  journal = {Inf. Process. Lett.},
  year = {2003},
  volume = {85},
  number = {5},
  pages = {227--233}
}

@inproceedings{Cole2001,
  author = {R. Cole and C. S. Iliopoulos and T. Lecroq and W. Plandowski and W. Rytter},
  title = {Relations between \emph{\delta}-matching and matching with don't care symbols: \emph{\delta}-distinguishing morphisms},
  booktitle = {Proceedings of the 12th Australasian Workshop On Combinatorial Algorithms},
  year = {2001},
  pages = {80--87}
}

@article{Cole2005,
  author = {R. Cole and C. S. Iliopoulos and M. Mohamed and W. F. Smyth and L. Yang},
  title = {The Complexity of the Minimum k-Cover Problem},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {2005}
}

@article{Cole2005,
  author = {R. Cole and C. S. Iliopoulos and M. Mohamed and W. F. Smyth and L. Yang},
  title = {The Complexity of the Minimum k-Cover Problem},
  journal = {Journal of Automata, Languages and Combinatorics},
  year = {2005}
}

@incollection{Collins1987,
  author = {J. F. Collins and A. F. W. Coulson},
  title = {Molecular sequence comparison and alignments},
  booktitle = {Nucleic acid and protein sequence analysis: A practical approach},
  publisher = {IRL Press},
  year = {1987},
  pages = {323--358}
}

@article{Colussi1994,
  author = {L. Colussi},
  title = {Fastest pattern matching in strings},
  journal = {J. Algorithms},
  year = {1994},
  volume = {16},
  number = {2},
  pages = {163--189}
}

@article{Colussi1991,
  author = {L. Colussi},
  title = {Correctness and efficiency of the pattern matching algorithms},
  journal = {Inf. Comput.},
  year = {1991},
  volume = {95},
  number = {2},
  pages = {225--251}
}

@article{Colussi1996,
  author = {L. Colussi and A. De Col},
  title = {A time and space efficient data structure for sring searching on large texts},
  journal = {Inf. Process. Lett.},
  year = {1996},
  volume = {58},
  number = {5},
  pages = {217--222}
}

@inproceedings{Colussi1990,
  author = {L. Colussi and Z. Galil and R. Giancarlo},
  title = {On the exact complexity of string matching},
  booktitle = {Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science},
  publisher = {IEEE Computer Society Press},
  year = {1990},
  pages = {135--144}
}

@article{Colussi1996a,
  author = {L. Colussi and L. Toniolo},
  title = {How the character comparison order shapes the shift function of on-line pattern matching algorithms},
  journal = {Theor. Comput. Sci.},
  year = {1996},
  volume = {163},
  number = {1--2},
  pages = {117--144}
}

@inproceedings{Commentz-Walter1979,
  author = {B. Commentz-Walter},
  title = {A string matching algorithm fast on the average},
  booktitle = {Proceedings of the 6th International Colloquium on Automata, Languages and Programming},
  publisher = {Springer-Verlag, Berlin},
  year = {1979},
  number = {71},
  pages = {118--132}
}

@techreport{Commentz-Walter1979a,
  author = {B. Commentz-Walter},
  title = {A string matching algorithm fast on the average},
  year = {1979},
  number = {79.09.007}
}

@article{Consel1989,
  author = {C. Consel and O. Danvy},
  title = {Partial evaluation of pattern matching in strings},
  journal = {Inf. Process. Lett.},
  year = {1989},
  volume = {30},
  number = {2},
  pages = {79--86}
}

@inproceedings{Cook1971,
  author = {Cook},
  title = {Linear time simulation of deterministic two-way pushdown automata},
  booktitle = {Proceedings of the 5th IFIP World Computer Congress},
  year = {1971},
  pages = {172--179}
}

@inproceedings{Copeland1978,
  author = {G. P. Copeland},
  title = {String storage and searching database applications: implementation on the INDY backend kernel},
  booktitle = {Proceedings of the 4th Workshop on Computer Architecture for Non-numeric Processing},
  publisher = {ACM Press},
  year = {1978},
  pages = {8--17}
}

@article{Core1989,
  author = {N. G. Core and E. W. Edmiston and J. H. Saltz and R. M. Smith},
  title = {Supercomputers and Biological Sequence Comparison Algorithms},
  journal = {Comp. Biomed. Res.},
  year = {1989},
  volume = {22},
  pages = {497--515}
}

@article{Cori1985,
  author = {R. Cori and D. Perrin},
  title = {Automates et commutations partielles},
  journal = {RAIRO Inform. Th{\'e}or.},
  year = {1985},
  volume = {19},
  number = {1},
  pages = {21--32}
}

@book{Cormen1990,
  author = {T. H. Cormen and C. E. Leiserson and R. L. Rivest},
  title = {Introduction to Algorithms},
  publisher = {MIT Press},
  year = {1990}
}

@article{Corpet1988,
  author = {F. Corpet},
  title = {Multiple sequence alignment with hierarchical clustering},
  journal = {Nucleic Acids Res.},
  year = {1988},
  volume = {16},
  pages = {10881--10890}
}

@article{Coward1998,
  author = {E. Coward and F. Drabl{\o}s},
  title = {Detecting periodic patterns in biological sequences},
  journal = {Bioinformatics},
  year = {1998},
  volume = {14},
  number = {6},
  pages = {498--507}
}

@article{Craven1988,
  author = {T. C. Craven},
  title = {Adapting of String Indexing Systems for Retrieval using Proximity Operators},
  journal = {Inf. Process. Manage.},
  year = {1988},
  volume = {24},
  number = {2},
  pages = {133--140}
}

@book{Craven1986,
  author = {T. C. Craven},
  title = {String Indexing},
  publisher = {Academic Press},
  year = {1986}
}

@article{Crochemore2003,
  author = {M. Crochemore},
  title = {Reducing Space for Index Implementation},
  journal = {Theor. Comput. Sci.},
  year = {2003},
  volume = {292},
  number = {1},
  pages = {185--197}
}

@incollection{Crochemore1997,
  author = {M. Crochemore},
  title = {Off-line serial exact string searching},
  booktitle = {Pattern matching algorithms},
  publisher = {Oxford University Press},
  year = {1997},
  pages = {1--53}
}

@techreport{Crochemore1993,
  author = {M. Crochemore},
  title = {Off-line serial exact string searching},
  year = {1993},
  number = {93.1}
}

@article{Crochemore1992,
  author = {M. Crochemore},
  title = {String-matching on ordered alphabets},
  journal = {Theor. Comput. Sci.},
  year = {1992},
  volume = {92},
  number = {1},
  pages = {33--47}
}

@inproceedings{Crochemore1990,
  author = {M. Crochemore},
  title = {A la recherche d'un mot},
  booktitle = {Actes des Journ{\'e}es Montoises},
  year = {1990},
  pages = {34--38}
}

@inproceedings{Crochemore1990a,
  author = {M. Crochemore},
  title = {Constant-space string-matching},
  booktitle = {Sequences, combinatorics, compression, security and transmission},
  publisher = {Springer-Verlag, Berlin},
  year = {1990},
  pages = {25--40}
}

@incollection{Crochemore1989,
  author = {M. Crochemore},
  title = {Data compression with substitution},
  booktitle = {Electronic, Dictionaries and Automata in Computational Linguistics},
  publisher = {Springer-Verlag, Berlin},
  year = {1989},
  number = {377},
  pages = {1--16}
}

@incollection{Crochemore1989a,
  author = {M. Crochemore},
  title = {Automata and algorithms},
  booktitle = {Formal Properties of Finite Automata and Applications},
  publisher = {Springer-Verlag, Berlin},
  year = {1989},
  number = {386},
  pages = {149--153}
}

@article{Crochemore1989b,
  author = {M. Crochemore},
  title = {String-matching and periods},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1989},
  volume = {39},
  pages = {149--153}
}

@inproceedings{Crochemore1988,
  author = {M. Crochemore},
  title = {String matching with constraints},
  booktitle = {Proceedings 13th Symposium on Mathematical Foundations of Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1988},
  number = {324},
  pages = {44--58}
}

@inproceedings{Crochemore1988a,
  author = {M. Crochemore},
  title = {Constant-space string-matching},
  booktitle = {Proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science},
  publisher = {Springer-Verlag, Berlin},
  year = {1988},
  number = {338},
  pages = {80--87}
}

@techreport{Crochemore1988b,
  author = {M. Crochemore},
  title = {Compression de textes: les m{\'e}thodes},
  year = {1988},
  number = {LIPN 88--4}
}

@incollection{Crochemore1987,
  author = {M. Crochemore},
  title = {Longest common factor of two words},
  booktitle = {Proceedings of the 2nd Theory and Practice of Software Development},
  publisher = {Springer-Verlag, Berlin},
  year = {1987},
  number = {249},
  pages = {26--36}
}

@article{Crochemore1986,
  author = {M. Crochemore},
  title = {Transducers and repetitions},
  journal = {Theor. Comput. Sci.},
  year = {1986},
  volume = {45},
  number = {1},
  pages = {63--86}
}

@inproceedings{Crochemore1986a,
  author = {M. Crochemore},
  title = {Calcul de la f-distance de deux mots},
  booktitle = {Actes du s{\'e}minaire d'informatique th{\'e}orique du {L.I.T.P.}},
  publisher = {Universit{\'e}s Paris 6 et 7, France},
  year = {1986},
  pages = {25--36}
}

@article{Crochemore1986b,
  author = {M. Crochemore},
  title = {Computing {LCF} in linear time},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1986},
  volume = {30},
  pages = {57--61}
}

@incollection{Crochemore1985,
  author = {M. Crochemore},
  title = {Optimal factor tranducers},
  booktitle = {Combinatorial Algorithms on Words},
  publisher = {Springer-Verlag, Berlin},
  year = {1985},
  volume = {12},
  pages = {31--44}
}

@article{Crochemore1984,
  author = {M. Crochemore},
  title = {Linear searching for a square in a word},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1984},
  volume = {24},
  pages = {66--72}
}

@incollection{Crochemore1983,
  author = {M. Crochemore},
  title = {Tests sur les morphismes faiblement sans carr{\'e}},
  booktitle = {Combinatorics on Words},
  publisher = {Academic Press},
  year = {1983},
  pages = {63--89}
}

@article{Crochemore1983a,
  author = {M. Crochemore},
  title = {Recherche lin{\'e}aire d'un carr{\'e} dans un mot},
  journal = {Comptes Rendus Acad. Sci. Paris S{\'e}r. I Math.},
  year = {1983},
  volume = {296},
  pages = {781--784}
}

@phdthesis{Crochemore1983b,
  author = {M. Crochemore},
  title = {R{\'e}gularit{\'e}s {\'e}vitables},
  school = {Universit{\'e} Paris 7, France},
  year = {1983}
}

@article{Crochemore1983c,
  author = {M. Crochemore},
  title = {A solution to {P12}},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1983},
  volume = {19},
  pages = {15--16}
}

@article{Crochemore1983d,
  author = {M. Crochemore},
  title = {Recherche lin{\'e}aire d'un carr{\'e} dans un mot},
  journal = {Comptes Rendus Acad. Sci. Paris S{\'e}r. I Math.},
  year = {1983},
  volume = {T. 296},
  pages = {781--784}
}

@article{Crochemore1983e,
  author = {M. Crochemore},
  title = {Mots et morphismes sans carr{\'e}},
  journal = {Ann. Discret. Math.},
  year = {1983},
  volume = {17},
  pages = {235--245}
}

@article{Crochemore1982,
  author = {M. Crochemore},
  title = {Sharp Characterizations of Squarefree Morphisms},
  journal = {Theor. Comput. Sci.},
  year = {1982},
  volume = {18},
  number = {2},
  pages = {221--226}
}

@techreport{Crochemore1982a,
  author = {M. Crochemore},
  title = {R{\'e}sultats de d{\'e}cidabilit{\'e} pour les morphismes faiblement sans carr{\'e}},
  year = {1982},
  number = {LITP 82-38}
}

@techreport{Crochemore1982b,
  author = {M. Crochemore},
  title = {Sur les ensembles in{\'e}vitables},
  year = {1982},
  number = {LITP 82-56}
}

@article{Crochemore1982c,
  author = {M. Crochemore},
  title = {A solution to {Berstel}'s problem {P3}},
  journal = {Bull. Eur. Assoc. Theor. Comput. Sci.},
  year = {1982},
  volume = {18},
  pages = {9--11}
}

@article{Crochemore1981,
  author = {M. Crochemore},
  title = {An optimal algorithm for computing the repetitions in a word},
  journal = {Inf. Process. Lett.},
  year = {1981},
  volume = {12},
  number = {5},
  pages = {244--250}
}

@techreport{Crochemore1980,
  author = {M. Crochemore},
  title = {D{\'e}termination optimale des r{\'e}p{\'e}titions dans un mot},
  year = {1980},
  number = {LITP 80-53}
}

@article{Crochemore1989c,
  author = {M. Crochemore and J. Berstel and J.-E. Pin},
  title = {Thue-Morse sequence and p-adic topology of the free monoid},
  journal = {Ann. Discret. Math.},
  year = {1989},
  volume = {76},
  pages = {89--94}
}

@article{Crochemore1991,
  author = {M. Crochemore and M. Chytil and B. Monien and W. Rytter},
  title = {On the parallel recognition of unambiguous context-free languages},
  journal = {Theor. Comput. Sci.},
  year = {1991},
  volume = {81},
  number = {2},
  pages = {311--316}
}