Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
---|---|---|---|---|---|

Šimánek, M. | The factor automaton [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@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} } |
|||||

Aalbersberg, I. J. & Rozenberg, G. | Theory of traces [BibTeX] |
1988 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Aalbersberg, I. J. & Welzl, E. | Trace languages defined by regular string languages [BibTeX] |
1986 | RAIRO Inform. Théor. | article | |

BibTeX:
@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} } |
|||||

Abdeddaïm, S. | Algorithms and experiments on transitive closure, path cover, and multiple sequence alignment [BibTeX] |
2000 | Proceedings of the 2nd Algorithm Engineering and Experiments | inproceedings | |

BibTeX:
@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} } |
|||||

Abdeddaïm, S. | On incremental computation of transitive closure and greedy alignment [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Abdeddaïm, S. | Comparaison de séquences biologiques [BibTeX] |
1996 | School: Université Paris 6 |
phdthesis | |

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

Abdeddaïm, S. | Comparaison de séquences biologiques [BibTeX] |
1996 | techreport | ||

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

Abrahamson, K. | Generalized string matching [BibTeX] |
1987 | SIAM J. Comput. | article | |

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

Adiego, J., Navarro, G. & de la Fuente, P. | Lempel-Ziv Compression of Highly Structured Documents [BibTeX] |
2007 | Journal of the American Society for Information Science and Technology (JASIST) | article | |

BibTeX:
@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} } |
|||||

Adiego, J., Navarro, G. & de la Fuente, P. | Using Structural Contexts to Compress Semistructured Text Collections [BibTeX] |
2007 | Information Processing and Management (IPM) | article | |

BibTeX:
@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} } |
|||||

Agostino, S. D. | A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@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} } |
|||||

Aho, A. V. | Algorithms for finding patterns in strings [BibTeX] |
1990 | Handbook of Theoretical Computer Science, Algorithms and complexity | incollection | |

BibTeX:
@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} } |
|||||

Aho, A. V. | Pattern matching in strings [BibTeX] |
1980 | Formal Language Theory: Perspectives and Open Problems | incollection | |

BibTeX:
@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} } |
|||||

Aho, A. V. & Corasick, M. J. | Efficient string matching: an aid to bibliographic search [BibTeX] |
1975 | Commun. ACM | article | |

BibTeX:
@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} } |
|||||

Aho, A. V. & Ganapathy, M. | Efficient tree pattern matching: an aid to Code Generation [BibTeX] |
1985 | Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages | inproceedings | |

BibTeX:
@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} } |
|||||

Aho, A. V., Hirschberg, D. S. & Ullman, J. D. | Bounds on the complexity of the longest common subsequence problem [BibTeX] |
1976 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@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} } |
|||||

Aho, A. V., Hopcroft, J. E. & Ullman, J. D. | Data structures and algorithms [BibTeX] |
1983 | book | ||

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

Aho, A. V., Hopcroft, J. E. & Ullman, J. D. | On finding lowest common ancestors in trees [BibTeX] |
1976 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Aho, A. V., Hopcroft, J. E. & Ullman, J. D. | The design and analysis of computer algorithms [BibTeX] |
1974 | book | ||

BibTeX:
@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} } |
|||||

Aho, A. V., Kernighan, B. W. & Weinberger, P. J. | The AWK programming language [BibTeX] |
1988 | book | ||

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

Aho, A. V. & Paterson, T. G. | A minimum distance error-correcting parser for context-free languages [BibTeX] |
1972 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Aho, A. V., Sethi, R. & Ullman, J. D. | Compilers -- Principles, Techniques and Tools [BibTeX] |
1986 | book | ||

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

Aho, A. V. & Ullman, J. D. | Principles of compiler design [BibTeX] |
1977 | book | ||

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

Akutsu, T. | Approximate string matching with don't care characters [BibTeX] |
1995 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Akutsu, T. | Approximate string matching with don't care symbols [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Akutsu, T. | A linear time pattern matching algorithm between a string and a tree [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Akutsu, T., Kanaya, K., Ohyama, A. & Fujiyama, A. | Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Alberga, C. N. | String similarity and misspellings [BibTeX] |
1967 | Commun. ACM | article | |

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

Alexander, K. S. | Shortest Common Superstring for Strings of Random Letters [BibTeX] |
1994 | 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Alizadeh, F., Karp, R. M., Newberg, L. A. & Weisser, D. K. | Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Allauzen, C., Crochemore, M. & Raffinot, M. | Factor oracle: a new structure for pattern matching [BibTeX] |
1999 | SOFSEM'99, Theory and Practice of Informatics | inproceedings | |

BibTeX:
@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} } |
|||||

Allauzen, C. & Raffinot, M. | Simple Optimal String Matching Algorithm [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Allauzen, C. & Raffinot, M. | Simple Optimal String Matching Algorithm [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Allison, L. | Information-theoretic sequence alignment. [BibTeX] |
1998 | techreport | ||

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

Allison, L. | Using Hirschberg's algorithm to generate random alignments of strings [BibTeX] |
1994 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Allison, L. | A Fast Algorithm for the Alignment of Three Strings [BibTeX] |
1993 | J. Theor. Biol. | article | |

BibTeX:
@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} } |
|||||

Allison, L. & Dix, T. I. | A bit string longest common subsequence algorithm [BibTeX] |
1986 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Allison, L., Edgoose, T. & Dix, T. I. | Compression of strings with approximate repeats. [BibTeX] |
1998 | Proceedings International Conference on Intelligent Systems for Molecular Biology | inproceedings | |

BibTeX:
@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} } |
|||||

Allison, L., Powell, D. & Dix, T. I. | Compression and approximate matching. [BibTeX] |
1999 | Comput. J. | article | |

BibTeX:
@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} } |
|||||

Allison, L. & Wallace, C. S. | An information measure for the string to string correction problem with applications [BibTeX] |
1994 | Aust. Comput. Sci. Commun. | article | |

BibTeX:
@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} } |
|||||

Allison, L., Wallace, C. S. & Yee, C. N. | Finite-state models in the alignment of macromolecules [BibTeX] |
1992 | J. Mol. Evol. | article | |

BibTeX:
@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} } |
|||||

Allison, L., Wallace, C. S. & Yee, C. N. | Induction inference over macro--molecules [BibTeX] |
1990 | techreport | ||

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

Allison, L. & Yee, C. N. | Minimum message length encoding and the comparison of Macromolecules [BibTeX] |
1990 | Bull. Math. Biol. | article | |

BibTeX:
@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} } |
|||||

de Almeida, N. F. & Barbosa, V. C. | A string-matching algorithm for the CREW PRAM [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Alstrup, A., Brodal, G. S. & Rauhe, T. | Pattern Matching in Dynamic Texts [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Alt, H., Mehlhorn, K. & Munro, J. I. | Partial match retrieval in implicit data structures [BibTeX] |
1984 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. | A protein alignment scoring system sensitive to all evolutionary distances [BibTeX] |
1993 | J. Mol. Evol. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. | Amino acid substitution matrices from an information theoretic perspective [BibTeX] |
1991 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. | Gap costs for multiple sequence alignment [BibTeX] |
1989 | J. Theor. Biol. | article | |

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

Altschul, S. F., Carroll, R. J. & Lipman, D. J. | Weights for data related by a tree [BibTeX] |
1989 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. & Erickson, B. W. | A Nonlinear Measure of Subalignment Similarity and its Signifiance Level [BibTeX] |
1986 | Bull. Math. Biol. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. & Erickson, B. W. | Optimal Sequence Alignment Using Affine Gap Costs [BibTeX] |
1986 | Bull. Math. Biol. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F., Gish, W., Miller, W., Myers, E. W. & Lipman, D. J. | A basic local alignment search tool [BibTeX] |
1990 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. & Lipman, D. J. | Protein database searches for multiple alignments [BibTeX] |
1990 | Proc. Natl. Acad. Sci. U.S.A. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F. & Lipman, D. J. | Trees, stars, and multiple biological sequence alignment [BibTeX] |
1989 | SIAM J. Appl. Math. | article | |

BibTeX:
@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} } |
|||||

Altschul, S. F., Madden, T. L., Schaffer, A. A., Zhang, J., Zhang, Z., Miller, W. & Lipman, D. J. | Gapped Blast and Psi-Blast: a new generation of protein database search programs [BibTeX] |
1997 | Nucleic Acids Res. | article | |

BibTeX:
@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} } |
|||||

Amir, A. | Multidimensional pattern matching [BibTeX] |
1991 | unpublished | ||

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

Amir, A. | Multidimensional and relative approximate pattern matching [BibTeX] |
1987 | techreport | ||

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

Amir, A., Apostolico, A. & Lewenstein, M. | Inverse Pattern Matching [BibTeX] |
1997 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Aumann, Y., G, L., Lewenstein, M. & Lewenstein, N. | Pattern Matching with Swaps [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Aumann, Y., G, L., Lewenstein, M. & Lewenstein, N. | Pattern Matching with Swaps [BibTeX] |
1997 | Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A. & Benson, G. | Two-Dimensional Periodicity in Rectangular Arrays [BibTeX] |
1998 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Amir, A. & Benson, G. | Two-dimensional periodicity and its applications [BibTeX] |
1992 | Proceedings of the 3rd ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Optimal Parallel Two Dimensional Text Searching on a CREW PRAM [BibTeX] |
1998 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Optimal two-dimensional compressed matching [BibTeX] |
1997 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files [BibTeX] |
1996 | J. Comput. Syst. Sci. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Optimal two-dimensional compressed matching [BibTeX] |
1994 | Proceedings of the 21st International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | An alphabet independent approach to two-dimensional pattern matching [BibTeX] |
1994 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files [BibTeX] |
1994 | Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Optimal parallel two-dimensional pattern matching [BibTeX] |
1993 | Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files [BibTeX] |
1993 | techreport | ||

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | Alphabet independent two dimensional matching [BibTeX] |
1992 | Proceedings of the 24th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Benson, G. & Farach, M. | The truth, the whole truth and nothing but the truth: alphabet independent 2-d witness table construction [BibTeX] |
1992 | techreport | ||

BibTeX:
@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} } |
|||||

Amir, A., Butman, A., Crochemore, M., Landau, G. M. & Schaps, M. | Two-dimensional Pattern Matching with Rotations [BibTeX] |
2004 | Theoretical Computer Science | article | |

BibTeX:
@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} } |
|||||

Amir, A., Butman, A. & Lewenstein, M. | Real Scaled Matching [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A. & Calinescu, G. | Alphabet Independent and Dictionary Scaled Matching [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Chencinski, E., Iliopoulos, C. S., Kopelowitz, T. & Zhang, H. | Property matching and weighted matching [BibTeX] |
2006 | Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06) | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A. & Calinescu, G. | Alphabet Independent and Dictionary Scaled Matching [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A. & Calinescu, G. | Faster Scaled Matching [BibTeX] |
1993 | techreport | ||

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

Amir, A. & Farach, M. | Two dimensional matching [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@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} } |
|||||

Amir, A. & Farach, M. | Efficient 2-dimensional approximate matching of half-rectangular figures [BibTeX] |
1995 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Amir, A. & Farach, M. | Two-dimensional dictionary matching [BibTeX] |
1992 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Amir, A. & Farach, M. | Adaptative dictionary matching [BibTeX] |
1991 | Proceedings of the 32nd IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A. & Farach, M. | Efficient 2-dimensional approximate matching of non-rectangular figures [BibTeX] |
1991 | Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Farach, M., Galil, Z., Giancarlo, R. & Park, K. | Fully dynamic dictionary matching [BibTeX] |
1994 | J. Comput. Syst. Sci. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Farach, M., Idury, R., La Poutré, J. & Schäffer, A. | Improved dynamic dictionary matching [BibTeX] |
1995 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Farach, M., Idury, R., La Poutré, J. & Schäffer, A. | Improved dynamic dictionary matching [BibTeX] |
1993 | Proceedings of the 4th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Farach, M. & Matias, Y. | Efficient randomized dictionary matching algorithms [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Farach, M. & Muthukrishnan, S. | Alphabet dependence in parameterized matching [BibTeX] |
1994 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Farach, M. & Muthukrishnan, Y. | Alphabet Dependence in Parametrized Matching [BibTeX] |
1993 | techreport | ||

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

Amir, A., Iliopoulos, C. S., Kapah, O. & Porat, E. | Approximate matching in weighted sequences [BibTeX] |
2006 | Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06) | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Keselman, D., Landau, G. M., Lewenstein, M., Lewenstein, N. & Rodeh, M. | Text Indexing and Dictionary Matching with One Error [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Landau, G., Lewenstein, M. & Lewenstein, N. | Efficient Special Cases of Pattern Matching with Swaps [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Landau, G., Lewenstein, M. & Lewenstein, N. | Efficient Special Cases of Pattern Matching with Swaps [BibTeX] |
1998 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Amir, A. & Landau, G. M. | Fast parallel and serial multidimensional approximate array matching [BibTeX] |
1991 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Amir, A., Landau, G. M. & Sokol, D. | Inplace Run-Length 2d Compressed Search [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Landau, G. M. & Vishkin, U. | Efficient pattern matching with scaling [BibTeX] |
1992 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Landau, G. M. & Vishkin, U. | Efficient pattern matching with scaling [BibTeX] |
1990 | Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Lewenstein, M. & Lewenstein, N. | Pattern Matching in Hypertext [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Amir, A., Lewenstein, M. & Lewenstein, N. | Pattern Matching In Hypertext [BibTeX] |
1997 | Proceedings of the 5th Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@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} } |
|||||

Amir, A., Lewenstein, M. & Porat, E. | Faster Algorithms for String Matching with k Mismatches [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Anderson, A., Hagerup, T., Hastad, J. & Petersson, O. | The complexity of searching a sorted array of strings [BibTeX] |
1994 | Proceedings of the 26th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Andersson, A., Larsson, N. J. & Swanson, K. | Suffix Trees on Words [BibTeX] |
1999 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Andersson, A., Larsson, N. J. & Swanson, K. | Suffix Trees on Words [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Andersson, A. & Nilsson, S. | Faster Searching in Tries and Quadtrees---An Analysis of Level Compression [BibTeX] |
1994 | Proceedings of the 2nd Annual European Symposium | inproceedings | |

BibTeX:
@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} } |
|||||

Andersson, A. & Nilsson, S. | Improved behavior of tries by adaptive branching [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Ando, K., Iwasaki, K., Fuketa, M. & Aoe, J. | A fast morphological analysis using the extended AC machine for oriental languages [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@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} } |
|||||

Ando, K., Shishibori, M. & Aoe, J. | An efficient multi-attribute pattern matching machine [BibTeX] |
1996 | Proceedings of the Prague Stringologic Club Workshop~'96 | inproceedings | |

BibTeX:
@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} } |
|||||

Andrade, M. V. A. | Métodos eficientes para reconhecimento de padrões em Texto (in portuguese) [BibTeX] |
1993 | School: UNICAMP, Campinas, Brazil |
mastersthesis | |

BibTeX:
@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} } |
|||||

Andrejková, G. | The Set-Set closest common subsequence problem [BibTeX] |
2000 | Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia | inproceedings | |

BibTeX:
@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} } |
|||||

Andrejková, G. | The closest common subsequence problems [BibTeX] |
1999 | Proceedings of the Prague Stringology Club Workshop~'99 | inproceedings | |

BibTeX:
@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} } |
|||||

Andrejková, G. | The longest restricted common subsequence problem [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@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} } |
|||||

Andrejková, G. | Systolic systems for the longest common subsequence problem [BibTeX] |
1986 | Computers and Artificial Intelligence | article | |

BibTeX:
@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} } |
|||||

Angell, R. C., Freund, G. E. & Willet, P. | Automatic spelling correction using a trigram measure [BibTeX] |
1993 | Inf. Process. Manage. | article | |

BibTeX:
@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} } |
|||||

Angluin, D. | Finding patterns common to a set of strings [BibTeX] |
1980 | J. Comput. Syst. Sci. | article | |

BibTeX:
@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} } |
|||||

Angluin, D. | Finding patterns common to a set of strings [BibTeX] |
1979 | Proceedings of the 11th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Anson, E. L. & Myers, E. W. | ReAligner: A Program for Refining DNA Sequence Multi-Alignments [BibTeX] |
1997 | Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Antoniou, P., Holub, J., Iliopoulos, C. S., Melichar, B. & Peterlongo, P. | Finding Common Motifs with Gaps using Finite Automata [BibTeX] |
2006 | Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06) | inproceedings | |

BibTeX:
@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} } |
|||||

Antoniou, P., Holub, J., Iliopoulos, C. S., Melichar, B. & Peterlongo, P. | Finding Common Motifs with Gaps using Finite Automata [BibTeX] |
2006 | Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06) | inproceedings | |

BibTeX:
@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} } |
|||||

Aoe, J. | An efficient implementation of string pattern matching machines for a finite number of keywords [BibTeX] |
1989 | SIGIR Forum | article | |

BibTeX:
@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} } |
|||||

Aoe, J. | An Efficient Implementation of Static String Pattern Matching Machines [BibTeX] |
1989 | IEEE Trans. Softw. Eng. | article | |

BibTeX:
@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} } |
|||||

Aoe, J. | An Efficient Digital Search Algorithm by Using a Double-Array Structure [BibTeX] |
1989 | IEEE Trans. Softw. Eng. | article | |

BibTeX:
@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} } |
|||||

Aoe, J., Morimoto, K. & Sato, T. | An Efficient Implementation of Trie Structure [BibTeX] |
1992 | Softw. Pract. Exp. | article | |

BibTeX:
@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} } |
|||||

Aoe, J., Yamamoto, Y. & Shimada, R. | An efficient implementation of static string pattern matching machines [BibTeX] |
1985 | Proceedings of the 1st International Conference on Supercomputing | inproceedings | |

BibTeX:
@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} } |
|||||

Aoe, J., Yamamoto, Y. & Shimada, R. | A method for improving string pattern matching machines [BibTeX] |
1984 | IEEE Trans. Softw. Eng. | article | |

BibTeX:
@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} } |
|||||

Aoe, J., Yasutome, Y. & Sato, T. | An efficient digital search algorithm by using a double-array structure [BibTeX] |
1988 | Proceedings of the 12th International Conference on Computer Software and Applications | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A. | General Pattern Matching [BibTeX] |
1998 | Algorithms and Theory of Computation Handbook | incollection | |

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

Apostolico, A. | On-line string searching [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

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

Apostolico, A. | String Editing and Longest Common Subsequences [BibTeX] |
1997 | Handbook of Formal Languages | incollection | |

BibTeX:
@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} } |
|||||

Apostolico, A. | Efficient CRCW-PRAM algorithms for universal substring searching [BibTeX] |
1993 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. | Fast parallel detection of squares in strings [BibTeX] |
1992 | Algorithmica | article | |

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

Apostolico, A. | Optimal parallel detection of squares in string [BibTeX] |
1990 | techreport | ||

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

Apostolico, A. | Remark on the Hsu-Du new algorithm for the longest common subsequence problem [BibTeX] |
1987 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. | Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings [BibTeX] |
1986 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. | Parallel Log--Time Construction of Suffix Trees [BibTeX] |
1986 | techreport | ||

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

Apostolico, A. | The myriad virtues of suffix trees [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@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} } |
|||||

Apostolico, A. | On context-constrained squares and repetitions in a string [BibTeX] |
1984 | RAIRO Inform. Théor. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. | Linear Pattern Matching and Problems of Data Compression [BibTeX] |
1979 | IEEE International Symposium on Information Theory | inproceedings | |

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

Apostolico, A. & Atallah, M. J. | Parallel computations of Levenshtein distances [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@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} } |
|||||

Apostolico, A., Atallah, M. J., Larmore, L. L. & McFaddin, S. | Efficient parallel algorithms for string editing and related problems [BibTeX] |
1990 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A., Bock, M. E. & Lonardi, S. | Linear Global Detectors of Redundant and Rare Substrings [BibTeX] |
1999 | Proceedings Data Compression Conference | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A., Bock, M. E., Lonardi, S. & Xu, X. | Efficient Detection of Unusual Words [BibTeX] |
2000 | J. Comput. Bio. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A., Bock, M. E. & Xu, X. | Annotated Statistical Indices for Sequence Analysis [BibTeX] |
1998 | Sequences | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Breslauer, D. | Of Periods, Quasiperiods, Repetitions and Covers [BibTeX] |
1997 | Structures in Logic and Computer Science, A Selection of Essays in honor of A. Ehrenfeucht | incollection | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Breslauer, D. | An optimal O(log log N) time parallel algorithm for detecting all squares in a string [BibTeX] |
1996 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Breslauer, D. | Optimal parallel algorithms for periods, palindromes and squares [BibTeX] |
1992 | Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Breslauer, D. | An optimal O(log n) time parallel algorithm for detecting all squares in a string [BibTeX] |
1992 | techreport | ||

BibTeX:
@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} } |
|||||

Apostolico, A., Breslauer, D. & Galil, Z. | Parallel detection of all palindromes in a string [BibTeX] |
1995 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A., Breslauer, D. & Galil, Z. | Parallel detection of all palindromes in a string [BibTeX] |
1994 | Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A., Breslauer, D. & Galil, Z. | Optimal parallel algorithms for periods, palindromes and squares [BibTeX] |
1992 | Proceedings of the 19th International Colloquium on Automata, Languages and Programming | incollection | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Brimkov, V. E. | Fibonacci arrays and their two-dimensional repetitions [BibTeX] |
2000 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A., Browne, S. & Guerra, C. | Fast linear-space computations of longest common subsequences [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Crochemore, M. | Fast Parallel Lyndon Factorization with Applications [BibTeX] |
1995 | Math. Syst. Theory | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Crochemore, M. | Optimal canonization of all substrings of a string [BibTeX] |
1991 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Crochemore, M. | Fast parallel Lyndon factorization with applications [BibTeX] |
1990 | techreport | ||

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

Apostolico, A. & Crochemore, M. | Optimal canonization of all substrings of a string [BibTeX] |
1989 | techreport | ||

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

Apostolico, A. & Ehrenfeucht, A. | Efficient detection of quasiperiodicities in strings [BibTeX] |
1993 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Ehrenfeucht, A. | Efficient detection of quasiperiodicities in strings [BibTeX] |
1990 | techreport | ||

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

Apostolico, A., Farach, M. & Iliopoulos, C. S. | Optimal superprimitivity testing for strings [BibTeX] |
1991 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Fraenkel, A. | Robust Transmission of Unbounded Strings Using Fibonacci Representations [BibTeX] |
1987 | IEEE Trans. Inf. Theory | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Giancarlo, R. | Sequence alignment in molecular biology [BibTeX] |
1998 | J. Comput. Bio. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Giancarlo, R. | The Boyer-Moore-Galil string searching strategies revisited [BibTeX] |
1986 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Giancarlo, R. | Pattern matching implementation of a fast test for unique decipherability [BibTeX] |
1984 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Guerra, C. | The longest common subsequence problem revisited [BibTeX] |
1987 | Algorithmica | article | |

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

Apostolico, A. & Guerra, C. | A fast linear-space algorithm for computing longest common subsequences [BibTeX] |
1985 | Proceedings of the 23rd Allerton Conference | inproceedings | |

BibTeX:
@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 = {?--?} } |
|||||

Apostolico, A., Iliopoulos, C., Landau, G. M., Schieber, B. & Vishkin, U. | Parallel construction of a suffix tree with applications [BibTeX] |
1988 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Apostolico, A., Landau, G. M. & Skiena, S. | Matching for Run-Length Encoded Strings [BibTeX] |
1999 | J. Complexity | article | |

BibTeX:
@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} } |
|||||

Apostolico, A., Landau, G. M. & Skiena, S. | Matching for Run-Length Encoded Strings [BibTeX] |
1997 | Proceedings Complexity and Compression of SEQUENCES97 | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Lonardi, S. | Compression of Biological Sequences by Greedy Off-Line Textual Substitution [BibTeX] |
2000 | Proceedings Data Compression Conference | inproceedings | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Lonardi, S. | Off-Line Compression by Greedy Textual Substitution [BibTeX] |
2000 | ? | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Lonardi, S. | Compression of Biological Sequences by Greedy Off-Line Textual Substitution [BibTeX] |
1999 | techreport | ||

BibTeX:
@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} } |
|||||

Apostolico, A. & Preparata, F. P. | Structural properties of the string statistics problem [BibTeX] |
1985 | J. Comput. Syst. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Preparata, F. P. | Data structures and algorithms for the string statistics problem [BibTeX] |
1985 | techreport | ||

BibTeX:
@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} } |
|||||

Apostolico, A. & Preparata, F. P. | Optimal off-line detection of repetitions in a string [BibTeX] |
1983 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Apostolico, A. & Szpankowski, W. | Self-alignment in words and their applications [BibTeX] |
1992 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Appel, A. W. & Jacobson, G. J. | The world's fastest scrabble program [BibTeX] |
1988 | Commun. ACM | article | |

BibTeX:
@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} } |
|||||

Araújo, M., Navarro, G. & Ziviani, N. | Large Text Searching Allowing Errors [BibTeX] |
1997 | Proceedings of the 4th South American Workshop on String Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Arcangeli, J., Crochemore, M., Hourcastagnou, J. & Pin, J. | Compression for an effective management of telemetry data [BibTeX] |
1993 | Proceedings of the 2nd International Symposium on Ground Data Systems for Space Operations | inproceedings | |

BibTeX:
@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} } |
|||||

Arge, L., Ferragina, P., Grossi, R. & Vitter, J. | On Sorting Strings in External Memory (Extended Abstract) [BibTeX] |
1997 | Proceedings of the 29th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Argos, P. | A sensitive procedure to compare amino acid sequences [BibTeX] |
1987 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Argos, P. & Vingron, M. | Sensitivity comparison of protein amino acid sequences [BibTeX] |
1990 | Methods Enzymol. | article | |

BibTeX:
@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} } |
|||||

Argos, P., Vingron, M. & Vogt, G. | Protein sequence comparison: methods and significance [BibTeX] |
1991 | Protein Engineering | article | |

BibTeX:
@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} } |
|||||

Arikat, F., Bakalis, A., Christodoulakis, M., Iliopoulos, C. S. & Mouchard, L. | Experimental Results in Pattern Matching on Weighted Sequences [BibTeX] |
2005 | Proceedings of the International Conference on Numerical Analysis and Applied Mathematics ICNAAM'05) | inproceedings | |

BibTeX:
@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} } |
|||||

Arikat, F., Bakalis, A., Christodoulakis, M., Iliopoulos, C. S. & Mouchard, L. | Experimental Results in Pattern Matching on Weighted Sequences [BibTeX] |
2005 | Proceedings of the International Conference on Numerical Analysis and Applied Mathematics ICNAAM'05) | inproceedings | |

BibTeX:
@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} } |
|||||

Arikati, S. R., Dessmark, A., Lingas, A. & Marathe, M. V. | Approximation Algorithms for Maximum Two-Dimensional Pattern Matching [BibTeX] |
2001 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Arikati, S. R., Dessmark, A., Lingas, A. & Marathe, M. V. | Approximation Algorithms for Maximum Two-Dimensional Pattern Matching [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Arikawa, S. | One-way sequential search systems and their powers [BibTeX] |
1981 | Bull. Math. Stat. | article | |

BibTeX:
@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} } |
|||||

Arikawa, S. & Shinohara, T. | A run-time efficient realization of Aho-Corasick pattern matching machines [BibTeX] |
1984 | New Gener. Comput. | article | |

BibTeX:
@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} } |
|||||

Arikawa, S., Shinohara, T., Shiraishi, S. & Tamakoshi, Y. | An information system for researchers use [BibTeX] |
1982 | Bull. Inform. Cybern. | article | |

BibTeX:
@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} } |
|||||

Arimura, H., Shinohara, T. & Otsuki, S. | Finding minimal generalizations for unions of pattern languages and its application to inductive inference fom positive data [BibTeX] |
1994 | Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Arimura, H., Shinohara, T. & Otsuki, S. | Polynomial time inference of unions of two tree pattern languages [BibTeX] |
1992 | IEICE Trans. Inform. Syst. D | article | |

BibTeX:
@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} } |
|||||

Arita, T., Shishibori, M. & Aoe, J. | An efficient algorithm for full text retrieval for multiple keywords [BibTeX] |
1998 | Inf. Sci. | article | |

BibTeX:
@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} } |
|||||

Armen, C. & Stein, C. | Algorithm for the Shortest Superstring Problem [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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 } } |
|||||

Armen, C. & Stein, C. | Short superstrings and the structure of overlapping strings [BibTeX] |
1996 | J. Comput. Bio. | article | |

BibTeX:
@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} } |
|||||

Armen, C. & Stein, C. | Improved length for the shortest superstring problem [BibTeX] |
1995 | Proceedings of the 4th Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@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} } |
|||||

Arnold, D. B. & Sleep, M. R. | Uniform random generation of balanced parenthesis strings [BibTeX] |
1980 | ACM Trans. Program. Lang. Syst. | article | |

BibTeX:
@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} } |
|||||

Arratia, R., Gordon, L. & Waterman, M. S. | The Erdös-Rényi law in distribution, for coin tossing and sequence matching [BibTeX] |
1990 | Ann. Stat. | article | |

BibTeX:
@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} } |
|||||

Arratia, R., Gordon, L. & Waterman, M. S. | An extreme value theory for sequence matching [BibTeX] |
1986 | Ann. Stat. | article | |

BibTeX:
@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} } |
|||||

Arratia, R. & Reinert, G. | Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Arratia, R. & Waterman, M. S. | A phase transition for the score in matching random sequences allowing deletions [BibTeX] |
1994 | Ann. Appl. Probab. | article | |

BibTeX:
@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} } |
|||||

Arratia, R. & Waterman, M. S. | The Erdös-Rényi strong law for pattern matching with a given proportion of mismatches [BibTeX] |
1989 | Ann. Probab. | article | |

BibTeX:
@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} } |
|||||

Arratia, R. & Waterman, M. S. | Critical phenomena in sequence matching [BibTeX] |
1985 | Ann. Probab. | article | |

BibTeX:
@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} } |
|||||

Arroyuelo, D., Navarro, G. & Sadakane, K. | Reducing the Space Requirement of LZ-index [BibTeX] |
2006 | Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006) | inproceedings | |

BibTeX:
@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} } |
|||||

Arslan, A. N. & Egecioglu, O. | Efficient Algorithms For Normalized Edit Distance [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@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} } |
|||||

Arvestad, L. | Aligning coding DNA in the presence of frame-shift errors [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Ashdown, I. | Parallel pattern matching and FGREP [BibTeX] |
1985 | Dr. Dobbs J. | article | |

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

Atallah, M. J., Génin, Y. & Szpankowski, W. | Structural Pattern Analysis [BibTeX] |
1999 | IEEE Trans. Pattern Anal. Mach. Intell. | article | |

BibTeX:
@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} } |
|||||

Atallah, M. J., Génin, Y. & Szpankowski, W. | Pattern Matching Image Compression [BibTeX] |
1996 | Proceedings of the 6th Data Compression Conference | inproceedings | |

BibTeX:
@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} } |
|||||

Atallah, M. J., Jacquet, P. & Szpankowski, W. | A probabilistic approach to pattern matching with mismatches [BibTeX] |
1993 | Random Struct. Algorithms | article | |

BibTeX:
@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} } |
|||||

Atallah, M. J., Jacquet, P. & Szpankowski, W. | Pattern matching with mismatches: a probabilistic analysis and a randomized algorithm [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Atallah, M. J., Kosaraju, S. R., Larmore, L. L., Miller, G. L. & Teng, S. H. | Constructing trees in parallel [BibTeX] |
1989 | techreport | ||

BibTeX:
@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} } |
|||||

Attwood, T. K. & Parry-Smith, D. J. | Introduction to bioinformatics [BibTeX] |
1999 | book | ||

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

Audoire, L., Codani, J., Lavenier, D. & Quinton, P. | Machines Spécialisées pour la Comparaison de Séquences Biologiques [BibTeX] |
1995 | Tech. Sci. Inform. | article | |

BibTeX:
@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} } |
|||||

Awerbuch, B., Berger, B., Cowen, L. & Peleg, D. | Near-Linear Time Construction of Sparse Neighborhood Covers [BibTeX] |
1998 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Baase, S. | Computer algorithms -- Introduction to design and analysis [BibTeX] |
1988 | book | ||

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

Baba, K., Shinohara, A., Takeda, M., Inenaga, S. & Arikawa, S. | A Note on Randomized Algorithm for String Matching with Mismatches [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@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} } |
|||||

Backofen, R. | An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bacon, D. J. & Anderson, W. F. | Multiple sequence comparison [BibTeX] |
1990 | Methods Enzymol. | article | |

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

Bacon, D. J. & Anderson, W. F. | Multiple sequence comparison [BibTeX] |
1986 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | A unified view to pattern-matching problems [BibTeX] |
1996 | Proceedings PANEL'96 | inproceedings | |

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

Baeza-Yates, R. A. | A unified view of string matching algorithms [BibTeX] |
1996 | Proceedings SOFSEM'96: Theory and Practice of Informatics | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | Text retrieval: theory and practice [BibTeX] |
1992 | Proceedings of the 12th IFIP World Computer Congress | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | Notes on a Very Fast Substring Search Algorithm [BibTeX] |
1992 | Commun. ACM | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | Searching subsequences [BibTeX] |
1991 | Theor. Comput. Sci. | article | |

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

Baeza-Yates, R. A. | String searching algorithms revisited [BibTeX] |
1989 | Proceedings of the 1st Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | The Subsequence Graph of a Text [BibTeX] |
1989 | Proceedings of the 3rd Theory and Practice of Software Development | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | Improved string searching [BibTeX] |
1989 | Softw. Pract. Exp. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | Efficient text searching [BibTeX] |
1989 | School: Department of Computer Science, University of Waterloo, Ontario |
phdthesis | |

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

Baeza-Yates, R. A. | Algorithms for string searching: a survey [BibTeX] |
1989 | SIGIR Forum | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. | The subsequence graph of a text [BibTeX] |
1988 | techreport | ||

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

Baeza-Yates, R. A. | On the average case on string matching algorithms [BibTeX] |
1987 | techreport | ||

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

Baeza-Yates, R. A., Barbosa, E. F. & Ziviani, N. | Hierarchies of Indices for Text Searching [BibTeX] |
1996 | Inf. Syst. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A., Gavaldà, R. & Navarro, G. | Bounding the expected length of longest common subsequences and forests [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A., Gavaldà, R., Navarro, G. & Scheihing, R. | Bounding the expected length of longest common subsequences and forests [BibTeX] |
1999 | Theor. Comput. Syst. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Gonnet, G. H. | Fast text searching for regular expressions or automaton searching on tries [BibTeX] |
1996 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Gonnet, G. H. | Fast string matching with mismatches [BibTeX] |
1994 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Gonnet, G. H. | A new approach to text searching [BibTeX] |
1992 | Commun. ACM | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Gonnet, G. H. | All-against-all sequence matching [BibTeX] |
1990 | techreport | ||

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

Baeza-Yates, R. A. & Gonnet, G. H. | Efficient text searching of regular expressions [BibTeX] |
1989 | Proceedings of the 16th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Gonnet, G. H. | A new approach to text searching [BibTeX] |
1989 | Proceedings of the 12th International Conference on Research and Development in Information Retrieval | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Gonnet, G. H. | Boyer-Moore automata [BibTeX] |
1989 | techreport | ||

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

Baeza-Yates, R. A. & Gonnet, G. H. | New algorithm for pattern matching with and without mismatches [BibTeX] |
1988 | techreport | ||

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A., Gonnet, G. H. & Régnier, M. | Analysis of Boyer-Moore type string searching algorithms [BibTeX] |
1990 | Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | Faster Approximate String Matching [BibTeX] |
1999 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | Fast Two-Dimensional Approximate Pattern Matching [BibTeX] |
1998 | Proceedings of the 3rd Latin American Symposium | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | New and faster filters for multiple approximate string matching [BibTeX] |
1998 | techreport | ||

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | Multiple Approximate String Matching [BibTeX] |
1997 | Proceedings of the 5th Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | Block-addressing indices for approximate text retrieval [BibTeX] |
1997 | Proceedings ACM CIKM'97 | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | A faster algorithm for approximate string matching [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Navarro, G. | A fast heuristic for approximate string matching [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Perleberg, C. H. | Fast and practical approximate string matching [BibTeX] |
1996 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Perleberg, C. H. | Fast and practical approximate string matching [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Régnier, M. | Fast two-dimensional pattern matching [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Régnier, M. | Average running time of the Boyer-Moore-Horspool algorithm [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Régnier, M. | Fast algorithms for two-dimensional and multiple pattern matching [BibTeX] |
1990 | Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A. & Scheihing, R. | New lower bounds for the expected length of longest common subsequences and forests [BibTeX] |
1995 | Proceedings of the 15th International Conference of the Chilean Computer Science Society | inproceedings | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R., Choffrut, C. & Gonnet, G. | On Boyer-Moore automata [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. & Fuentes, L. | A framework to animate string algorithms [BibTeX] |
1996 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. & Navarro, G. | New Models and Algorithms for Multidimensional Approximate Pattern Matching [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@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} } |
|||||

Baeza-Yates, R. A., Cunto, W., Manber, U. & Wu, S. | Proximity Matching Using Fixed-Queries Trees [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bafna, V., Lawler, E. L. & Pevzner, P. A. | Approximation Algorithms for Multiple Sequence Aligmnent [BibTeX] |
1997 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Bafna, V., Lawler, E. L. & Pevzner, P. A. | Approximation Algorithms for Multiple Sequence Aligmnent [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bafna, V., Muthukrishnan, S. & Ravi, R. | Computing similarity between RNA strings [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bafna, V. & Pevzner, P. | Genome rearrangments and sorting by reversal [BibTeX] |
1996 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Bafna, V. & Pevzner, P. A. | Sorting by Transpositions [BibTeX] |
1998 | SIAM J. Discret. Math. | article | |

BibTeX:
@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} } |
|||||

Bafna, V. & Pevzner, P. A. | Genome Rearrangements and Sorting by Reversals [BibTeX] |
1993 | Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Bailey, T. A. & Dromey, R. G. | Fast string searching by finding subkeys in subtext [BibTeX] |
1980 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Bains, W. | MULTAN (2), A multiple string alignment program for nucleic acids and proteins [BibTeX] |
1989 | Comput. Appl. Biosci. | article | |

BibTeX:
@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} } |
|||||

Bains, W. | MULTAN: a program to align multiple DNA sequences [BibTeX] |
1986 | Nucleic Acids Res. | article | |

BibTeX:
@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} } |
|||||

Bakalis, A., Iliopoulos, C. S., Sioutas, S. & Tsichlas, K. | Algorithms for Bitmasking Strings [BibTeX] |
2006 | Proceedings of International Conference of Computational Methods in Sciences and Engineering | inproceedings | |

BibTeX:
@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} } |
|||||

Bakalis, A., Iliopoulos, C. S., Sioutas, S. & Tsichlas, K. | Algorithms for Bitmasking Strings [BibTeX] |
2006 | Proceedings of International Conference of Computational Methods in Sciences and Engineering | inproceedings | |

BibTeX:
@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} } |
|||||

Baker, B. S. | Parameterized duplication in strings: algorithms and an application to software maintenance [BibTeX] |
1997 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Baker, B. S. | Parameterized pattern matching: algorithms and applications [BibTeX] |
1996 | J. Comput. Syst. Sci. | article | |

BibTeX:
@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} } |
|||||

Baker, B. S. | Parameterized pattern matching by Boyer-Moore-type algorithms [BibTeX] |
1995 | Proceedings of the 6th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Baker, B. S. | A theory of parameterized pattern matching: algorithms and applications [BibTeX] |
1993 | Proceedings of the 25th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Baker, B. S. | A program for identifying duplicated code [BibTeX] |
1992 | Proceedings of the 24th Symposium on the Interface: Computer Science and Statistics | inproceedings | |

BibTeX:
@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} } |
|||||

Baker, B. S. & Giancarlo, R. | Longest Common Subsequence from Fragments via Sparse Dynamic Programming [BibTeX] |
1998 | Proceedings of the 6th Annual European Symposium | inproceedings | |

BibTeX:
@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} } |
|||||

Baker, K. A., McNulty, G. F. & Taylor, W. | Growth problems for avoidable words [BibTeX] |
1989 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Baker, T. P. | A technique for extending rapid exact-match string matching to arrays of more than one dimension [BibTeX] |
1978 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Balík, M. | Condensation principle [BibTeX] |
2000 | Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia | inproceedings | |

BibTeX:
@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} } |
|||||

Balík, M. | Implementation of DAWG [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@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} } |
|||||

Barber, A. M. & Maizel, J. V. | SequenceEditingAligner: a multiple sequence editor and aligner [BibTeX] |
1990 | Gene Anal. Tech. Appl. | article | |

BibTeX:
@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} } |
|||||

Barnett, M. P. | Primitive String Transformations as Reductions to Normal Form [BibTeX] |
1990 | SIGPLAN Not. | article | |

BibTeX:
@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} } |
|||||

Barth, G. | Relating the average-case cost of the brute-force and the Knuth-Morris-Pratt string matching algorithm [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@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} } |
|||||

Barth, G. | An analytical comparison of two string searching algorithms [BibTeX] |
1984 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Barth, G. | An alternative for the implementation of Knuth-Morris-Pratt algorithm [BibTeX] |
1981 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Barton, G. J. | An efficient algorithm to locate all locally optimal alignments between two sequences allowing for gaps [BibTeX] |
1993 | Comput. Appl. Biosci. | article | |

BibTeX:
@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} } |
|||||

Barton, G. J. | Protein multiple sequence alignment and flexible pattern matching [BibTeX] |
1990 | Methods Enzymol. | article | |

BibTeX:
@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} } |
|||||

Barton, G. J. & Sternberg, M. J. E. | A strategy for the rapid multiple alignment of protein sequences [BibTeX] |
1987 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Batzoglou, S. & Istrail, S. | Physical Mapping With Repeated Probes: The Hypergraph Superstring Problem [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@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} } |
|||||

Batzoglou, S. & Istrail, S. | Physical Mapping With Repeated Probes: The Hypergraph Superstring Problem [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bean, D. R., Ehrenfeucht, A. & McNulty, G. F. | Avoidable patterns in strings of symbols [BibTeX] |
1979 | Pac. J. Math. | article | |

BibTeX:
@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} } |
|||||

Beauquier, D., Berstel, J. & Chrétienne, P. | Éléments d'algorithmique [BibTeX] |
1992 | book | ||

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

Beauquier, D. & Pin, J. | Factors of words [BibTeX] |
1989 | Proceedings of the 16th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@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} } |
|||||

Bejerano, G. & Yona, G. | Modeling protein families using probabilistic suffix trees [BibTeX] |
1999 | Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Bell, G. I., Bivins, R. L., Louck, J. D., Metropolis, N. & Stein, M. L. | Properties of words on four letters from those on two letters with an application to DNA sequences [BibTeX] |
1993 | Adv. Appl. Math. | article | |

BibTeX:
@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} } |
|||||

Bell, T. & Kulp, D. | Longest-match string searching for Ziv-Lempel compression [BibTeX] |
1993 | Softw. Pract. Exp. | article | |

BibTeX:
@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} } |
|||||

Bellman, R. | Dynamic Programming [BibTeX] |
1957 | book | ||

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

Ben-Amram, A., Berkman, O., Iliopoulos, C. S. & Park, K. | The Subtree Max Gap Problem with Application to Parallel String Covering [BibTeX] |
1994 | Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Ben-Dor, A., Lancia, G., Perone, J. & Ravi, R. | Banishing bias from consensus sequences [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Ben-Dor, A., Pe'er, I., Shamir, R. & Sharan, R. | On the Complexity of Positional Sequencing by Hybridization [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Ben-Yehuda, S. & Pinter, R. Y. | Symbolic layout improvement using string matching based local transformation [BibTeX] |
1989 | Proceedings of the Decennial Caltech Conference on VLSI | inproceedings | |

BibTeX:
@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} } |
|||||

Benham, C., Kannan, S. & Warnow, T. | Of chicken teeth and mouse eyes, or generalized character compatibility [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Benson, G. | An Algorithm for Finding Tandem Repeats of Unspecified Pattern Size [BibTeX] |
1998 | Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Benson, G. | Sequence Alignment with Tandem Duplication [BibTeX] |
1997 | Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Benson, G. | A space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Benson, G. & Waterman, M. S. | A method for fast database search for all k-nucleotide repeats [BibTeX] |
1998 | Nucleic Acids Res. | article | |

BibTeX:
@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} } |
|||||

Benson, G. E. | Two-dimensional periodicity and matching algorithms [BibTeX] |
1992 | School: Department of Computer Science, University of Maryland |
phdthesis | |

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

Bent, K. | A Recursive Function for Calculating the Number of Legal Strings of Parentheses and for Calculating Catalan Numbers [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@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} } |
|||||

Bentley, J. & McIlroy, D. | Data Compression using Long Common Strings [BibTeX] |
1999 | Proceedings Data Compression Conference | inproceedings | |

BibTeX:
@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} } |
|||||

Bentley, J. L. & Sedgewick, R. | Fast Algorithms for Sorting and Searching Strings [BibTeX] |
1997 | Proceedings of the 8th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Bergroth, L., Hakonen, H. & Raita, T. | New Approximation Algorithms for Longest Common Subsequences [BibTeX] |
1998 | Proceedings String Processing and Information Retrieval: A South American Symposium | inproceedings | |

BibTeX:
@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} } |
|||||

Berkman, O., Breslauer, D., Galil, Z., Schieber, B. & Vishkin, U. | Highly parallelizable problems [BibTeX] |
1989 | Proceedings of the 21st ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Berkman, O., Iliopoulos, C. & Park, K. | The subtree max gap problem with application to parallel string covering [BibTeX] |
1995 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Berkovich, S. Y. & Hegazy, A. E. F. A. | Matching String Patterns in Large Textual Files [BibTeX] |
1985 | International Symposium on New Directions in Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Berman, P. & Hannenhalli, S. | Fast Sorting by Reversal [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Berman, P., Karpinski, M., Larmore, L. L., Plandowski, W. & Rytter, W. | On the complexity of pattern matching for highly compressed two-dimensional texts [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Berman, P., Zhang, Z., Wolf, Y. I., Koonin, E. V. & Miller, W. | Winnowing Sequences from a Database Search [BibTeX] |
1999 | Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Berry, G. & Sethi, R. | From regular expression to deterministic automata [BibTeX] |
1986 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Berry, T. & Ravindran, S. | A fast string matching algorithm and experimental results [BibTeX] |
1999 | Proceedings of the Prague Stringology Club Workshop~'99 | inproceedings | |

BibTeX:
@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} } |
|||||

Berry, T. & Ravindran, S. | String matching in a compressed DNA text [BibTeX] |
1999 | Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Berstel, J. | Some recent results on squarefree words [BibTeX] |
1984 | techreport | ||

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

Berstel, J. | Mots sans carrés et morphismes itérés [BibTeX] |
1978 | techreport | ||

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

Berstel, J. & Boasson, L. | Partial words and a theorem of Fine and Wilf [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Berstel, J. & Perrin, D. | Theory of codes [BibTeX] |
1985 | book | ||

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

Berstel, J., Perrin, D., Perrot, J. & Restivo, A. | Sur le théorème du défaut [BibTeX] |
1979 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Berstel, J., Perrin, D., Perrot, J. & Restivo, A. | Sur le théorème du défaut [BibTeX] |
1978 | techreport | ||

BibTeX:
@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} } |
|||||

Berstel, J. & Pocchiola, M. | Average cost of Duval's algorithm for generating Lyndon words [BibTeX] |
1994 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Berstel, J. & Pocchiola, M. | A geometric proof of the enumeration formula for Sturmian words [BibTeX] |
1993 | Int. J. Algebr. Comput. | article | |

BibTeX:
@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} } |
|||||

Berstel, J. & Pocchiola, M. | Average cost of Duval's algorithm for generating Lyndon words [BibTeX] |
1992 | techreport | ||

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

Berstel, J. & Séébold, P. | A remark on morphic Sturmian word [BibTeX] |
1994 | RAIRO Inform. Théor. Appl. | article | |

BibTeX:
@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} } |
|||||

Berstel, J. & Séébold, P. | A characterization of Sturmian morphisms [BibTeX] |
1993 | Proceedings of the 18th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Bertossi, A. A. | A VLSI System for String Matching [BibTeX] |
1990 | Integr., The VLSI J. | article | |

BibTeX:
@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} } |
|||||

Bertossi, A. A., Lodi, E., Luccio, F. & Pagli, L. | Context--dependent string matching [BibTeX] |
1990 | Sequences, combinatorics, compression, security and transmission | inproceedings | |

BibTeX:
@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} } |
|||||

Bertossi, A. A., Lodi, E., Luccio, F. & Pagli, L. | String matching with context dependent errors [BibTeX] |
1987 | techreport | ||

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

Bertossi, A. A., Luccio, F., Lodi, E. & Pagli, L. | String matching with weighted errors [BibTeX] |
1990 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Bertossi, A. A., Luccio, F., Pagli, L. & Lodi, E. | A parallel solution to the approximate string matching algorithm problem [BibTeX] |
1992 | Comput. J. | article | |

BibTeX:
@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} } |
|||||

Bickel, M. A. | Automatic correction to misspelled names: a fourth-generation language approach [BibTeX] |
1987 | Commun. ACM | article | |

BibTeX:
@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} } |
|||||

Bieganski, P. | Genetic sequence data retrieval and manipulation based on generalized suffix trees [BibTeX] |
1995 | School: University of Minnesota |
phdthesis | |

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

Binstock, A. & Rex, J. | Practical Algorithms for Programmers [BibTeX] |
1995 | book | ||

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

Bird, R. M., Tu, J. C. & Worthy, R. M. | Associative/parallel processors for searching very large textual data bases [BibTeX] |
1977 | Proceedings of the 3rd Workshop on Computer Architecture for Non-numeric Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Bird, R. S. | Two-dimensional pattern matching [BibTeX] |
1977 | Inf. Process. Lett. | article | |

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

Bird, R. S., Gibbons, J. & Jones, G. | Formal derivation of a pattern matching algorithm [BibTeX] |
1989 | Sci. Comp. Program. | article | |

BibTeX:
@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} } |
|||||

Bishop, M. J., Friday, A. E. & Thompson, E. A. | Inference of evolutionary relationships [BibTeX] |
1987 | Nucleic acid and protein sequence analysis: a practical approach | incollection | |

BibTeX:
@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} } |
|||||

Bishop, M. J. & Rawlings, C. J. | Nucleic acid and protein sequence analysis: a practical approach [BibTeX] |
1987 | book | ||

BibTeX:
@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} } |
|||||

Bishop, M. J. & Thompson, E. A. | Maximum likelihood alignment of DNA sequences [BibTeX] |
1986 | J. Mol. Biol. | article | |

BibTeX:
@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} } |
|||||

Bishop, M. J. & Thompson, E. A. | Fast computer search for similar DNA sequences [BibTeX] |
1984 | Nucleic Acids Res. | article | |

BibTeX:
@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} } |
|||||

Blair, C. R. | A program for correcting spelling errors [BibTeX] |
1960 | Inf. Control | article | |

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

Blaisdell, B. E. | A measure of the similarity of sets of sequences not requiring sequence alignment [BibTeX] |
1986 | Proc. Natl. Acad. Sci. U.S.A. | article | |

BibTeX:
@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} } |
|||||

Bloch, M. | Efficiency of AC-machine and SFNA in practical string matching [BibTeX] |
1996 | Proceedings of the Prague Stringologic Club Workshop~'96 | inproceedings | |

BibTeX:
@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} } |
|||||

Bloch, M. | Experimental evaluation and optimization of Aho-Corasick pattern matching machine [BibTeX] |
1989 | School: University of Prague, Czech Republic |
phdthesis | |

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

Blum, A., Jiang, T., Li, M., Tromp, J. & Yannakakis, M. | Linear approximation of shortest superstrings [BibTeX] |
1994 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@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} } |
|||||

Blum, A., Jiang, T., Li, M., Tromp, J. & Yannakakis, M. | Linear approximation of shortest superstrings [BibTeX] |
1991 | Proceedings of the 23rd ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Blum, N. | Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Blum, N. | On locally optimal alignments in genetic sequences [BibTeX] |
1992 | Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., Chen, M. T. & Seiferas, J. | The smallest automaton recognizing the subwords of a text [BibTeX] |
1985 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D. & McConnel, R. | Complete inverted files for efficient text retrieval and analysis [BibTeX] |
1987 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@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} } |
|||||

Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D. & McConnel, R. | Building the minimal DFA for the set of all subwords of a word on-line in linear time [BibTeX] |
1984 | Proceedings of the 11th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@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} } |
|||||

Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D. & McConnel, R. | Building a complete inverted file for a set of text files in linear time [BibTeX] |
1984 | Proceedings of the 16th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D. & McConnel, R. | Linear size finite automata for the set of all subwords of a word: an outline of results [BibTeX] |
1983 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Blumer, A., Ehrenfeucht, A. & Haussler, D. | Average size of suffix trees and DAWGS [BibTeX] |
1989 | Discret. Appl. Math. | article | |

BibTeX:
@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} } |
|||||

Blumer, J. A. | How much is that DAWG in the window ? a moving window algorithm for the directed acyclic word graph [BibTeX] |
1987 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Blumer, J. & Blumer, A. | On-line construction of a complete inverted file [BibTeX] |
1986 | techreport | ||

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

Boasson, L., Cegielski, P., Guessarian, I. & Matiyasevich, Y. | Window-Accumulated Subsequence Matching Problem is Linear [BibTeX] |
1999 | Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems | inproceedings | |

BibTeX:
@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} } |
|||||

Bodlaender, H., Downey, R., Fellows, M. & Wareham, H. | The Parametrized Complexity of Sequence Alignment and Consensus [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bodlaender, H., Downey, R. G., Fellows, M. R., Hallett, M. T. & Wareham, H. T. | Parametrized Complexity Analysis in Computational Biology [BibTeX] |
1995 | Comput. Appl. Biosci. | article | |

BibTeX:
@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} } |
|||||

Bodlaender, H., Downey, R. G., Fellows, M. R., Hallett, M. T. & Wareham, H. T. | Parametrized Complexity Analysis in Computational Biology [BibTeX] |
1995 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Bodlaender, H. L., Fellows, M. R. & Evans, P. A. | Finite-State Computability of Annotations of Strings and Trees [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bonizzoni, P., Duella, M. & Mauri, G. | Approximation complexity of longest common subsequence and shortest common supersequence over fixed alphabet [BibTeX] |
1994 | techreport | ||

BibTeX:
@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} } |
|||||

Bonizzoni, P., Vedova, G. D. & Mauri, G. | Approximating the Maximum Isomorphic Agreement Subtree Is Hard [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bookstein, A. | On Harrison's Substring Testing Technique [BibTeX] |
1973 | Commun. ACM | article | |

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

Booth, K. S. | Lexicographically least circular substrings [BibTeX] |
1980 | Inf. Process. Lett. | article | |

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

Boothroyd, J. | Stringsort [BibTeX] |
1963 | Commun. ACM | article | |

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

Botstein, D. | Expression Arrays: An Open Problem for Mathematicians in Post-Genome Sequence Biology [BibTeX] |
1997 | Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Boyar, J. & Larsen, K. S. | Faster Parallel Computation of Edit Distances [BibTeX] |
1993 | techreport | ||

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

Boyer, R. S. & Moore, J. S. | A fast string searching algorithm [BibTeX] |
1977 | Commun. ACM | article | |

BibTeX:
@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} } |
|||||

Bradford, J. H. | Sequence matching with binary codes [BibTeX] |
1990 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Bradford, J. H. & Jenkyns, T. A. | On the inadequacy of tournament algorithms for the N-SCS problem [BibTeX] |
1991 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Bradley, J. R. & Skiena, S. S. | Fabricating Arrays of Strings [BibTeX] |
1997 | Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Breimer, E., Goldberg, M. & Lim, D. | A learning algorithm for the longest common subsequence problem [BibTeX] |
2000 | Proceedings of the 2nd Algorithm Engineering and Experiments | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D. | The suffix tree of a tree and minimizing sequential transducers [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. | The suffix Tree of a Tree and Minimizing Sequential Transducers [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D. | Saving comparisons in the Crochemore--Perrin string-matching algorithm [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. | Fast parallel string prefix-matching [BibTeX] |
1995 | Theor. Comput. Sci. | article | |

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

Breslauer, D. | Dictionary matching on unbounded alphabets: uniform length dictionaries [BibTeX] |
1995 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. | Dictionary matching on unbounded alphabets: uniform length dictionaries [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D. | Testing string superprimitivity in parallel [BibTeX] |
1994 | Inf. Process. Lett. | article | |

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

Breslauer, D. | Saving Comparisons in the Crochemore-Perrin String Matching Algorithm [BibTeX] |
1993 | Proceedings of the 1st Annual European Symposium | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D. | An on-line string superprimitivity test [BibTeX] |
1992 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. | Fast parallel string prefix-matching [BibTeX] |
1992 | techreport | ||

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

Breslauer, D. | Efficient string algorithmics [BibTeX] |
1992 | School: Computer Science Department, Columbia University, NY |
phdthesis | |

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

Breslauer, D. | Testing String Superprimitivity in Parallel [BibTeX] |
1992 | techreport | ||

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

Breslauer, D. | An Optimal O(log log n) Time Parallel String Matching Algorithm [BibTeX] |
1989 | techreport | ||

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

Breslauer, D., Colussi, L. & Toniolo, L. | On the comparison complexity of the string prefix-matching problem [BibTeX] |
1998 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Breslauer, D., Colussi, L. & Toniolo, L. | Tight Comparison Bounds for the String Prefix-Matching Problem [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D., Colussi, L. & Toniolo, L. | Tight comparison bounds for the string prefix-matching problem [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Galil, Z. | Finding all periods and initial palindromes of a string in parallel [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Galil, Z. | Efficient comparison based string matching [BibTeX] |
1993 | J. Complexity | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Galil, Z. | A lower bound for parallel string matching [BibTeX] |
1992 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Galil, Z. | Finding all periods and initial palindromes of a string in parallel [BibTeX] |
1992 | techreport | ||

BibTeX:
@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} } |
|||||

Breslauer, D. & Galil, Z. | Parallel string matching algorithms [BibTeX] |
1992 | techreport | ||

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

Breslauer, D. & Galil, Z. | Efficient Comparison Based String Matching [BibTeX] |
1992 | techreport | ||

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

Breslauer, D. & Galil, Z. | A lower bound for parallel string matching [BibTeX] |
1991 | Proceedings of the 23rd ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Galil, Z. | An optimal O(log log n) time parallel string matching algorithm [BibTeX] |
1990 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Gasieniec, L. | Efficient string matching on packed texts [BibTeX] |
1997 | RAIRO Inform. Théor. Appl. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Gasieniec, L. | Efficient string matching on coded texts [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Breslauer, D. & Hariharan, R. | Optimal parallel construction of minimal suffix and factor automata [BibTeX] |
1996 | Parallel Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Breslauer, D., Jiang, T. & Jiang, Z. | Rotations of periodic strings and short superstrings [BibTeX] |
1997 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

de la Briandais, R. | File searching using variable length keys [BibTeX] |
1959 | Proceedings of the Western Joint Computer Conference | inproceedings | |

BibTeX:
@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} } |
|||||

Brisaboa, N., na, A. F., Navarro, G. & Paramá, J. | Lightweight Natural Language Text Compression [BibTeX] |
2007 | Information Retrieval | article | |

BibTeX:
@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} } |
|||||

Brisaboa, N., Fariña, A., Navarro, G. & Paramá, J. | Improving Semistatic Compression via Pair-Based Coding [BibTeX] |
2006 | Proceedings of the 6th International Conference onPerspectives of System Informatics (PSI'06) | inproceedings | |

BibTeX:
@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} } |
|||||

Brlek, S. | Enumeration of factors in the Thue-Morse word [BibTeX] |
1989 | Discret. Appl. Math. | article | |

BibTeX:
@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} } |
|||||

Brodal, G. S. | Finger Search Trees with Constant Insertion Time [BibTeX] |
1998 | Proceedings ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Brodal, G. S. & Gasieniec, L. | Approximate Dictionary Queries [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Brodal, G. S., Lyngs, R. B., Pedersen, C. N. S. & Stoye, J. | Finding maximal pairs with bounded gap [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@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} } |
|||||

Brodal, G. S., Lyngs, R. B., Pedersen, C. N. S. & Stoye, J. | Finding maximal pairs with bounded gap [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Brodal, G. S. & Pedersen, C. N. S. | Finding Maximal Quasiperiodicities in Strings [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Brodal, G. S. & Venkatesh, S. | Improved bounds for dictionary look-up with one error [BibTeX] |
2000 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Broder, A. Z. | Identifying and Filtering Near-Duplicate Documents [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bron, C. & Dijkstra, E. J. | A Better Way to Combine Efficient String Length Encoding and Zero-Termination [BibTeX] |
1989 | SIGPLAN Not. | article | |

BibTeX:
@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} } |
|||||

Brown, P., Lai, J. & Mercer, R. | Aligning sentences in parallel corpora [BibTeX] |
1991 | Proceedings of the 47th Annual Meeting of the ACL | inproceedings | |

BibTeX:
@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} } |
|||||

Brutlag, D. & Naor, D. | On Suboptimal Alignments of Biological Sequences [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Brutlag, D. L., Dautricourt, J. P., Maulik, S. & Relph, J. | Improved Sensitivity of Biological Sequence Database Searches [BibTeX] |
1990 | Comput. Appl. Biosci. | article | |

BibTeX:
@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} } |
|||||

Bruyère, V. | Automates de Boyer-Moore [BibTeX] |
1991 | School: Université de Mons-Hainaut, Belgique |
phdthesis | |

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

Bruyère, V., Baeza-Yates, R. A., Delgrange, O. & Scheihing, R. | About the size of Boyer-Moore automata [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Bruyère, V. & Delgrange, O. | About the size of the Boyer-Moore automaton [BibTeX] |
1994 | techreport | ||

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

Bruyère, V. & Perrin, D. | Maximal bifix codes [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Bryant, D. | A Lower Bound for the Breakpoint Phylogeny Problem [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Brazma, A. | Efficient learning of regular expressions from approximate examples [BibTeX] |
1997 | Computational Learning Theory and Natural Learning Systems | inbook | |

BibTeX:
@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} } |
|||||

Brazma, A. | Learning of regular expressions by pattern matching [BibTeX] |
1995 | Proceedings of the 2nd European Conference on Computational Learning Theory | inproceedings | |

BibTeX:
@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} } |
|||||

Brazma, A., Jonassen, I., Eidhammer, I. & Gilbert, D. | Approaches to the automatic Discovery of patterns in Biosequences [BibTeX] |
1998 | J. Comput. Bio. | article | |

BibTeX:
@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} } |
|||||

Brazma, A., Jonassen, I., Ukkonen, E. & Vilo, J. | Predicting Gene Regulatory Elements in Silico on a Genomic Scale [BibTeX] |
1998 | Genome Research | article | |

BibTeX:
@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} } |
|||||

Brazma, A., Jonassen, I., Ukkonen, E. & Vilo, J. | Discovering Patterns and Subfamilies in Biosequences [BibTeX] |
1996 | Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology | inproceedings | |

BibTeX:
@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} } |
|||||

Brazma, A., Jonassen, I., Vilo, J. & Ukkonen, E. | Pattern Discovery in Biosequences [BibTeX] |
1998 | Proceedings of the 4th International Colloquium on Grammatical Inference (ICGI-98) | inproceedings | |

BibTeX:
@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} } |
|||||

Brazma, A., Vilo, J., Ukkonen, E. & Valtonen, K. | Data Mining for Regulatory Elements in Yeast Genome [BibTeX] |
1997 | Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology | inproceedings | |

BibTeX:
@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} } |
|||||

Buchsbaum, A. L. & Giancarlo, R. | Algorithmic Aspects of Speech Recognition: A Synopsis [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Bundschuh, R. & Hwa, T. | An Analytic Study of the Phase Transition Line in Local Sequence Alignment with Gaps [BibTeX] |
1999 | Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Bunke, H. | Fast Approximate Matching of Words Against a Dictionary [BibTeX] |
1995 | Computing | article | |

BibTeX:
@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} } |
|||||

Bunke, H. & Buehler, U. | Applications of approximate string matching to 2D shape recognition. [BibTeX] |
1993 | Pattern Recognit. | article | |

BibTeX:
@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} } |
|||||

Bunke, H. & Csirik, J. | An improved algorithm for computing the edit distance of run-length coded strings [BibTeX] |
1995 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Bunke, H. & Csirik, J. | An algorithm for matching run-length coded strings [BibTeX] |
1993 | Comput. | article | |

BibTeX:
@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} } |
|||||

Burghardt, J. | A tree pattern matching algorithm with reasonable space requirements [BibTeX] |
1988 | Proceedings of the 13th Colloquium on Trees in Algebra and Programming | inproceedings | |

BibTeX:
@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} } |
|||||

Burkhard, W. A. | Hashing and trie algorithms for partial match retrieval [BibTeX] |
1976 | ACM Trans. Database Syst. | article | |

BibTeX:
@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} } |
|||||

Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H., Rivals, E. & Vingron, M. | q-gram Based Database Searching Using a Suffix Array [BibTeX] |
1999 | Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Burkowski, F. J. | A hardware hashing schemme in the design of a multiterm string comparator [BibTeX] |
1982 | IEEE Trans. Comput. | article | |

BibTeX:
@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} } |
|||||

CACM | Notes on Sunday's paper [BibTeX] |
1992 | Commun. ACM | article | |

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

Cai, J., Paige, R. & Tarjan, R. | More efficient bottom-up multi-pattern matching in trees [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Cai, J., Paige, R. & Tarjan, R. | More efficient bottom-up multi-pattern matching in trees [BibTeX] |
1992 | techreport | ||

BibTeX:
@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} } |
|||||

Cai, J., Paige, R. & Tarjan, R. | More efficient bottom-up multi-pattern matching in trees [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Califano, A. | SPLASH: Structural Pattern Localization Analysis by Sequential Histograming [BibTeX] |
2000 | Bioinformatics | article | |

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

Cambouropoulos, E., Crochemore, M., Iliopoulos, C. S., Mouchard, L. & Pinzon, Y. J. | Algorithms for computing approximate repetitions in musical sequences [BibTeX] |
1999 | Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cantor, C. R. | Enhancements in Sequence Analysis with DNA Arrays [BibTeX] |
1998 | Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Caprara, A. | Formulations and Complexity of Multiple Sorting by Reversals [BibTeX] |
1999 | Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Caprara, A. | Sorting Permutations by Reversals and Eulerian Cycle Decompositions [BibTeX] |
1999 | SIAM J. Discret. Math. | article | |

BibTeX:
@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} } |
|||||

Caprara, A. | Sorting by Reversals is Difficult [BibTeX] |
1997 | Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@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} } |
|||||

Caprara, A., Lancia, G. & Ng, S. K. | Fast Practical Solution of Sorting by Reversals [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cardon, A. & Charras, C. | Introduction à l'algorithmique et à la programmation [BibTeX] |
1996 | book | ||

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

Carillo, H. & Lipman, D. | The multiple sequence alignment problem in biology [BibTeX] |
1988 | SIAM J. Appl. Math. | article | |

BibTeX:
@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} } |
|||||

Carpi, A. | On Abelian squares and substitutions [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

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

Cassaigne, J. | Limit values of the recurrence quotient of Sturmian sequences [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Cassaigne, J. | Motifs évitables et régularité dans les mots [BibTeX] |
1994 | School: Université Paris 6, France |
phdthesis | |

BibTeX:
@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} } |
|||||

Cassaigne, J. | Motifs évitables et régularité dans les mots [BibTeX] |
1994 | techreport | ||

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

Cassaigne, J. | Unavoidable binary patterns [BibTeX] |
1993 | Acta Inform. | article | |

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

Castelli, G., Mignosi, F. & Restivo, A. | Fine and Wilf's theorem for three periods and a generalization of Sturmian words [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Cattell, K., Ruskey, F., Sawada, J., Serra, M. & Miers, C. R. | Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) [BibTeX] |
2000 | J. Algorithms | article | |

BibTeX:
@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} } |
|||||

Cenk Sahinalp, S. & Vishkin, U. | Symmetry Breaking for Suffix Tree Construction [BibTeX] |
1994 | Proceedings of the 26th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Chávez, E. & Navarro, G. | Metric Databases [BibTeX] |
2005 | Encyclopedia of Database Technologies and Applications | inbook | |

BibTeX:
@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} } |
|||||

Champarnaud, J., Khorsi, A. & Paranthoën, T. | Split and join for minimizing: Brzozowski's algorithm [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@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} } |
|||||

Champion, D. M. & Rothstein, J. | Immediate parallel solution of the longest common subsequence problem [BibTeX] |
1987 | ICPP | article | |

BibTeX:
@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} } |
|||||

Chan, S. C., Wong, A. K. C. & Chiu, D. K. Y. | A survey of multiple sequence comparison methods [BibTeX] |
1992 | Bull. Math. Biol. | article | |

BibTeX:
@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} } |
|||||

Chang, C. & Paige, R. | From regular expression to DFA's using NFA's [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Chang, D. K. | A String Pattern-Matching Algorithm [BibTeX] |
1993 | J. Syst. Softw. | article | |

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

Chang, W. & Marr, T. | Approximate String Matching with Local Similarity [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Chang, W. I. | Approximate pattern matching and biological applications [BibTeX] |
1991 | School: University of California, Berkeley |
phdthesis | |

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

Chang, W. I. & Lampe, J. | Theoretical and empirical comparisons of approximate string matching algorithms [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Chang, W. I. & Lawler, E. L. | Sublinear Approximate String Matching and Biological Applications [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Chang, W. I. & Lawler, E. L. | Approximated string matching in sublinear expected time [BibTeX] |
1990 | Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Chao, K. | Computing All Suboptimal Alignments in Linear Space [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Chao, K., Hardison, R. C. & Miller, W. | Locating well-conserved regions within a pairwise alignment [BibTeX] |
1993 | Comput. Appl. Biosci. | article | |

BibTeX:
@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} } |
|||||

Chao, K. & Miller, W. | Linear-space algorithms that build local alignments from fragments [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Chao, K., Zhang, J., Ostell, J. & Miller, W. | A local alignment tool for very long DNA sequences [BibTeX] |
1995 | Comput. Appl. Biosci. | article | |

BibTeX:
@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} } |
|||||

Charatonic, W. & Pacholski, L. | Solving word equations in two variables [BibTeX] |
1991 | Proceedings IWWERT | inproceedings | |

BibTeX:
@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} } |
|||||

Charras, C. & Lecroq, T. | Java tools to help understanding pattern matching techniques [BibTeX] |
1999 | Proceedings of the 5th International Conference on Compute Aided Engineering Education | inproceedings | |

BibTeX:
@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} } |
|||||

Charras, C. & Lecroq, T. | Exact string matching animation in Java [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@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} } |
|||||

Charras, C. & Lecroq, T. | Sequence comparison [BibTeX] |
1998 | misc | ||

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

Charras, C. & Lecroq, T. | Exact string matching animation in Java [BibTeX] |
1997 | techreport | ||

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

Charras, C. & Lecroq, T. | Exact string matching algorithms [BibTeX] |
1996 | misc | ||

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

Charras, C., Lecroq, T. & Pehoushek, J. | A Very Fast String Matching Algorithm for Small Alphabets and Long Patterns [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Chase, D. | An improvement to bottom-up tree pattern matching [BibTeX] |
1987 | Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages | inproceedings | |

BibTeX:
@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} } |
|||||

Chavez, E. & Marroquín, J. | Proximity Queries in metric spaces [BibTeX] |
1997 | Proceedings of the 4th South American Workshop on String Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Chen, G. H. | An O(1) time algorithm for string matching [BibTeX] |
1992 | Int. J. Comput. Math. | article | |

BibTeX:
@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} } |
|||||

Chen, M. T. & Seiferas, J. | Efficient and elegant subword tree construction [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@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} } |
|||||

Chen, T. & Skiena, S. S. | Trie-based data structures for sequence assembly [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Chen, W. | Multi-subsequence searching [BibTeX] |
2000 | Inf. Process. Lett. | article | |

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

Cheng, H. & Fu, K. | VLSI architectures for string matching and pattern matching [BibTeX] |
1987 | Pattern Recognit. | article | |

BibTeX:
@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} } |
|||||

Chin, F. Y. L. & Poon, C. K. | Performance Analysis of Some Simple Heuristics for Computing Longuest Common subsequences [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@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} } |
|||||

Chin, F. Y. L. & Poon, C. K. | A fast algorithm for computing longest common subsequences of small alphabet size [BibTeX] |
1990 | J. Inform. Process. | article | |

BibTeX:
@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} } |
|||||

Chlebus, B. S. & Gasieniec, L. | Optimal pattern matching on meshes [BibTeX] |
1994 | Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Chodorow, M. & Klarans, J. L. | Locating syntactic patterns in text corpora [BibTeX] |
1990 | techreport | ||

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

Choffrut, C. | The word problem for single relator special monoids - The state of art [BibTeX] |
1993 | techreport | ||

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

Choffrut, C. | Combinatoire et génome [BibTeX] |
1991 | techreport | ||

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

Choffrut, C. | An optimal algorithm for building the Boyer-Moore automaton [BibTeX] |
1990 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Choffrut, C. & Horwath, S. | Equations in Transfinite Strings [BibTeX] |
1998 | Proceedings of the 23rdSymposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Choi, Y. & Lam, T. W. | Dynamic suffix tree and two-dimensional texts management [BibTeX] |
1997 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Choi, Y. & Lam, T. W. | Two-Dimensional Pattern Matching on a Dynamic Library of Texts [BibTeX] |
1995 | Proceedings of the 1stAnnual International Conference on Computing and Combinatorics | inproceedings | |

BibTeX:
@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} } |
|||||

Chomsky, N. & Schützenberger, M. | The algebraic theory of context-free languages [BibTeX] |
1963 | Computer Programming and Formal Systems | incollection | |

BibTeX:
@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} } |
|||||

Chow, E. T., Hunkapiller, T., Peterson, J. C., Zimmerman, B. A. & Waterman, M. S. | A Systolic Array Processor for Biological Information Signal Processing [BibTeX] |
1991 | Proceedings of the International Conference on Supercomputing | inproceedings | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Mouchard, L., Perdikuri, K., Tsakalidis, A. & Tsichlas, K. | Computation of Repetitions and Regularities on Biological Weighted Sequences [BibTeX] |
2005 | Journal of Computational Biology | article | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Mouchard, L., Perdikuri, K., Tsakalidis, A. & Tsichlas, K. | Computation of Repetitions and Regularities on Biological Weighted Sequences [BibTeX] |
2005 | Journal of Computational Biology | article | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Mouchard, L. & Tsichlas, K. | Pattern Matching on Weighted Sequences [BibTeX] |
2004 | Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets'04) | inproceedings | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Mouchard, L. & Tsichlas, K. | Pattern Matching on Weighted Sequences [BibTeX] |
2004 | Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets'04) | inproceedings | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Park, K. & Sim, J. S. | Approximate Seeds of Strings [BibTeX] |
2005 | Journal of Automata, Languages and Combinatorics | article | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Park, K. & Sim, J. S. | Approximate Seeds of Strings [BibTeX] |
2005 | Journal of Automata, Languages and Combinatorics | article | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Park, K. & Sim, J. S. | Implementing Approximate Regularities [BibTeX] |
2004 | Mathematical and Computer Modelling | article | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Park, K. & Sim, J. S. | Implementing Approximate Regularities [BibTeX] |
2004 | Mathematical and Computer Modelling | article | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Tsichlas, K. & Perdikuri, K. | Searching for Regularities in Weighted Sequences [BibTeX] |
2004 | Lecture Series on Computer and Computational Sciences | inproceedings | |

BibTeX:
@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} } |
|||||

Christodoulakis, M., Iliopoulos, C. S., Tsichlas, K. & Perdikuri, K. | Searching for Regularities in Weighted Sequences [BibTeX] |
2004 | Lecture Series on Computer and Computational Sciences | inproceedings | |

BibTeX:
@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} } |
|||||

Chrobak, M. & Rytter, W. | Remarks on string-matching and one-way multihead automata [BibTeX] |
1987 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Chrobak, M. & Rytter, W. | Unique decipherability for partially commutative alphabets [BibTeX] |
1987 | Fundam. Inform. | article | |

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

Chuan, W. | Symmetric Fibonacci words [BibTeX] |
1993 | Fibonacci Quarterly | article | |

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

Chung, K. | An improved algorithm for solving the banded cyclic string-to-string correction problem [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Chung, K. | A randomized parallel algorithm for string matching on hypercube [BibTeX] |
1992 | Pattern Recognit. | article | |

BibTeX:
@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} } |
|||||

Chung, T. & Cho, J. | History sensitive string for multiple alphabets [BibTeX] |
1987 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Chvátal, V., Klarner, D. & Knuth, D. | Selected Combinatorial Research Problems [BibTeX] |
1972 | techreport | ||

BibTeX:
@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} } |
|||||

Chvátal, V. & Sankoff, D. | Longest common subsequences of two random sequences [BibTeX] |
1975 | J. Appl. Probab | article | |

BibTeX:
@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} } |
|||||

Chvátal, V. & Sankoff, D. | Longest common subsequences of random sequences [BibTeX] |
1975 | techreport | ||

BibTeX:
@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} } |
|||||

Chávez, E., Figueroa, K. & Navarro, G. | Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order [BibTeX] |
2005 | Proceedings of the 4th Mexican International Conference on Artificial Intelligence (MICAI'05) | inproceedings | |

BibTeX:
@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} } |
|||||

Chávez, E. & Navarro, G. | A Compact Space Decomposition for Effective Metric Indexing [BibTeX] |
2005 | Pattern Recognition Letters | article | |

BibTeX:
@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} } |
|||||

Clark, D. R. & Munro, J. I. | Efficient suffix trees on secondary storage [BibTeX] |
1996 | Proceedings of the 7th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cleary, J. G. & Witten, I. H. | Data compression using adaptive coding and partial string matching [BibTeX] |
1984 | IEEE Trans. Comput. | article | |

BibTeX:
@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} } |
|||||

Clifford, P., R. Clifford & Iliopoulos, C. S. | Faster algorithms for (δ,γ)-matching and related problems [BibTeX] |
2005 | Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05) | inproceedings | |

BibTeX:
@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} } |
|||||

Clifford, P., R. Clifford & Iliopoulos, C. S. | Faster algorithms for (δ,γ)-matching and related problems [BibTeX] |
2005 | Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05) | inproceedings | |

BibTeX:
@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} } |
|||||

Clifford, R., Groult, R., Iliopoulos, C. & Byrd, R. | Music retrieval algorithms for the lead sheet problem [BibTeX] |
2004 | Proceedings of the Sound and Music Computing International Conference 2004 (SMC'04) | inproceedings | |

BibTeX:
@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} } |
|||||

Clifford, R., Groult, R., Iliopoulos, C. & Byrd, R. | Music retrieval algorithms for the lead sheet problem [BibTeX] |
2004 | Proceedings of the Sound and Music Computing International Conference 2004 (SMC'04) | inproceedings | |

BibTeX:
@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} } |
|||||

Clifford, R., Iliopoulos, C. & Park, K. | Extending the Edit Distance for Musical Applications [BibTeX] |
2004 | Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms ((AWOCA'04) | inproceedings | |

BibTeX:
@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} } |
|||||

Clifford, R., Iliopoulos, C. & Park, K. | Extending the Edit Distance for Musical Applications [BibTeX] |
2004 | Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms ((AWOCA'04) | inproceedings | |

BibTeX:
@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} } |
|||||

Clifford, R. & Iliopoulos, C. S. | Approximate String Matching for Music Analysis [BibTeX] |
2004 | Soft Computing | article | |

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

Clifford, R. & Iliopoulos, C. S. | Approximate String Matching for Music Analysis [BibTeX] |
2004 | Soft Computing | article | |

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

Clifford, R., T. Crawford, C. I. & Meredith, D. | Problems in Computational Musicology [BibTeX] |
2004 | String Algorithmics | incollection | |

BibTeX:
@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} } |
|||||

Clifford, R., T. Crawford, C. I. & Meredith, D. | Problems in Computational Musicology [BibTeX] |
2004 | String Algorithmics | incollection | |

BibTeX:
@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} } |
|||||

Clift, B., Haussler, D., McConnell, R., Schneider, T. D. & Stormo, G. D. | Sequences landscapes [BibTeX] |
1986 | Nucleic Acids Res. | article | |

BibTeX:
@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} } |
|||||

Cobbs, A. L. | Fast approximate matching using suffix trees [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Cobbs, A. L. | Fast Identification of Approximately Matching Substrings [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@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} } |
|||||

Cohen, J. D. | Hardware-assisted algorithm for full-text large-dictionary string matching using n-gram hashing [BibTeX] |
1998 | Inf. Process. Manage. | article | |

BibTeX:
@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} } |
|||||

Cohn, M. & Khazan, R. | Parsing with Suffix and Prefix Dictionaries [BibTeX] |
1996 | Proceedings Data Compression Conference | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. | Tight bounds on the complexity of the Boyer-Moore string matching algorithm [BibTeX] |
1994 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Cole, R. | Tight bounds on the complexity of the Boyer-Moore string matching algorithm [BibTeX] |
1991 | Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. | A new proof of the linearity of the Boyer-Moore string-matching algorithm [BibTeX] |
1990 | 3rd Maryland Theoretical Science Day | inproceedings | |

BibTeX:
@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 = {?--?} } |
|||||

Cole, R. | Tight bounds on the complexity of the Boyer-Moore string matching algorithm [BibTeX] |
1990 | techreport | ||

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

Cole, R., Crochemore, M., Galil, Z., Gasieniec, L., Hariharan, R., Muthukrishnan, S., Park, K. & Rytter, W. | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions [BibTeX] |
1993 | Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. & Hariharan, R. | Faster Suffix Tree Construction with Missing Suffix Links [BibTeX] |
2000 | Proceedings ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. & Hariharan, R. | Dynamic LCA Queries on Trees [BibTeX] |
1999 | Proceedings ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. & Hariharan, R. | Approximate String Matching: A Faster Simpler Algorithm [BibTeX] |
1998 | Proceedings of the 9th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. & Hariharan, R. | Tree Pattern Matching and Subset Matching in Randomized O(n m) Time [BibTeX] |
1997 | Proceedings of the 29th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R. & Hariharan, R. | Tighter Upper Bounds on the Exact Complexity of String Matching [BibTeX] |
1997 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Cole, R. & Hariharan, R. | Tighter bounds on the exact complexity of string matching [BibTeX] |
1992 | Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R., Hariharan, R., Paterson, M. & Zwick, U. | Tighter lower bounds on the exact complexity of string matching [BibTeX] |
1995 | SIAM J. Comput. | article | |

BibTeX:
@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} } |
|||||

Cole, R., Hariharan, R., Paterson, M. & Zwick, U. | Which patterns are hard to find ? [BibTeX] |
1993 | Proceedings of the 2nd Israeli Symposium on Theory of Computing and Systems | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R., Iliopoulos, C. S., Lecroq, T., Plandowski, W. & Rytter, W. | On Special Families of Morphisms Related to delta-Matching and Don't Care Symbols [BibTeX] |
2003 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Cole, R., Iliopoulos, C. S., Lecroq, T., Plandowski, W. & Rytter, W. | Relations between delta-matching and matching with don't care symbols: delta-distinguishing morphisms [BibTeX] |
2001 | Proceedings of the 12th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@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} } |
|||||

Cole, R., Iliopoulos, C. S., Mohamed, M., Smyth, W. F. & Yang, L. | The Complexity of the Minimum k-Cover Problem [BibTeX] |
2005 | Journal of Automata, Languages and Combinatorics | article | |

BibTeX:
@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} } |
|||||

Cole, R., Iliopoulos, C. S., Mohamed, M., Smyth, W. F. & Yang, L. | The Complexity of the Minimum k-Cover Problem [BibTeX] |
2005 | Journal of Automata, Languages and Combinatorics | article | |

BibTeX:
@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} } |
|||||

Collins, J. F. & Coulson, A. F. W. | Molecular sequence comparison and alignments [BibTeX] |
1987 | Nucleic acid and protein sequence analysis: A practical approach | incollection | |

BibTeX:
@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} } |
|||||

Colussi, L. | Fastest pattern matching in strings [BibTeX] |
1994 | J. Algorithms | article | |

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

Colussi, L. | Correctness and efficiency of the pattern matching algorithms [BibTeX] |
1991 | Inf. Comput. | article | |

BibTeX:
@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} } |
|||||

Colussi, L. & Col, A. D. | A time and space efficient data structure for sring searching on large texts [BibTeX] |
1996 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Colussi, L., Galil, Z. & Giancarlo, R. | On the exact complexity of string matching [BibTeX] |
1990 | Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Colussi, L. & Toniolo, L. | How the character comparison order shapes the shift function of on-line pattern matching algorithms [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Commentz-Walter, B. | A string matching algorithm fast on the average [BibTeX] |
1979 | Proceedings of the 6th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@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} } |
|||||

Commentz-Walter, B. | A string matching algorithm fast on the average [BibTeX] |
1979 | techreport | ||

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

Consel, C. & Danvy, O. | Partial evaluation of pattern matching in strings [BibTeX] |
1989 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Cook | Linear time simulation of deterministic two-way pushdown automata [BibTeX] |
1971 | Proceedings of the 5th IFIP World Computer Congress | inproceedings | |

BibTeX:
@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} } |
|||||

Copeland, G. P. | String storage and searching database applications: implementation on the INDY backend kernel [BibTeX] |
1978 | Proceedings of the 4th Workshop on Computer Architecture for Non-numeric Processing | inproceedings | |

BibTeX:
@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} } |
|||||

Core, N. G., Edmiston, E. W., Saltz, J. H. & Smith, R. M. | Supercomputers and Biological Sequence Comparison Algorithms [BibTeX] |
1989 | Comp. Biomed. Res. | article | |

BibTeX:
@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} } |
|||||

Cori, R. & Perrin, D. | Automates et commutations partielles [BibTeX] |
1985 | RAIRO Inform. Théor. | article | |

BibTeX:
@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} } |
|||||

Cormen, T. H., Leiserson, C. E. & Rivest, R. L. | Introduction to Algorithms [BibTeX] |
1990 | book | ||

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

Corpet, F. | Multiple sequence alignment with hierarchical clustering [BibTeX] |
1988 | Nucleic Acids Res. | article | |

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

Coward, E. & Drabls, F. | Detecting periodic patterns in biological sequences [BibTeX] |
1998 | Bioinformatics | article | |

BibTeX:
@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} } |
|||||

Craven, T. C. | Adapting of String Indexing Systems for Retrieval using Proximity Operators [BibTeX] |
1988 | Inf. Process. Manage. | article | |

BibTeX:
@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} } |
|||||

Craven, T. C. | String Indexing [BibTeX] |
1986 | book | ||

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

Crochemore, M. | Reducing Space for Index Implementation [BibTeX] |
2003 | Theor. Comput. Sci. | article | |

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

Crochemore, M. | Off-line serial exact string searching [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Off-line serial exact string searching [BibTeX] |
1993 | techreport | ||

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

Crochemore, M. | String-matching on ordered alphabets [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

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

Crochemore, M. | A la recherche d'un mot [BibTeX] |
1990 | Actes des Journées Montoises | inproceedings | |

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

Crochemore, M. | Constant-space string-matching [BibTeX] |
1990 | Sequences, combinatorics, compression, security and transmission | inproceedings | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Data compression with substitution [BibTeX] |
1989 | Electronic, Dictionaries and Automata in Computational Linguistics | incollection | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Automata and algorithms [BibTeX] |
1989 | Formal Properties of Finite Automata and Applications | incollection | |

BibTeX:
@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} } |
|||||

Crochemore, M. | String-matching and periods [BibTeX] |
1989 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

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

Crochemore, M. | String matching with constraints [BibTeX] |
1988 | Proceedings 13th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Constant-space string-matching [BibTeX] |
1988 | Proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science | inproceedings | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Compression de textes: les méthodes [BibTeX] |
1988 | techreport | ||

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

Crochemore, M. | Longest common factor of two words [BibTeX] |
1987 | Proceedings of the 2nd Theory and Practice of Software Development | incollection | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Transducers and repetitions [BibTeX] |
1986 | Theor. Comput. Sci. | article | |

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

Crochemore, M. | Calcul de la f-distance de deux mots [BibTeX] |
1986 | Actes du séminaire d'informatique théorique du L.I.T.P. | inproceedings | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Computing LCF in linear time [BibTeX] |
1986 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Optimal factor tranducers [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Linear searching for a square in a word [BibTeX] |
1984 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Tests sur les morphismes faiblement sans carré [BibTeX] |
1983 | Combinatorics on Words | incollection | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Recherche linéaire d'un carré dans un mot [BibTeX] |
1983 | Comptes Rendus Acad. Sci. Paris Sér. I Math. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Régularités évitables [BibTeX] |
1983 | School: Université Paris 7, France |
phdthesis | |

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

Crochemore, M. | A solution to P12 [BibTeX] |
1983 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

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

Crochemore, M. | Recherche linéaire d'un carré dans un mot [BibTeX] |
1983 | Comptes Rendus Acad. Sci. Paris Sér. I Math. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Mots et morphismes sans carré [BibTeX] |
1983 | Ann. Discret. Math. | article | |

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

Crochemore, M. | Sharp Characterizations of Squarefree Morphisms [BibTeX] |
1982 | Theor. Comput. Sci. | article | |

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

Crochemore, M. | Résultats de décidabilité pour les morphismes faiblement sans carré [BibTeX] |
1982 | techreport | ||

BibTeX:
@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} } |
|||||

Crochemore, M. | Sur les ensembles inévitables [BibTeX] |
1982 | techreport | ||

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

Crochemore, M. | A solution to Berstel's problem P3 [BibTeX] |
1982 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M. | An optimal algorithm for computing the repetitions in a word [BibTeX] |
1981 | Inf. Process. Lett. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M. | Détermination optimale des répétitions dans un mot [BibTeX] |
1980 | techreport | ||

BibTeX:
@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} } |
|||||

Crochemore, M., Berstel, J. & Pin, J. | Thue-Morse sequence and p-adic topology of the free monoid [BibTeX] |
1989 | Ann. Discret. Math. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M., Chytil, M., Monien, B. & Rytter, W. | On the parallel recognition of unambiguous context-free languages [BibTeX] |
1991 | Theor. Comput. Sci. | article | |

BibTeX:
@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} } |
|||||

Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W. & Rytter, W. | Speeding up two string matching algorithms [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@article{Crochemore1994, author = {M. Crochemore and A. Czumaj and L. G{\c a}sieniec and S. Jarominek and T. Lecroq and W. Plandowski and W. Rytter}, title = {Speeding up two string matching algorithms}, journal = {Algorithmica}, year = {1994}, volume = {12}, number = {4/5}, pages = {247--267} } |
|||||

Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W. & Rytter, W. | Fast practical multi-pattern matching [BibTeX] |
1993 | techreport | ||

BibTeX:
@techreport{Crochemore1993a, author = {M. Crochemore and A. Czumaj and L. G{\c a}sieniec and S. Jarominek and T. Lecroq and W. Plandowski and W. Rytter}, title = {Fast practical multi-pattern matching}, year = {1993}, number = {93-3} } |
|||||

Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W. & Rytter, W. | Speeding up two string matching algorithms [BibTeX] |
1992 | Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Crochemore1992a, author = {M. Crochemore and A. Czumaj and L. G{\c a}sieniec and S. Jarominek and T. Lecroq and W. Plandowski and W. Rytter}, title = {Speeding up two string matching algorithms}, booktitle = {Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {577}, pages = {589--600} } |
|||||

Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W. & Rytter, W. | Speeding up two string matching algorithms [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Crochemore1992b, author = {M. Crochemore and A. Czumaj and L. G{\c a}sieniec and S. Jarominek and T. Lecroq and W. Plandowski and W. Rytter}, title = {Speeding up two string matching algorithms}, year = {1992}, number = {LITP 92.21} } |
|||||

Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W. & Rytter, W. | Deux méthodes pour accélerer l'algorithme de Boyer-Moore [BibTeX] |
1991 | Actes des 2e Journées franco-belges: Théories des Automates et Applications | inproceedings | |

BibTeX:
@inproceedings{Crochemore1991a, author = {M. Crochemore and A. Czumaj and L. G{\c a}sieniec and S. Jarominek and T. Lecroq and W. Plandowski and W. Rytter}, title = {Deux m{\'e}thodes pour acc{\'e}lerer l'algorithme de {Boyer-Moore}}, booktitle = {Actes des 2e Journ{\'e}es franco-belges: Th{\'e}ories des Automates et Applications}, year = {1991}, number = {176}, pages = {45--63} } |
|||||

Crochemore, M., Czumaj, A., Gasieniec, L., Lecroq, T., Plandowski, W. & Rytter, W. | Fast practical multi-pattern matching [BibTeX] |
1999 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1999, author = {M. Crochemore and A. Czumaj and L. G{\c a}sieniec and T. Lecroq and W. Plandowski and W. Rytter}, title = {Fast practical multi-pattern matching}, journal = {Inf. Process. Lett.}, year = {1999}, volume = {71}, number = {(3--4)}, pages = {107--113} } |
|||||

Crochemore, M., Désarménien, J. & Perrin, D. | A note on the Burrows-Wheeler transformation [BibTeX] |
2005 | Theoretical Computer Science | article | |

BibTeX:
@article{Crochemore2005a, author = {Maxime Crochemore and Jacques Désarménien and Dominique Perrin}, title = {{A} note on the {B}urrows-{W}heeler transformation}, journal = {Theoretical Computer Science}, year = {2005}, volume = {332}, number = {1-3}, pages = {567–572} } |
|||||

Crochemore, M., Galil, Z., Gasieniec, L., Park, K. & Rytter, W. | Constant-Time Randomized Parallel String Matching [BibTeX] |
1997 | SIAM J. Comput. | article | |

BibTeX:
@article{Crochemore1997a, author = {M. Crochemore and Z. Galil and L. G{\c a}sieniec and K. Park and W. Rytter}, title = {Constant-Time Randomized Parallel String Matching}, journal = {SIAM J. Comput.}, year = {1997}, volume = {26}, number = {4}, pages = {950--960} } |
|||||

Crochemore, M. & Goralcik, P. | Mutually avoiding ternary words of small exponent [BibTeX] |
1992 | Int. J. Algebr. Comput. | article | |

BibTeX:
@article{Crochemore1992c, author = {M. Crochemore and P. Goralcik}, title = {Mutually avoiding ternary words of small exponent}, journal = {Int. J. Algebr. Comput.}, year = {1992}, volume = {1}, number = {4}, pages = {407--410} } |
|||||

Crochemore, M. & Goralcik, P. | Mutually avoiding ternary words of small exponent [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Crochemore1991b, author = {M. Crochemore and P. Goralcik}, title = {Mutually avoiding ternary words of small exponent}, year = {1991}, number = {LITP 91.26} } |
|||||

Crochemore, M., Gasieniec, L., Hariharan, R., Muthukrishnan, S. & Rytter, W. | A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching [BibTeX] |
1998 | SIAM J. Comput. | article | |

BibTeX:
@article{Crochemore1998, author = {M. Crochemore and L. G{\c a}sieniec and R. Hariharan and S. Muthukrishnan and W. Rytter}, title = {A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching}, journal = {SIAM J. Comput.}, year = {1998}, volume = {27}, number = {3}, pages = {668--681} } |
|||||

Crochemore, M., Gasieniec, L., Plandowski, W. & Rytter, W. | Two-dimensional pattern matching in linear time and small space [BibTeX] |
1995 | Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Crochemore1995, author = {M. Crochemore and L. G{\c a}sieniec and W. Plandowski and W. Rytter}, title = {Two-dimensional pattern matching in linear time and small space}, booktitle = {Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {900}, pages = {181--192} } |
|||||

Crochemore, M., Gasieniec, L. & Rytter, W. | Constant-space string-matching in sublinear average time [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Crochemore1999a, author = {M. Crochemore and L. G{\c a}sieniec and W. Rytter}, title = {Constant-space string-matching in sublinear average time}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {218}, number = {1}, pages = {197--203} } |
|||||

Crochemore, M., Gasieniec, L. & Rytter, W. | Two-dimensional pattern matching by sampling [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1993b, author = {M. Crochemore and L. G{\c a}sieniec and W. Rytter}, title = {Two-dimensional pattern matching by sampling}, journal = {Inf. Process. Lett.}, year = {1993}, volume = {46}, number = {4}, pages = {159--162} } |
|||||

Crochemore, M., Gasieniec, L. & Rytter, W. | Turbo-BM [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Crochemore1992d, author = {M. Crochemore and L. G{\c a}sieniec and W. Rytter}, title = {Turbo-{BM}}, year = {1992}, number = {LITP 92.61} } |
|||||

Crochemore, M. & Hancart, C. | Pattern Matching in Strings [BibTeX] |
1998 | Algorithms and Theory of Computation Handbook | incollection | |

BibTeX:
@incollection{Crochemore1998a, author = {M. Crochemore and C. Hancart}, title = {Pattern Matching in Strings}, booktitle = {Algorithms and Theory of Computation Handbook}, publisher = {CRC Press Inc.}, year = {1998}, pages = {11.1--11.28} } |
|||||

Crochemore, M. & Hancart, C. | Automata for matching patterns [BibTeX] |
1997 | Handbook of Formal Languages | incollection | |

BibTeX:
@incollection{Crochemore1997b, author = {M. Crochemore and C. Hancart}, title = {Automata for matching patterns}, booktitle = {Handbook of Formal Languages}, publisher = {Springer-Verlag, Berlin}, year = {1997}, volume = {2 Linear Modeling: Background and Application}, pages = {399--462} } |
|||||

Crochemore, M. & Hancart, C. | Automata for matching patterns [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Crochemore1996, author = {M. Crochemore and C. Hancart}, title = {Automata for matching patterns}, year = {1996}, number = {LIR96.17 Informatique Fondamentale} } |
|||||

Crochemore, M. & Hancart, C. | Pattern matching in strings [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Crochemore1996a, author = {M. Crochemore and C. Hancart}, title = {Pattern matching in strings}, year = {1996}, number = {LIR96.18 Informatique Fondamentale} } |
|||||

Crochemore, M., Hancart, C. & Lecroq, T. | Algorithmique du texte [BibTeX] |
2001 | book | ||

BibTeX:
@book{Crochemore2001, author = {M. Crochemore and C. Hancart and T. Lecroq}, title = {Algorithmique du texte}, publisher = {Vuibert}, year = {2001} } |
|||||

Crochemore, M., Iliopoulos, C. & Korda, M. | Two-dimensional prefix string matching and covering on square matrix [BibTeX] |
1998 | Algorithmica | article | |

BibTeX:
@article{Crochemore1998b, author = {M. Crochemore and C. Iliopoulos and M. Korda}, title = {Two-dimensional prefix string matching and covering on square matrix}, journal = {Algorithmica}, year = {1998}, volume = {20}, number = {4}, pages = {353--373} } |
|||||

Crochemore, M., Iliopoulos, C., Lecroq, T., Pinzon, Y., Plandowski, W. & Rytter, W. | Occurrence and Substring Heuristics for emph-Matching [BibTeX] |
2003 | Fundamenta Informaticae | article | |

BibTeX:
@article{Crochemore2003a, author = {M. Crochemore and C.S. Iliopoulos and T. Lecroq and Y.J. Pinzon and W. Plandowski and W. Rytter}, title = {Occurrence and Substring Heuristics for emph{\delta}-Matching}, journal = {Fundamenta Informaticae}, year = {2003}, note = {Accepted} } |
|||||

Crochemore, M., Iliopoulos, C., Navarro, G., Pinzon, Y. & Salinger, A. | Bit-parallel (δ,γ)-Matching Suffix Automata [BibTeX] |
2005 | Journal of Discrete Algorithms (JDA) | article | |

BibTeX:
@article{Crochemore2005, author = {M. Crochemore and C. Iliopoulos and G. Navarro and Y. Pinzon and A. Salinger}, title = {Bit-parallel \emph{(δ,γ)}-Matching Suffix Automata}, journal = {Journal of Discrete Algorithms (JDA)}, publisher = {Elsevier Science}, year = {2005}, volume = {3}, number = {2--4}, pages = {198--214} } |
|||||

Crochemore, M., Iliopoulos, C. S., Korda, M. & Reid, J. F. | Two-dimensional dictionary prefix-matching [BibTeX] |
1998 | Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Crochemore1998c, author = {M. Crochemore and C. S. Iliopoulos and M. Korda and J. F. Reid}, title = {Two-dimensional dictionary prefix-matching}, booktitle = {Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms}, year = {1998}, pages = {147--158} } |
|||||

Crochemore, M., Iliopoulos, C. S., Lecroq, T. & Pinzon, Y. J. | Approximate string matching in musical sequences [BibTeX] |
2001 | Proceedings of the Prague Stringology Conference'01 | inproceedings | |

BibTeX:
@inproceedings{Crochemore2001a, author = {M. Crochemore and C. S. Iliopoulos and T. Lecroq and Y. J. Pinzon}, title = {Approximate string matching in musical sequences}, booktitle = {Proceedings of the Prague Stringology Conference'01}, year = {2001}, pages = {26--36}, note = {Annual Report DC--2001--06} } |
|||||

Crochemore, M., Iliopoulos, C. S., Lecroq, T., Plandowski, W. & Rytter, W. | Three heuristics for delta-matching: delta-BM algorithms [BibTeX] |
2002 | Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Crochemore2002, author = {M. Crochemore and C. S. Iliopoulos and T. Lecroq and W. Plandowski and W. Rytter}, title = {Three heuristics for \emph{\delta}-matching: \emph{\delta}-{BM} algorithms}, booktitle = {Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2002}, number = {2373}, pages = {178--189} } |
|||||

Crochemore, M., Iliopoulos, C. S., Lecroq, T., andWojciech Plandowski, Y. P. & Rytter, W. | Occurrence and Substring Heuristics for delta-Matching [BibTeX] |
2003 | International Journal of Fundamenta Informaticae | article | |

BibTeX:
@article{Crochemore2003b, author = {Maxime Crochemore and Costas S. Iliopoulos and Thierry Lecroq and Yoan Pinzon andWojciech Plandowski and Wojciech Rytter}, title = {Occurrence and Substring Heuristics for delta-Matching}, journal = {International Journal of Fundamenta Informaticae}, year = {2003}, volume = {56}, number = {1-2}, pages = {89-103} } |
|||||

Crochemore, M., Iliopoulos, C. S., Mohamed, M. & Sagot, M. | Longest Repeats with a Block of k Don't Cares [BibTeX] |
2006 | Theoretical Computer Science | article | |

BibTeX:
@article{Crochemore2006a, author = {Maxime Crochemore and Costas S. Iliopoulos and Manal Mohamed and Marie-France Sagot}, title = {{L}ongest {R}epeats with a {B}lock of \emph{k} {D}on't {C}ares}, journal = {Theoretical Computer Science}, year = {2006}, volume = {362}, number = {1-3}, pages = {248–254} } |
|||||

Crochemore, M., Iliopoulos, C. S. & Pinzon, Y. | Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms [BibTeX] |
2003 | nternational Journal of Fundamenta Informaticae | article | |

BibTeX:
@article{Crochemore2003c, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan Pinzon}, title = {Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms}, journal = {nternational Journal of Fundamenta Informaticae}, year = {2003}, volume = {56}, number = {1-2}, pages = {1-15} } |
|||||

Crochemore, M., Iliopoulos, C. S., Pinzon, Y. J. & Reid, J. F. | A fast and practical bit-vector algorithm for the longest common subsequence problem [BibTeX] |
2001 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore2001b, author = {M. Crochemore and C. S. Iliopoulos and Y. J. Pinzon and J. F. Reid}, title = {A fast and practical bit-vector algorithm for the longest common subsequence problem}, journal = {Inf. Process. Lett.}, year = {2001}, volume = {80}, number = {6}, pages = {279--285} } |
|||||

Crochemore, M., Iliopoulos, C. S., Pinzon, Y. J. & Reid, J. F. | A fast and practical bit-vector algorithm for the longest common subsequence problem [BibTeX] |
2000 | Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Crochemore2000, author = {M. Crochemore and C. S. Iliopoulos and Y. J. Pinzon and J. F. Reid}, title = {A fast and practical bit-vector algorithm for the longest common subsequence problem}, booktitle = {Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms}, year = {2000}, pages = {75--86} } |
|||||

Crochemore, M., Iliopoulos, C. S. & Yu, H. | Algorithms for computing evolutionary chains in molecular and musical sequences [BibTeX] |
1998 | Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Crochemore1998d, author = {M. Crochemore and C. S. Iliopoulos and H. Yu}, title = {Algorithms for computing evolutionary chains in molecular and musical sequences}, booktitle = {Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms}, year = {1998}, pages = {172--184} } |
|||||

Crochemore, M. & Lecroq, T. | Text data compression algorithms [BibTeX] |
1998 | Algorithms and Theory of Computation Handbook | incollection | |

BibTeX:
@incollection{Crochemore1998e, author = {M. Crochemore and T. Lecroq}, title = {Text data compression algorithms}, booktitle = {Algorithms and Theory of Computation Handbook}, publisher = {CRC Press Inc.}, year = {1998}, pages = {12.1--12.23} } |
|||||

Crochemore, M. & Lecroq, T. | Tight bounds on the complexity of the Apostolico-Giancarlo algorithm [BibTeX] |
1997 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1997c, author = {M. Crochemore and T. Lecroq}, title = {Tight bounds on the complexity of the {Apostolico-Giancarlo} algorithm}, journal = {Inf. Process. Lett.}, year = {1997}, volume = {63}, number = {4}, pages = {195--203} } |
|||||

Crochemore, M. & Lecroq, T. | Pattern matching and text data compression algorithms [BibTeX] |
1996 | The Computer Science and Engineering Handbook | incollection | |

BibTeX:
@incollection{Crochemore1996b, author = {M. Crochemore and T. Lecroq}, title = {Pattern matching and text data compression algorithms}, booktitle = {The Computer Science and Engineering Handbook}, publisher = {CRC Press Inc.}, year = {1996}, pages = {162--202} } |
|||||

Crochemore, M. & Lecroq, T. | Tight bounds on the complexity of the Apostolico-Giancarlo algorithm [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Crochemore1996c, author = {M. Crochemore and T. Lecroq}, title = {Tight bounds on the complexity of the {Apostolico-Giancarlo} algorithm}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {64--74} } |
|||||

Crochemore, M. & Lecroq, T. | Pattern matching and text data compression algorithms [BibTeX] |
1996 | ACM Comp. Surv. | article | |

BibTeX:
@article{Crochemore1996d, author = {M. Crochemore and T. Lecroq}, title = {Pattern matching and text data compression algorithms}, journal = {ACM Comp. Surv.}, year = {1996}, volume = {28}, number = {1}, pages = {39--41} } |
|||||

Crochemore, M. & Lecroq, T. | Tight bounds on the complexity of the Apostolico-Giancarlo algorithm [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Crochemore1996e, author = {M. Crochemore and T. Lecroq}, title = {Tight bounds on the complexity of the {Apostolico-Giancarlo} algorithm}, year = {1996}, number = {LIR96.12 Informatique Fondamentale} } |
|||||

Crochemore, M. & Lecroq, T. | Text data compression algorithms [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Crochemore1996f, author = {M. Crochemore and T. Lecroq}, title = {Text data compression algorithms}, year = {1996}, number = {LIR96.15 Informatique Fondamentale} } |
|||||

Crochemore, M. & Lecroq, T. | Pattern matching and text data compression algorithms [BibTeX] |
1995 | techreport | ||

BibTeX:
@techreport{Crochemore1995a, author = {M. Crochemore and T. Lecroq}, title = {Pattern matching and text data compression algorithms}, year = {1995}, number = {LIR95.11 Informatique Fondamentale} } |
|||||

Crochemore, M. & Lecroq, T. | Pattern matching and text data compression algorithms [BibTeX] |
1995 | techreport | ||

BibTeX:
@techreport{Crochemore1995b, author = {M. Crochemore and T. Lecroq}, title = {Pattern matching and text data compression algorithms}, year = {1995}, number = {IGM 95--21} } |
|||||

Crochemore, M., Lerest, M. & Wender, P. | An optimal test on finite unavoidable sets of words [BibTeX] |
1983 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1983f, author = {M. Crochemore and M. Lerest and P. Wender}, title = {An optimal test on finite unavoidable sets of words}, journal = {Inf. Process. Lett.}, year = {1983}, volume = {16}, number = {4}, pages = {179--180} } |
|||||

Crochemore, M., Lerest, M. & Wender, P. | Sur les ensembles inévitables [BibTeX] |
1982 | techreport | ||

BibTeX:
@techreport{Crochemore1982d, author = {M. Crochemore and M. Lerest and P. Wender}, title = {Sur les ensembles in{\'e}vitables}, year = {1982}, number = {LITP 82--56} } |
|||||

Crochemore, M., Mignosi, F. & Restivo, A. | Minimal Forbidden Words and Factor Automata [BibTeX] |
1998 | Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Crochemore1998f, author = {M. Crochemore and F. Mignosi and A. Restivo}, title = {Minimal Forbidden Words and Factor Automata}, booktitle = {Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1450}, pages = {665--673} } |
|||||

Crochemore, M., Mignosi, F. & Restivo, A. | Automata and Forbidden Words [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Crochemore1998g, author = {M. Crochemore and F. Mignosi and A. Restivo}, title = {Automata and Forbidden Words}, year = {1998}, number = {IGM 98-5} } |
|||||

Crochemore, M., Mignosi, F. & Restivo, A. | Automata and Forbidden Words [BibTeX] |
1998 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1998h, author = {M. Crochemore and F. Mignosi and A. Restivo}, title = {Automata and Forbidden Words}, journal = {Inf. Process. Lett.}, year = {1998}, volume = {67}, number = {3}, pages = {111--117} } |
|||||

Crochemore, M., Mignosi, F., Restivo, A. & Salemi, S. | Text Compression Using Antidictionaries [BibTeX] |
1999 | Proceedings of the 26th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Crochemore1999b, author = {M. Crochemore and F. Mignosi and A. Restivo and S. Salemi}, title = {Text Compression Using Antidictionaries}, booktitle = {Proceedings of the 26th International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1644}, pages = {261--270} } |
|||||

Crochemore, M., Mignosi, F., Restivo, A. & Salemi, S. | Data Compression using Antidictionaries [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Crochemore1998i, author = {M. Crochemore and F. Mignosi and A. Restivo and S. Salemi}, title = {Data Compression using Antidictionaries}, year = {1998}, number = {IGM 98-10} } |
|||||

Crochemore, M. & Néraud, J. | Unitary monoid with two generators: an algorithmic point of view [BibTeX] |
1990 | Proceedings of the 15th Colloquium on Trees in Algebra and Programming | inproceedings | |

BibTeX:
@inproceedings{Crochemore1990b, author = {M. Crochemore and J. N{\'e}raud}, title = {Unitary monoid with two generators: an algorithmic point of view}, booktitle = {Proceedings of the 15th Colloquium on Trees in Algebra and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1990}, number = {431}, pages = {117--131} } |
|||||

Crochemore, M. & Perrin, D. | Two-way string-matching [BibTeX] |
1991 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Crochemore1991c, author = {M. Crochemore and D. Perrin}, title = {Two-way string-matching}, journal = {J. Assoc. Comput. Mach.}, year = {1991}, volume = {38}, number = {3}, pages = {651--675} } |
|||||

Crochemore, M. & Perrin, D. | Two-way string-matching [BibTeX] |
1989 | techreport | ||

BibTeX:
@techreport{Crochemore1989d, author = {M. Crochemore and D. Perrin}, title = {Two-way string-matching}, year = {1989}, number = {LITP 89-8} } |
|||||

Crochemore, M. & Perrin, D. | Pattern matching in strings [BibTeX] |
1988 | Proceedings 4th Conference on Image Analysis and Processing | inproceedings | |

BibTeX:
@inproceedings{Crochemore1988c, author = {M. Crochemore and D. Perrin}, title = {Pattern matching in strings}, booktitle = {Proceedings 4th Conference on Image Analysis and Processing}, publisher = {Plenum Press}, year = {1988}, number = {249}, pages = {67--79} } |
|||||

Crochemore, M. & Perrin, D. | Pattern matching in strings [BibTeX] |
1988 | techreport | ||

BibTeX:
@techreport{Crochemore1988d, author = {M. Crochemore and D. Perrin}, title = {Pattern matching in strings}, year = {1988}, number = {LITP 88.5} } |
|||||

Crochemore, M. & Perrin, D. | Critical factorizations of words [BibTeX] |
1988 | Bull. Eur. Assoc. Theor. Comput. Sci. | article | |

BibTeX:
@article{Crochemore1988e, author = {M. Crochemore and D. Perrin}, title = {Critical factorizations of words}, journal = {Bull. Eur. Assoc. Theor. Comput. Sci.}, year = {1988}, volume = {34}, pages = {47--52} } |
|||||

Crochemore, M. & Pécuchet, J. | Compression de dictionnaires [BibTeX] |
1987 | techreport | ||

BibTeX:
@techreport{Crochemore1987a, author = {M. Crochemore and J.-P. P{\'e}cuchet}, title = {Compression de dictionnaires}, year = {1987}, number = {LADL} } |
|||||

Crochemore, M. & Pécuchet, J. | Réduction d'un lexique pour micro-ordinateur [BibTeX] |
1987 | techreport | ||

BibTeX:
@techreport{Crochemore1987b, author = {M. Crochemore and J.-P. P{\'e}cuchet}, title = {R{\'e}duction d'un lexique pour micro-ordinateur}, year = {1987}, number = {LADL} } |
|||||

Crochemore, M. & Rytter, W. | On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching [BibTeX] |
1995 | Proceedings of the 2nd Latin American Symposium | inproceedings | |

BibTeX:
@inproceedings{Crochemore1995c, author = {M. Crochemore and W. Rytter}, title = {On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching}, booktitle = {Proceedings of the 2nd Latin American Symposium}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {911}, pages = {220--229} } |
|||||

Crochemore, M. & Rytter, W. | Squares, cubes and time-space efficient string-searching [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@article{Crochemore1995d, author = {M. Crochemore and W. Rytter}, title = {Squares, cubes and time-space efficient string-searching}, journal = {Algorithmica}, year = {1995}, volume = {13}, number = {5}, pages = {405--425} } |
|||||

Crochemore, M. & Rytter, W. | Text algorithms [BibTeX] |
1994 | book | ||

BibTeX:
@book{Crochemore1994a, author = {M. Crochemore and W. Rytter}, title = {Text algorithms}, publisher = {Oxford University Press}, year = {1994} } |
|||||

Crochemore, M. & Rytter, W. | On two-dimensional pattern-matching by optimal parallel algorithms [BibTeX] |
1994 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Crochemore1994b, author = {M. Crochemore and W. Rytter}, title = {On two-dimensional pattern-matching by optimal parallel algorithms}, journal = {Theor. Comput. Sci.}, year = {1994}, volume = {132}, number = {2}, pages = {403--414} } |
|||||

Crochemore, M. & Rytter, W. | Periodic prefix in strings [BibTeX] |
1993 | Proceedings Sequences II | inproceedings | |

BibTeX:
@inproceedings{Crochemore1993c, author = {M. Crochemore and W. Rytter}, title = {Periodic prefix in strings}, booktitle = {Proceedings Sequences II}, publisher = {Springer-Verlag, Berlin}, year = {1993}, pages = {153--165} } |
|||||

Crochemore, M. & Rytter, W. | Note on two-dimensional pattern-matching by optimal parallel algorithms [BibTeX] |
1992 | Proceedings of the 2nd International Conference on Parallel Image Analysis | inproceedings | |

BibTeX:
@inproceedings{Crochemore1992e, author = {M. Crochemore and W. Rytter}, title = {Note on two-dimensional pattern-matching by optimal parallel algorithms}, booktitle = {Proceedings of the 2nd International Conference on Parallel Image Analysis}, publisher = {Springer-Verlag, Berlin}, year = {1992}, pages = {100--112} } |
|||||

Crochemore, M. & Rytter, W. | Cubes, squares and time-space efficient string-searching [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Crochemore1991d, author = {M. Crochemore and W. Rytter}, title = {Cubes, squares and time-space efficient string-searching}, year = {1991}, number = {LITP 91-47} } |
|||||

Crochemore, M. & Rytter, W. | Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays [BibTeX] |
1991 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Crochemore1991e, author = {M. Crochemore and W. Rytter}, title = {Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays}, journal = {Theor. Comput. Sci.}, year = {1991}, volume = {88}, number = {1}, pages = {59--82} } |
|||||

Crochemore, M. & Rytter, W. | Efficient parallel algorithms to test square-freeness and factorize strings [BibTeX] |
1991 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1991f, author = {M. Crochemore and W. Rytter}, title = {Efficient parallel algorithms to test square-freeness and factorize strings}, journal = {Inf. Process. Lett.}, year = {1991}, volume = {38}, number = {2}, pages = {57--60} } |
|||||

Crochemore, M. & Rytter, W. | Parallel computations on strings and arrays [BibTeX] |
1990 | Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Crochemore1990c, author = {M. Crochemore and W. Rytter}, title = {Parallel computations on strings and arrays}, booktitle = {Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1990}, number = {415}, pages = {109--125} } |
|||||

Crochemore, M. & Rytter, W. | Parallel construction of minimal suffix and factor automata [BibTeX] |
1990 | Proceedings of the 15th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Crochemore1990d, author = {M. Crochemore and W. Rytter}, title = {Parallel construction of minimal suffix and factor automata}, booktitle = {Proceedings of the 15th Symposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1990}, number = {452}, pages = {217--223} } |
|||||

Crochemore, M. & Rytter, W. | Parallel construction of minimal suffix and factor automata [BibTeX] |
1990 | Inf. Process. Lett. | article | |

BibTeX:
@article{Crochemore1990e, author = {M. Crochemore and W. Rytter}, title = {Parallel construction of minimal suffix and factor automata}, journal = {Inf. Process. Lett.}, year = {1990}, volume = {35}, number = {3}, pages = {121--128} } |
|||||

Crochemore, M. & Rytter, W. | Testing square-freeness of strings by an optimal parallel algorithm in logarithmic time [BibTeX] |
1990 | techreport | ||

BibTeX:
@techreport{Crochemore1990f, author = {M. Crochemore and W. Rytter}, title = {Testing square-freeness of strings by an optimal parallel algorithm in logarithmic time}, year = {1990}, number = {LITP 90-63} } |
|||||

Crochemore, M. & Vérin, R. | Direct construction of compact directed acyclic word graphs [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Crochemore1997d, author = {M. Crochemore and R. V{\'e}rin}, title = {Direct construction of compact directed acyclic word graphs}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {116--129} } |
|||||

Crochemore, M. & Vérin, R. | On Compact Directed Acyclic Word Graphs [BibTeX] |
1997 | Structures in Logic and Computer Science | incollection | |

BibTeX:
@incollection{Crochemore1997e, author = {M. Crochemore and R. V{\'e}rin}, title = {On Compact Directed Acyclic Word Graphs}, booktitle = {Structures in Logic and Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1261}, pages = {192--211} } |
|||||

Crochemore, M. & Zipstein, M. | Transducteurs arithmétiques [BibTeX] |
1989 | techreport | ||

BibTeX:
@techreport{Crochemore1989e, author = {M. Crochemore and M. Zipstein}, title = {Transducteurs arithm{\'e}tiques}, year = {1989}, number = {LITP 89.12} } |
|||||

Cryan, M., Goldberg, L. A. & Phillips, C. A. | Approximation algorithms for the fixed-topology phylogenetic number problem [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Cryan1997, author = {M. Cryan and L. A. Goldberg and C. A. Phillips}, title = {Approximation algorithms for the fixed-topology phylogenetic number problem}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {130--149} } |
|||||

Culik II, K. & Karhumäki, J. | Systems of equations over a free monoid and Ehrenfeucht's conjecture [BibTeX] |
1983 | Discret. Math. | article | |

BibTeX:
@article{Culik1983, author = {Culik II, K. and J. Karhum{\"a}ki}, title = {Systems of equations over a free monoid and Ehrenfeucht's conjecture}, journal = {Discret. Math.}, year = {1983}, volume = {43}, pages = {139--153} } |
|||||

Cull, P. & Holloway, J. | A divide and conquer approach to approximate string matching [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Cull1991, author = {P. Cull and J. Holloway}, title = {A divide and conquer approach to approximate string matching}, year = {1991}, number = {TR-91-50-1} } |
|||||

Cull, P., Holloway, J. & Cavener, J. | Walking Tree Heuristics for String Matching and Gene Location [BibTeX] |
1997 | techreport | ||

BibTeX:
@techreport{Cull1997, author = {P. Cull and J. Holloway and J. Cavener}, title = {Walking Tree Heuristics for String Matching and Gene Location}, year = {1997}, number = {97-20-02} } |
|||||

Cull, P. & Holloway, J. L. | Reconstructing sequences from shotgun data [BibTeX] |
1991 | Sequences: Combinatorics, Compression, Security, and Transmission | inproceedings | |

BibTeX:
@inproceedings{Cull1991a, author = {P. Cull and J. L. Holloway}, title = {Reconstructing sequences from shotgun data}, booktitle = {Sequences: Combinatorics, Compression, Security, and Transmission}, publisher = {Springer-Verlag, Berlin}, year = {1991} } |
|||||

Cummings, L. J. | Strongly qth power-free strings [BibTeX] |
1983 | Ann. Discret. Math. | article | |

BibTeX:
@article{Cummings1983, author = {L. J. Cummings}, title = {Strongly {\emph{q}}th power-free strings}, journal = {Ann. Discret. Math.}, year = {1983}, volume = {17}, pages = {247--252} } |
|||||

Cummings, L. J. | Overlapping substrings and Thue's problem [BibTeX] |
1981 | Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing | inproceedings | |

BibTeX:
@inproceedings{Cummings1981, author = {L. J. Cummings}, title = {Overlapping substrings and {Thue}'s problem}, booktitle = {Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing}, year = {1981}, pages = {99--109} } |
|||||

Cummings, L. J. & Smyth, W. F. | Weak repetitions in strings [BibTeX] |
1997 | J. Comb. Math. Comb. Comp. | article | |

BibTeX:
@article{Cummings1997, author = {L. J. Cummings and W. F. Smyth}, title = {Weak repetitions in strings}, journal = {J. Comb. Math. Comb. Comp.}, year = {1997}, volume = {24}, pages = {33--48} } |
|||||

Czumaj, A., Ferragina, P., Gasieniec, L., Muthukrishnan, S. & Träff, J. L. | The architecture of a software library for string processing [BibTeX] |
1997 | Proceedings of the Workshop on Algorithm Engineering | inproceedings | |

BibTeX:
@inproceedings{Czumaj1997, author = {A. Czumaj and P. Ferragina and L. G{\c a}sieniec and S. Muthukrishnan and J. L. Tr{\"a}ff}, title = {The architecture of a software library for string processing}, booktitle = {Proceedings of the Workshop on Algorithm Engineering}, year = {1997}, pages = {166--176} } |
|||||

Czumaj, A. & Gasieniec, L. | On the Complexity of Determining the Period of a String [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Czumaj2000, author = {A. Czumaj and L. G{\c a}sieniec}, title = {On the Complexity of Determining the Period of a String}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {412--422} } |
|||||

Czumaj, A., Gasieniec, L., Piotrow, M. & Rytter, W. | Sequential and Parallel Approximation of Shortest Superstrings [BibTeX] |
1997 | J. Algorithms | article | |

BibTeX:
@article{Czumaj1997a, author = {A. Czumaj and L. G{\c a}sieniec and M. Piotrow and W. Rytter}, title = {Sequential and Parallel Approximation of Shortest Superstrings}, journal = {J. Algorithms}, year = {1997}, volume = {23}, number = {1}, pages = {74--100} } |
|||||

Czumaj, A., Gasieniec, L., Piotrow, M. & Rytter, W. | Parallel and sequentiel approximation of shortest superstrings [BibTeX] |
1994 | Proceedings of the 4th Scandinavian Workshop on Algorithm Theory | inproceedings | |

BibTeX:
@inproceedings{Czumaj1994, author = {A. Czumaj and L. G{\c a}sieniec and M. Piotrow and W. Rytter}, title = {Parallel and sequentiel approximation of shortest superstrings}, booktitle = {Proceedings of the 4th Scandinavian Workshop on Algorithm Theory}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {824}, pages = {95--106} } |
|||||

Césari, Y. & Vincent, M. | Une caractérisation des mots périodiques [BibTeX] |
1978 | Comptes Rendus Acad. Sci. Paris Sér. I Math. | article | |

BibTeX:
@article{C'esari1978, author = {Y. C{\'e}sari and M. Vincent}, title = {Une caract{\'e}risation des mots p{\'e}riodiques}, journal = {Comptes Rendus Acad. Sci. Paris S{\'e}r. I Math.}, year = {1978}, pages = {1175--1177} } |
|||||

D'Auriol, B. J. & Bhavsar, V. C. | Evaluation of the Multi-Transputer Applications of the Weighted Levenshtein Distance Computation [BibTeX] |
1992 | Proceedings of the Int. Conf. Parall. Comp. Transput. Appl. | inproceedings | |

BibTeX:
@inproceedings{D'Auriol1992, author = {D'Auriol, B. J. and V. C. Bhavsar}, title = {Evaluation of the Multi-Transputer Applications of the Weighted {Levenshtein} Distance Computation}, booktitle = {Proceedings of the Int. Conf. Parall. Comp. Transput. Appl.}, year = {1992} } |
|||||

Daaboul, A. | Local prediction for lossless image compression [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@inproceedings{Daaboul1998, author = {A. Daaboul}, title = {Local prediction for lossless image compression}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'98}, year = {1998}, pages = {44--50}, note = {Collaborative Report DC--98--06} } |
|||||

Dahanayake, B. | Generalized Repetitions: A New Approach [BibTeX] |
1998 | School: Department of Computer Science and Systems, McMaster University, Canada |
mastersthesis | |

BibTeX:
@mastersthesis{Dahanayake1998, author = {B. Dahanayake}, title = {Generalized Repetitions: A New Approach}, school = {Department of Computer Science and Systems, McMaster University, Canada}, year = {1998} } |
|||||

Damerau, F. | A technique for computer detection and correction of spelling errors [BibTeX] |
1994 | Commun. ACM | article | |

BibTeX:
@article{Damerau1994, author = {F. Damerau}, title = {A technique for computer detection and correction of spelling errors}, journal = {Commun. ACM}, year = {1994}, volume = {7}, number = {3}, pages = {171--176} } |
|||||

Danvy, O. | Semantics-directed compilation of nonlinear patterns [BibTeX] |
1991 | Inf. Process. Lett. | article | |

BibTeX:
@article{Danvy1991, author = {O. Danvy}, title = {Semantics-directed compilation of nonlinear patterns}, journal = {Inf. Process. Lett.}, year = {1991}, volume = {37}, number = {6}, pages = {315--322} } |
|||||

Danv cik, V. | Common subsequences and supersequences and their expected length [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Danv1995, author = {V. Dan{\v c}{\'\i}k}, title = {Common subsequences and supersequences and their expected length}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {55--63} } |
|||||

Danv cik, V. | Expected length of longest common subsequences [BibTeX] |
1994 | School: Computer Science Departement, University of Warwick, UK |
phdthesis | |

BibTeX:
@phdthesis{Danv1994, author = {V. Dan{\v c}{\'\i}k}, title = {Expected length of longest common subsequences}, school = {Computer Science Departement, University of Warwick, UK}, year = {1994} } |
|||||

Danv cik, V. & Paterson, M. | Upper bounds for the expected length of a longest common subsequence of two binary sequences [BibTeX] |
1994 | Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Danv1994a, author = {V. Dan{\v c}{\'\i}k and M. Paterson}, title = {Upper bounds for the expected length of a longest common subsequence of two binary sequences}, booktitle = {Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {775}, pages = {669--678} } |
|||||

Darabont, T. | Approximate string matching with k mismatches [BibTeX] |
1992 | School: Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic |
mastersthesis | |

BibTeX:
@mastersthesis{Darabont1992, author = {T. Darabont}, title = {Approximate string matching with \emph{k} mismatches}, school = {Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic}, year = {1992} } |
|||||

Das, G., Fleischer, R., Gasieniec, L., Gunopulos, D. & Kärkkäinen, J. | Episode matching [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Das1997, author = {G. Das and R. Fleischer and L. G{\c a}sieniec and D. Gunopulos and J. K{\"a}rkk{\"a}inen}, title = {Episode matching}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {12--27} } |
|||||

Davidson, L. | Retrieval of misspelled names in an airlines passengerrecord system [BibTeX] |
1962 | Commun. ACM | article | |

BibTeX:
@article{Davidson1962, author = {L. Davidson}, title = {Retrieval of misspelled names in an airlines passengerrecord system}, journal = {Commun. ACM}, year = {1962}, volume = {5}, number = {3}, pages = {169--171} } |
|||||

Davies, D. | String Searching in Text Editors [BibTeX] |
1982 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Davies1982, author = {D.J.M. Davies}, title = {String Searching in Text Editors}, journal = {Softw. Pract. Exp.}, year = {1982}, volume = {12}, number = {8}, pages = {709--717} } |
|||||

Davies, G. & Bowsher, S. | Algorithms for pattern matching [BibTeX] |
1986 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Davies1986, author = {G. Davies and S. Bowsher}, title = {Algorithms for pattern matching}, journal = {Softw. Pract. Exp.}, year = {1986}, volume = {16}, number = {6}, pages = {575--601} } |
|||||

Daykin, J. W., Iliopoulos, C. S. & Smyth, W. F. | Parallel RAM algorithms for factorizing words [BibTeX] |
1994 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Daykin1994, author = {J. W. Daykin and C. S. Iliopoulos and W. F. Smyth}, title = {Parallel {RAM} algorithms for factorizing words}, journal = {Theor. Comput. Sci.}, year = {1994}, volume = {127}, number = {1}, pages = {53--67} } |
|||||

De Iaco, B. & Luccio, F. | Finding all the palindromes in a binary tree in linear time and space [BibTeX] |
1992 | Inf. Process. Lett. | article | |

BibTeX:
@article{De1992, author = {De Iaco, B. and F. Luccio}, title = {Finding all the palindromes in a binary tree in linear time and space}, journal = {Inf. Process. Lett.}, year = {1992}, volume = {44}, number = {2}, pages = {73--77} } |
|||||

De Iaco, B. & Luccio, F. | Finding all the palindromes of a string in linear time and space [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{De1991, author = {De Iaco, B. and F. Luccio}, title = {Finding all the palindromes of a string in linear time and space}, year = {1991}, number = {TR 3/91} } |
|||||

Deininger, P. L., Jolly, D. J., Rubin, C. M., Friedmann, T. & Schmid, C. W. | Base sequence studies of 300 nucleotide renatured repeated human DNA clones [BibTeX] |
1981 | J. Mol. Biol. | article | |

BibTeX:
@article{Deininger1981, author = {P. L. Deininger and D. J. Jolly and C. M. Rubin and T. Friedmann and C. W. Schmid}, title = {Base sequence studies of 300 nucleotide renatured repeated human {DNA} clones}, journal = {J. Mol. Biol.}, year = {1981}, volume = {151}, pages = {17--33} } |
|||||

Deken, J. | Some limit results for longest common subsequences [BibTeX] |
1975 | J. Appl. Probab | article | |

BibTeX:
@article{Deken1975, author = {J. Deken}, title = {Some limit results for longest common subsequences}, journal = {J. Appl. Probab}, year = {1975}, volume = {12}, pages = {306--315} } |
|||||

Denise, A. | Génération aléatoire et uniforme de mots [BibTeX] |
1993 | Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics | inproceedings | |

BibTeX:
@inproceedings{Denise1993, author = {A. Denise}, title = {G{\'e}n{\'e}ration al{\'e}atoire et uniforme de mots}, booktitle = {Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics}, year = {1993}, pages = {153--164} } |
|||||

Dermouche, A. | A fast algorithm for string matching with mismatches [BibTeX] |
1995 | Inf. Process. Lett. | article | |

BibTeX:
@article{Dermouche1995, author = {A. Dermouche}, title = {A fast algorithm for string matching with mismatches}, journal = {Inf. Process. Lett.}, year = {1995}, volume = {55}, number = {2}, pages = {105--110} } |
|||||

Dermouche, A. | Algorithms for pattern matching with and without errors [BibTeX] |
1993 | techreport | ||

BibTeX:
@techreport{Dermouche1993, author = {A. Dermouche}, title = {Algorithms for pattern matching with and without errors}, year = {1993}, number = {IR-1993-1} } |
|||||

Deshpande, A. S., Richards, D. S. & Pearson, W. R. | A platform for biological sequence comparison on parallel computers [BibTeX] |
1991 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Deshpande1991, author = {A. S. Deshpande and D. S. Richards and W. R. Pearson}, title = {A platform for biological sequence comparison on parallel computers}, journal = {Comput. Appl. Biosci.}, year = {1991}, volume = {7}, number = {2}, pages = {237--247} } |
|||||

Devereux, J., Haeberli, P. & Smithies, D. | A comprehensive set of sequence analysis programs for the VAX [BibTeX] |
1984 | Nucleic Acids Res. | article | |

BibTeX:
@article{Devereux1984, author = {J. Devereux and P. Haeberli and D. Smithies}, title = {A comprehensive set of sequence analysis programs for the {VAX}}, journal = {Nucleic Acids Res.}, year = {1984}, volume = {12}, pages = {387--395} } |
|||||

Devroye, L., Szpankoswki, W. & Rais, B. | A note of the height of suffix trees [BibTeX] |
1992 | SIAM J. Comput. | article | |

BibTeX:
@article{Devroye1992, author = {L. Devroye and W. Szpankoswki and B. Rais}, title = {A note of the height of suffix trees}, journal = {SIAM J. Comput.}, year = {1992}, volume = {21}, number = {1}, pages = {48--53} } |
|||||

Dewey, T. G. | A sequence alignment algorithm with an arbitrary gap penalty function [BibTeX] |
2001 | J. Comput. Bio. | article | |

BibTeX:
@article{Dewey2001, author = {T. G. Dewey}, title = {A sequence alignment algorithm with an arbitrary gap penalty function}, journal = {J. Comput. Bio.}, year = {2001}, volume = {8}, number = {2}, pages = {177--190} } |
|||||

Diaz, G. H., de Souza, S. M. & Crochemore, M. | Passage à l'échelle : complexité, algorithmique et architectures [BibTeX] |
2006 | Traitement automatique des langues | article | |

BibTeX:
@article{Diaz2006, author = {Gael Harry Diaz and Simao Melo de Souza and Maxime Crochemore}, title = {{P}assage \à l'échelle : complexité, algorithmique et architectures}, journal = {{T}raitement automatique des langues}, year = {2006}, volume = {46}, number = {2}, pages = {7–12} } |
|||||

Dogaru, O. C. | On the all occurrences of a word in a text [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@inproceedings{Dogaru1998, author = {O. C. Dogaru}, title = {On the all occurrences of a word in a text}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'98}, year = {1998}, pages = {51--57}, note = {Collaborative Report DC--98--06} } |
|||||

Dogaru, O. C. | On the first occurrence of a pattern in a text [BibTeX] |
1998 | Proceedings of the 32nd International Conference on Modelling and Simulation of Systems | inproceedings | |

BibTeX:
@inproceedings{Dogaru1998a, author = {O. C. Dogaru}, title = {On the first occurrence of a pattern in a text}, booktitle = {Proceedings of the 32nd International Conference on Modelling and Simulation of Systems}, year = {1998}, volume = {2}, pages = {45--50} } |
|||||

Dogaru, O. C. | Algorithm of straight string search [BibTeX] |
1993 | Proceedings of the 9th Romanian Symposium on Computer Science | inproceedings | |

BibTeX:
@inproceedings{Dogaru1993, author = {O. C. Dogaru}, title = {Algorithm of straight string search}, booktitle = {Proceedings of the 9th Romanian Symposium on Computer Science}, year = {1993}, pages = {172--177} } |
|||||

Doubray, X. | Palindromes in the Fibonacci word [BibTeX] |
1995 | Inf. Process. Lett. | article | |

BibTeX:
@article{Doubray1995, author = {X. Doubray}, title = {Palindromes in the {Fibonacci} word}, journal = {Inf. Process. Lett.}, year = {1995}, volume = {55}, number = {4}, pages = {217--221} } |
|||||

Doubray, X. | Palindromes in the Fibonacci word [BibTeX] |
1994 | techreport | ||

BibTeX:
@techreport{Doubray1994, author = {X. Doubray}, title = {Palindromes in the {Fibonacci} word}, year = {1994}, number = {LAMIFA 94-11} } |
|||||

Downey, P. J., Sethi, R. & Tarjan, R. E. | Variations on the common subexpression problem [BibTeX] |
1980 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Downey1980, author = {P. J. Downey and R. Sethi and R. E. Tarjan}, title = {Variations on the common subexpression problem}, journal = {J. Assoc. Comput. Mach.}, year = {1980}, volume = {27}, number = {4}, pages = {758--771} } |
|||||

Du, M. W. & Chang, S. C. | An Approach to Designing Very Fast Approximate String Matching Algorithms [BibTeX] |
1994 | IEEE Trans. Knowl. Data Eng. | article | |

BibTeX:
@article{Du1994, author = {M. W. Du and S. C. Chang}, title = {An Approach to Designing Very Fast Approximate String Matching Algorithms}, journal = {IEEE Trans. Knowl. Data Eng.}, year = {1994}, volume = {6}, number = {4}, pages = {620--633} } |
|||||

Dubiner, M., Galil, Z. & Magen, E. | Faster tree pattern matching [BibTeX] |
1994 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Dubiner1994, author = {M. Dubiner and Z. Galil and E. Magen}, title = {Faster tree pattern matching}, journal = {J. Assoc. Comput. Mach.}, year = {1994}, volume = {41}, number = {2}, pages = {205--213} } |
|||||

Dubiner, M., Galil, Z. & Magen, E. | Faster tree pattern matching [BibTeX] |
1990 | Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Dubiner1990, author = {M. Dubiner and Z. Galil and E. Magen}, title = {Faster tree pattern matching}, booktitle = {Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1990}, pages = {145--150} } |
|||||

Duboc, C. | On some equations in free partially commutative monoids [BibTeX] |
1986 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Duboc1986, author = {C. Duboc}, title = {On some equations in free partially commutative monoids}, journal = {Theor. Comput. Sci.}, year = {1986}, volume = {46}, number = {2--3}, pages = {159--174} } |
|||||

Dulucq, S. & Gouyou-Beauchamps, D. | Sur les facteurs des suites de Sturm [BibTeX] |
1990 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Dulucq1990, author = {S. Dulucq and D. Gouyou-Beauchamps}, title = {Sur les facteurs des suites de {Sturm}}, journal = {Theor. Comput. Sci.}, year = {1990}, volume = {71}, number = {3}, pages = {381--400} } |
|||||

Dundan III, J. | Implementing Dynamic Minimal-prefix Tries [BibTeX] |
1991 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Dundan1991, author = {J.A. {Dundan III}}, title = {Implementing Dynamic Minimal-prefix Tries}, journal = {Softw. Pract. Exp.}, year = {1991}, volume = {21}, number = {10}, pages = {1027--1040} } |
|||||

Durbin, R., Eddy, S., Krogh, A. & Mitchison, G. | Biological sequence analysis probabilistic models of proteins and nucleic acids [BibTeX] |
1998 | book | ||

BibTeX:
@book{Durbin1998, author = {R. Durbin and S. Eddy and A. Krogh and G. Mitchison}, title = {Biological sequence analysis probabilistic models of proteins and nucleic acids}, publisher = {Cambridge University Press}, year = {1998} } |
|||||

Duval, A. M. & Smyth, W. F. | Covering a circular string with substrings of fixed length [BibTeX] |
1996 | J. Foudations Comp. Sc.. | article | |

BibTeX:
@article{Duval1996, author = {A. M. Duval and W. F. Smyth}, title = {Covering a circular string with substrings of fixed length}, journal = {J. Foudations Comp. Sc..}, year = {1996}, volume = {7}, number = {1}, pages = {87--93} } |
|||||

Duval, J. | Périodes locales et propagation de périodes dans un mot [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Duval1998, author = {J.-P. Duval}, title = {P\'eriodes locales et propagation de p\'eriodes dans un mot}, journal = {Theor. Comput. Sci.}, year = {1998}, volume = {204}, number = {1--2}, pages = {87--98} } |
|||||

Duval, J. | Périodes locales et propagation de périodes dans un mot [BibTeX] |
1997 | techreport | ||

BibTeX:
@techreport{Duval1997, author = {J.-P. Duval}, title = {P\'eriodes locales et propagation de p\'eriodes dans un mot}, year = {1997}, number = {LIR 97.05} } |
|||||

Duval, J. | Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée [BibTeX] |
1988 | techreport | ||

BibTeX:
@techreport{Duval1988, author = {J.-P. Duval}, title = {G{\'e}n{\'e}ration d'une section des classes de conjugaison et arbre des mots de {Lyndon} de longueur born{\'e}e}, year = {1988}, number = {LITP 88.20} } |
|||||

Duval, J. | Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée [BibTeX] |
1988 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Duval1988a, author = {J.-P. Duval}, title = {G{\'e}n{\'e}ration d'une section des classes de conjugaison et arbre des mots de {Lyndon} de longueur born{\'e}e}, journal = {Theor. Comput. Sci.}, year = {1988}, volume = {60}, number = {3}, pages = {255--283} } |
|||||

Duval, J. | Factorizing words over an ordered alphabet [BibTeX] |
1983 | J. Algorithms | article | |

BibTeX:
@article{Duval1983, author = {J.-P. Duval}, title = {Factorizing words over an ordered alphabet}, journal = {J. Algorithms}, year = {1983}, volume = {4}, number = {4}, pages = {363--381} } |
|||||

Duval, J. | Relationship between the period of a finite word and the length of its unbordered segments [BibTeX] |
1982 | Discret. Math. | article | |

BibTeX:
@article{Duval1982, author = {J.-P. Duval}, title = {Relationship between the period of a finite word and the length of its unbordered segments}, journal = {Discret. Math.}, year = {1982}, volume = {40}, pages = {31--44} } |
|||||

Duval, J. | A remark on the Knuth-Morris-Pratt's string searching algorithm [BibTeX] |
1981 | techreport | ||

BibTeX:
@techreport{Duval1981, author = {J.-P. Duval}, title = {A remark on the {Knuth-Morris-Pratt}'s string searching algorithm}, year = {1981}, number = {LITP 81-7} } |
|||||

Duval, J. | Relationship between the period of a finite word and the length of its unbordered segments [BibTeX] |
1981 | techreport | ||

BibTeX:
@techreport{Duval1981a, author = {J.-P. Duval}, title = {Relationship between the period of a finite word and the length of its unbordered segments}, year = {1981}, number = {LITP 81-22} } |
|||||

Duval, J. | Lexicographically maximal and minimal segments of a word, linear string searching algorithms [BibTeX] |
1981 | techreport | ||

BibTeX:
@techreport{Duval1981b, author = {J.-P. Duval}, title = {Lexicographically maximal and minimal segments of a word, linear string searching algorithms}, year = {1981}, number = {LITP 81-23} } |
|||||

Duval, J. | Contribution à la combinatoire du monoide libre [BibTeX] |
1980 | School: Université de Rouen |
phdthesis | |

BibTeX:
@phdthesis{Duval1980, author = {J.-P. Duval}, title = {Contribution {\`a} la combinatoire du mono{\"\i}de libre}, school = {Universit{\'e} de Rouen}, year = {1980} } |
|||||

Duval, J. | Mots de Lyndon et périodicité [BibTeX] |
1980 | RAIRO Inform. Théor. | article | |

BibTeX:
@article{Duval1980a, author = {J.-P. Duval}, title = {Mots de {Lyndon} et p{\'e}riodicit{\'e}}, journal = {RAIRO Inform. Th{\'e}or.}, year = {1980}, volume = {14}, number = {2}, pages = {181--191} } |
|||||

Duval, J. | Périodes et répétitions des mots du monoide libre [BibTeX] |
1979 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Duval1979, author = {J.-P. Duval}, title = {P{\'e}riodes et r{\'e}p{\'e}titions des mots du mono{\"\i}de libre}, journal = {Theor. Comput. Sci.}, year = {1979}, volume = {9}, number = {1}, pages = {17--26} } |
|||||

Duval, J., Kolpakov, R., Kucherov, G., Lecroq, T. & Lefebvre, A. | Linear-Time Computation of Local Periods [BibTeX] |
2003 | Proceedings of the 28th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Duval2003, author = {J.-P. Duval and R. Kolpakov and G. Kucherov and T. Lecroq and A. Lefebvre}, title = {Linear-Time Computation of Local Periods}, booktitle = {Proceedings of the 28th Symposium on Mathematical Foundations of Computer Science}, year = {2003}, note = {Accepted} } |
|||||

Duval, J., Lecroq, T. & Lefebvre, A. | Border Array on Bounded Alphabet [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference'02 | inproceedings | |

BibTeX:
@inproceedings{Duval2002, author = {J.-P. Duval and T. Lecroq and A. Lefebvre}, title = {Border Array on Bounded Alphabet}, booktitle = {Proceedings of the Prague Stringology Conference'02}, year = {2002}, pages = {28--35}, note = {Research Report DC--2002--03} } |
|||||

Duval, J. & Lefebvre, A. | Words over an ordered alphabet and suffix permutations [BibTeX] |
2002 | RAIRO Inform. Théor. Appl. | article | |

BibTeX:
@article{Duval2002a, author = {J.-P. Duval and A. Lefebvre}, title = {Words over an ordered alphabet and suffix permutations}, journal = {RAIRO Inform. Th{\'e}or. Appl.}, year = {2002}, volume = {36}, pages = {249--259} } |
|||||

Duval, J., Mignosi, F. & Restivo, A. | Recurrence and periodicity in infinite words from local periods [BibTeX] |
2001 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Duval2001, author = {J.-P. Duval and F. Mignosi and A. Restivo}, title = {Recurrence and periodicity in infinite words from local periods}, journal = {Theor. Comput. Sci.}, year = {2001}, volume = {262}, number = {1--2}, pages = {269--?} } |
|||||

Duval, J. & Mouchard, L. | Sequences obtained from a series of permutations of borders and ultimately periodic words [BibTeX] |
1999 | J. Autom. Lang. Comb. | article | |

BibTeX:
@article{Duval1999, author = {J.-P. Duval and L. Mouchard}, title = {Sequences obtained from a series of permutations of borders and ultimately periodic words}, journal = {J. Autom. Lang. Comb.}, year = {1999}, volume = {4}, number = {3}, pages = {205--211} } |
|||||

Dvorský, J. & Snáv sel, V. | Word-based compression method with direct access [BibTeX] |
2000 | Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia | inproceedings | |

BibTeX:
@inproceedings{Dvorsk'y2000, author = {J. Dvorsk{\'y} and V. Sn{\'a}{\v s}el}, title = {Word-based compression method with direct access}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia}, year = {2000}, pages = {24--31}, note = {Collaborative Report DC--2000--03} } |
|||||

Dömösi, P., Horváth, S. & Ito, M. | Formal languages and primitive words [BibTeX] |
1993 | Publ. Math. Debr. | article | |

BibTeX:
@article{Domosi1993, author = {P. D{\"o}m{\"o}si and S. Horv{\'a}th and M. Ito}, title = {Formal languages and primitive words}, journal = {Publ. Math. Debr.}, year = {1993}, volume = {42}, number = {3-4}, pages = {315--321} } |
|||||

Dömösi, P., Horváth, S., Ito, M., Kászonyi, L. & Katsura, M. | Formal languages consisting of primitive words [BibTeX] |
1993 | Proceedings Fundamental of Computation Theory | inproceedings | |

BibTeX:
@inproceedings{Domosi1993a, author = {P. D{\"o}m{\"o}si and S. Horv{\'a}th and M. Ito and L. K{\'a}szonyi and M. Katsura}, title = {Formal languages consisting of primitive words}, booktitle = {Proceedings Fundamental of Computation Theory}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {710}, pages = {194--203} } |
|||||

Earley, J. | A efficient context-free parsing algorithm [BibTeX] |
1970 | Commun. ACM | article | |

BibTeX:
@article{Earley1970, author = {J. Earley}, title = {A efficient context-free parsing algorithm}, journal = {Commun. ACM}, year = {1970}, volume = {13}, number = {2}, pages = {94--102} } |
|||||

Edelkamp, S. | Dictionary Automaton in Optimal Space [BibTeX] |
1999 | techreport | ||

BibTeX:
@techreport{Edelkamp1999, author = {S. Edelkamp}, title = {Dictionary Automaton in Optimal Space}, year = {1999} } |
|||||

Edmiston, E. W., Core, N. G., Saltz, J. H. & Smith, R. M. | Parallel processing of biological sequence comparison algorithms [BibTeX] |
1988 | Int. J. Parallel Program. | article | |

BibTeX:
@article{Edmiston1988, author = {E. W. Edmiston and N. G. Core and J. H. Saltz and R. M. Smith}, title = {Parallel processing of biological sequence comparison algorithms}, journal = {Int. J. Parallel Program.}, year = {1988}, volume = {17}, number = {3}, pages = {259--275} } |
|||||

Edmiston, E. W. & Wagner, R. A. | Parallelization of the dynamic programming algorithm for comparison of sequences [BibTeX] |
1987 | Proceedings of the 1987 International Conference on Parallel Processing | inproceedings | |

BibTeX:
@inproceedings{Edmiston1987, author = {E. W. Edmiston and R. A. Wagner}, title = {Parallelization of the dynamic programming algorithm for comparison of sequences}, booktitle = {Proceedings of the 1987 International Conference on Parallel Processing}, year = {1987}, pages = {79--80} } |
|||||

Eggen, R. E. & Kurak, C. | Pattern matching in fewer comparisons [BibTeX] |
1992 | Proceedings IEEE SOUTHEASTCON | inproceedings | |

BibTeX:
@inproceedings{Eggen1992, author = {R. E. Eggen and C. Kurak}, title = {Pattern matching in fewer comparisons}, booktitle = {Proceedings IEEE SOUTHEASTCON}, year = {1992}, pages = {410--412} } |
|||||

Ehrenfeucht, A. & Haussler, D. | A new distance metric on strings computable in linear time [BibTeX] |
1988 | Discret. Appl. Math. | article | |

BibTeX:
@article{Ehrenfeucht1988, author = {A. Ehrenfeucht and D. Haussler}, title = {A new distance metric on strings computable in linear time}, journal = {Discret. Appl. Math.}, year = {1988}, volume = {20}, pages = {191--203} } |
|||||

Eilam-Tzoreff, T. & Vishkin, U. | Matching patterns in a string subject to multi-linear transformations [BibTeX] |
1988 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Eilam-Tzoreff1988, author = {T. Eilam-Tzoreff and U. Vishkin}, title = {Matching patterns in a string subject to multi-linear transformations}, journal = {Theor. Comput. Sci.}, year = {1988}, volume = {60}, number = {3}, pages = {231--254} } |
|||||

Eisler, M. J. | A Research Report on the Design of an Approximate String Matching Device using the LCS Device Approach [BibTeX] |
1985 | School: Univ. Central Florida |
mastersthesis | |

BibTeX:
@mastersthesis{Eisler1985, author = {M. J. Eisler}, title = {{A Research Report on the Design of an Approximate String Matching Device using the LCS Device Approach}}, school = {Univ. Central Florida}, year = {1985} } |
|||||

El-Mabrouk, N. | Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{El-Mabrouk2000, author = {N. El-Mabrouk}, title = {Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848} } |
|||||

El-Mabrouk, N. | Sorting Signed Permutations by Reversals and Insertions/Deletions of Contiguous Segments [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@article{El-Mabrouk2000a, author = {N. El-Mabrouk}, title = {Sorting Signed Permutations by Reversals and Insertions/Deletions of Contiguous Segments}, journal = {J. Discret. Algorithms}, year = {2000}, volume = {1}, number = {1}, pages = {105--121} } |
|||||

El-Mabrouk, N. & Crochemore, M. | Boyer-Moore Strategy to Efficient Approximate String Matching [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{El-Mabrouk1996, author = {N. El-Mabrouk and M. Crochemore}, title = {{Boyer-Moore} Strategy to Efficient Approximate String Matching}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {24--38} } |
|||||

El-Mabrouk, N., Nadeau, J. & Sankoff, D. | Genome Halving [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{El-Mabrouk1998, author = {N. El-Mabrouk and J. Nadeau and D. Sankoff}, title = {Genome Halving}, booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1448}, pages = {235--250} } |
|||||

El-Mabrouk, N. & Sankoff, D. | Hybridization and genome rearrangement [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{El-Mabrouk1999, author = {N. El-Mabrouk and D. Sankoff}, title = {Hybridization and genome rearrangement}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {78--87} } |
|||||

Ellis, J., Ruskey, F. & Sawada, J. | Euclidean strings [BibTeX] |
2000 | Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Ellis2000, author = {J. Ellis and F. Ruskey and J. Sawada}, title = {Euclidean strings}, booktitle = {Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms}, year = {2000}, pages = {87--92} } |
|||||

Eppstein, D. | Sequence comparison with mixed convex and concave costs [BibTeX] |
1990 | J. Algorithms | article | |

BibTeX:
@article{Eppstein1990, author = {D. Eppstein}, title = {Sequence comparison with mixed convex and concave costs}, journal = {J. Algorithms}, year = {1990}, volume = {11}, number = {1}, pages = {85--101} } |
|||||

Eppstein, D. | Efficient Algorithms for Sequence Analysis with Concave and Convexe Gap Costs [BibTeX] |
1989 | School: Computer Science Department, Columbia University, New York |
phdthesis | |

BibTeX:
@phdthesis{Eppstein1989, author = {D. Eppstein}, title = {{Efficient Algorithms for Sequence Analysis with Concave and Convexe Gap Costs}}, school = {Computer Science Department, Columbia University, New York}, year = {1989} } |
|||||

Eppstein, D., Galil, Z. & Giancarlo, R. | Speeding up dynamic programming [BibTeX] |
1988 | Proceedings of the 29th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Eppstein1988, author = {D. Eppstein and Z. Galil and R. Giancarlo}, title = {Speeding up dynamic programming}, booktitle = {Proceedings of the 29th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1988}, pages = {488--496} } |
|||||

Eppstein, D., Galil, Z., Giancarlo, R. & Italiano, G. | Sparse dynamic programming [BibTeX] |
1990 | Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Eppstein1990a, author = {D. Eppstein and Z. Galil and R. Giancarlo and G.F. Italiano}, title = {Sparse dynamic programming}, booktitle = {Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1990}, pages = {513--522} } |
|||||

Eppstein, D., Galil, Z., Giancarlo, R. & Italiano, G. F. | Sparse dynamic programming I: linear cost functions [BibTeX] |
1992 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Eppstein1992, author = {D. Eppstein and Z. Galil and R. Giancarlo and G. F. Italiano}, title = {Sparse dynamic programming I: linear cost functions}, journal = {J. Assoc. Comput. Mach.}, year = {1992}, volume = {39}, number = {3}, pages = {519--545} } |
|||||

Eppstein, D., Galil, Z., Giancarlo, R. & Italiano, G. F. | Sparse dynamic programming II: convex and concave cost functions [BibTeX] |
1992 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Eppstein1992a, author = {D. Eppstein and Z. Galil and R. Giancarlo and G. F. Italiano}, title = {Sparse dynamic programming II: convex and concave cost functions}, journal = {J. Assoc. Comput. Mach.}, year = {1992}, volume = {39}, number = {3}, pages = {546--567} } |
|||||

Erickson, B. W. & Sellers, P. H. | Recognition of patterns in genetic sequences [BibTeX] |
1983 | Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison | inbook | |

BibTeX:
@inbook{Erickson1983, author = {B. W. Erickson and P. H. Sellers}, title = {Recognition of patterns in genetic sequences}, booktitle = {Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison}, publisher = {Addison-Wesley}, year = {1983}, pages = {55--91} } |
|||||

Etzold, T. & Argos, P. | SRS -- an indexing and retrieval tool for flat file data libraries [BibTeX] |
1993 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Etzold1993, author = {T. Etzold and P. Argos}, title = {{SRS} -- an indexing and retrieval tool for flat file data libraries}, journal = {Comput. Appl. Biosci.}, year = {1993}, volume = {9}, pages = {49--57} } |
|||||

Evans, D. J. & Ghanemi, S. | Parallel string matching algorithm [BibTeX] |
1988 | Kybern. | article | |

BibTeX:
@article{Evans1988, author = {D. J. Evans and S. Ghanemi}, title = {Parallel string matching algorithm}, journal = {Kybern.}, year = {1988}, volume = {17}, number = {3}, pages = {32--34} } |
|||||

Evans, P. | Finding Common Subsequences with Arcs and Pseudoknots [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Evans1999, author = {P. Evans}, title = {Finding Common Subsequences with Arcs and Pseudoknots}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {270--280} } |
|||||

Even, S. & Rodeh, M. | Economical encoding of commas between strings [BibTeX] |
1978 | Commun. ACM | article | |

BibTeX:
@article{Even1978, author = {S. Even and M. Rodeh}, title = {Economical encoding of commas between strings}, journal = {Commun. ACM}, year = {1978}, volume = {21}, number = {4}, pages = {315--317} } |
|||||

Eyono Obono, S. D., Goralcik, P. & Maksimenko, M. | Efficient solving of the word equations in one variable [BibTeX] |
1994 | Proceedings 19th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Eyono1994, author = {Eyono Obono, S. D. and P. Goralcik and M. Maksimenko}, title = {Efficient solving of the word equations in one variable}, booktitle = {Proceedings 19th Symposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {841}, pages = {336--341} } |
|||||

Faloutsos, C. | Acces methods for text [BibTeX] |
1985 | ACM Comp. Surv. | article | |

BibTeX:
@article{Faloutsos1985, author = {C. Faloutsos}, title = {Acces methods for text}, journal = {ACM Comp. Surv.}, year = {1985}, volume = {17}, number = {1}, pages = {49--74} } |
|||||

Fan, C., Shyr, H. J. & Yu, S. S. | d-Words and d-Languages [BibTeX] |
1998 | Acta Inform. | article | |

BibTeX:
@article{Fan1998, author = {C.-M. Fan and H. J. Shyr and S. S. Yu}, title = {d-Words and d-Languages}, journal = {Acta Inform.}, year = {1998}, volume = {35}, number = {8}, pages = {709--727} } |
|||||

Fan, J. J. & Su, K. Y. | An efficient algorithm for matching multiple patterns [BibTeX] |
1994 | Computer Algorithms: String Pattern Matching Strategies | incollection | |

BibTeX:
@incollection{Fan1994, author = {J. J. Fan and K. Y. Su}, title = {An efficient algorithm for matching multiple patterns}, booktitle = {Computer Algorithms: String Pattern Matching Strategies}, publisher = {IEEE Computer Society Press}, year = {1994}, pages = {91--103} } |
|||||

Fan, J. J. & Su, K. Y. | An efficient algorithm for matching multiple patterns [BibTeX] |
1993 | IEEE Trans. Knowl. Data Eng. | article | |

BibTeX:
@article{Fan1993, author = {J. J. Fan and K. Y. Su}, title = {An efficient algorithm for matching multiple patterns}, journal = {IEEE Trans. Knowl. Data Eng.}, year = {1993}, volume = {5}, number = {2}, pages = {339--351} } |
|||||

Fan, T. I. | Optimal matching of deformed patterns with positional influence [BibTeX] |
1987 | Inf. Sci. | article | |

BibTeX:
@article{Fan1987, author = {T. I. Fan}, title = {Optimal matching of deformed patterns with positional influence}, journal = {Inf. Sci.}, year = {1987}, volume = {41}, pages = {259--280} } |
|||||

Farach, M. | Optimal Suffix Tree Construction with Large Alphabets [BibTeX] |
1997 | Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Farach1997, author = {M. Farach}, title = {Optimal Suffix Tree Construction with Large Alphabets}, booktitle = {Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science}, year = {1997}, pages = {137--143} } |
|||||

Farach, M. | Optimal Suffix Tree Construction with Large Alphabets [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Farach1996, author = {M. Farach}, title = {Optimal Suffix Tree Construction with Large Alphabets}, year = {1996}, number = {96--48} } |
|||||

Farach, M., Kannan, S. & Warnow, T. | A Robust Model for Finding Optimal Evolutionary Trees [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@article{Farach1995, author = {M. Farach and S. Kannan and T. Warnow}, title = {A Robust Model for Finding Optimal Evolutionary Trees}, journal = {Algorithmica}, year = {1995}, volume = {13}, number = {1/2}, pages = {155--179} } |
|||||

Farach, M. & Muthukrishnan, S. | Optimal Logarithmic Time Randomized Suffix Tree Construction [BibTeX] |
1996 | Proceedings of the 23rd International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Farach1996a, author = {M. Farach and S. Muthukrishnan}, title = {Optimal Logarithmic Time Randomized Suffix Tree Construction}, booktitle = {Proceedings of the 23rd International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1996}, volume = {1099}, pages = {550--561} } |
|||||

Farach, M. & Muthukrishnan, S. | Perfect Hashing for Strings: Formalization and Algorithms [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Farach1996b, author = {M. Farach and S. Muthukrishnan}, title = {Perfect Hashing for Strings: Formalization and Algorithms}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {130--140} } |
|||||

Farach, M. & Thorup, M. | String Matching in Lempel-Ziv Compressed Strings [BibTeX] |
1998 | Algorithmica | article | |

BibTeX:
@article{Farach1998, author = {M. Farach and M. Thorup}, title = {String Matching in {Lempel-Ziv} Compressed Strings}, journal = {Algorithmica}, year = {1998}, volume = {20}, number = {4}, pages = {388--404} } |
|||||

Farach, M. & Thorup, M. | String Matching in Lempel-Ziv Compressed Strings [BibTeX] |
1995 | Proceedings of the 27th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Farach1995a, author = {M. Farach and M. Thorup}, title = {String Matching in {Lempel-Ziv} Compressed Strings}, booktitle = {Proceedings of the 27th ACM Symposium on the Theory of Computing}, year = {1995}, pages = {703--712} } |
|||||

Faulk, R. D. | An inductive approach to language translation [BibTeX] |
1964 | Commun. ACM | article | |

BibTeX:
@article{Faulk1964, author = {R. D. Faulk}, title = {An inductive approach to language translation}, journal = {Commun. ACM}, year = {1964}, volume = {7}, number = {11}, pages = {647--653} } |
|||||

Faulkner, D. V. & Jurka, J. | Multiple aligned sequence editor (MASE) [BibTeX] |
1988 | Trends Biochem. Sci. | article | |

BibTeX:
@article{Faulkner1988, author = {D. V. Faulkner and J. Jurka}, title = {Multiple aligned sequence editor ({MASE})}, journal = {Trends Biochem. Sci.}, year = {1988}, volume = {13}, pages = {321--322} } |
|||||

Fellows, M., Hallett, M. T., Korostensky, C. & Stege, U. | Analogs and Duals of the MAST Problem for Sequences and Trees [BibTeX] |
1998 | Proceedings of the 6th Annual European Symposium | inproceedings | |

BibTeX:
@inproceedings{Fellows1998, author = {M. Fellows and M. T. Hallett and C. Korostensky and U. Stege}, title = {Analogs and Duals of the {MAST} Problem for Sequences and Trees}, booktitle = {Proceedings of the 6th Annual European Symposium}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1461}, pages = {103--114} } |
|||||

Felsenstein, J., Sawyer, S. & Kochin, R. | An efficient method for matching nucleic acid sequences [BibTeX] |
1982 | Nucleic Acids Res. | article | |

BibTeX:
@article{Felsenstein1982, author = {J. Felsenstein and S. Sawyer and R. Kochin}, title = {An efficient method for matching nucleic acid sequences}, journal = {Nucleic Acids Res.}, year = {1982}, volume = {10}, pages = {133--139} } |
|||||

Feng, D. & Doolittle, R. F. | Progressive alignment and phylogenetic tree construction of protein sequences [BibTeX] |
1990 | Methods Enzymol. | article | |

BibTeX:
@article{Feng1990, author = {D.-F. Feng and R. F. Doolittle}, title = {Progressive alignment and phylogenetic tree construction of protein sequences}, journal = {Methods Enzymol.}, year = {1990}, volume = {188}, pages = {375--402} } |
|||||

Feng, D. & Doolittle, R. F. | Progressive sequence alignment as a prerequisite to correct phylogenetic trees [BibTeX] |
1987 | J. Mol. Evol. | article | |

BibTeX:
@article{Feng1987, author = {D.-F. Feng and R. F. Doolittle}, title = {Progressive sequence alignment as a prerequisite to correct phylogenetic trees}, journal = {J. Mol. Evol.}, year = {1987}, volume = {25}, pages = {351--360} } |
|||||

Feng, D., Johnson, M. S. & Doolittle, R. F. | Aligning amino acid sequences: Comparison of commonly used methods [BibTeX] |
1985 | J. Mol. Evol. | article | |

BibTeX:
@article{Feng1985, author = {D.-F. Feng and M. S. Johnson and R. F. Doolittle}, title = {Aligning amino acid sequences: Comparison of commonly used methods}, journal = {J. Mol. Evol.}, year = {1985}, volume = {21}, pages = {112--125} } |
|||||

Ferenczi, S. & Kása, Z. | Complexity for finite factors of infinite sequences [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Ferenczi1999, author = {S. Ferenczi and Z. K{\'a}sa}, title = {Complexity for finite factors of infinite sequences}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {218}, number = {1}, pages = {177--195} } |
|||||

Fernández-Baca, D., Seppäläinen, T. & Slutzki, G. | Parametric Multiple Sequence Alignment and Phylogeny Construction [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fern'andez-Baca2000, author = {D. Fern{\'a}ndez-Baca and T. Sepp{\"a}l{\"a}inen and G. Slutzki}, title = {Parametric Multiple Sequence Alignment and Phylogeny Construction}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {69--83} } |
|||||

Ferragina, P. | Dynamic Text Indexing under String Updates [BibTeX] |
1997 | J. Algorithms | article | |

BibTeX:
@article{Ferragina1997, author = {P. Ferragina}, title = {Dynamic Text Indexing under String Updates}, journal = {J. Algorithms}, year = {1997}, volume = {22}, number = {2}, pages = {296--328} } |
|||||

Ferragina, P. | Dynamic data structures for string matching problems [BibTeX] |
1997 | School: Computer Science Dept., Università di Pisa |
phdthesis | |

BibTeX:
@phdthesis{Ferragina1997a, author = {P. Ferragina}, title = {Dynamic data structures for string matching problems}, school = {Computer Science Dept., Universit\`a di Pisa}, year = {1997} } |
|||||

Ferragina, P. | Incremental Text Editing: A New Data Structure [BibTeX] |
1994 | Proceedings of the 2nd Annual European Symposium | inproceedings | |

BibTeX:
@inproceedings{Ferragina1994, author = {P. Ferragina}, title = {Incremental Text Editing: A New Data Structure}, booktitle = {Proceedings of the 2nd Annual European Symposium}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {855}, pages = {495--507} } |
|||||

Ferragina, P. & Grossi, R. | Improved dynamic text indexing [BibTeX] |
1999 | J. Algorithms | article | |

BibTeX:
@article{Ferragina1999, author = {P. Ferragina and R. Grossi}, title = {Improved dynamic text indexing}, journal = {J. Algorithms}, year = {1999}, volume = {31}, number = {2}, pages = {291--319} } |
|||||

Ferragina, P. & Grossi, R. | The String B-tree: A New Data Structure for String Search in External Memory and Its Applications [BibTeX] |
1999 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Ferragina1999a, author = {P. Ferragina and R. Grossi}, title = {The String {B}-tree: {A} New Data Structure for String Search in External Memory and Its Applications}, journal = {J. Assoc. Comput. Mach.}, year = {1999}, volume = {46}, pages = {236--280} } |
|||||

Ferragina, P. & Grossi, R. | Optimal On-Line Search and Sublinear Time Update in String Matching [BibTeX] |
1998 | SIAM J. Comput. | article | |

BibTeX:
@article{Ferragina1998, author = {P. Ferragina and R. Grossi}, title = {Optimal On-Line Search and Sublinear Time Update in String Matching}, journal = {SIAM J. Comput.}, year = {1998}, volume = {27}, number = {3}, pages = {713--736} } |
|||||

Ferragina, P. & Grossi, R. | Fast String Searching in Secondary Storage: Theoretical developments And Experimental Results [BibTeX] |
1996 | Proceedings of the 7th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Ferragina1996, author = {P. Ferragina and R. Grossi}, title = {Fast String Searching in Secondary Storage: Theoretical developments And Experimental Results}, booktitle = {Proceedings of the 7th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1996}, pages = {373--382} } |
|||||

Ferragina, P. & Grossi, R. | A fully-dynamic data structure for external substring search [BibTeX] |
1995 | Proceedings of the 27th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Ferragina1995, author = {P. Ferragina and R. Grossi}, title = {A fully-dynamic data structure for external substring search}, booktitle = {Proceedings of the 27th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1995} } |
|||||

Ferragina, P. & Grossi, R. | Optimal On-Line Search and Sublinear Time Update in String Matching [BibTeX] |
1995 | Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Ferragina1995a, author = {P. Ferragina and R. Grossi}, title = {Optimal On-Line Search and Sublinear Time Update in String Matching}, booktitle = {Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1995}, pages = {604--612} } |
|||||

Ferragina, P. & Grossi, R. | Fast Incremental Text Editing [BibTeX] |
1995 | Proceedings of the 6th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Ferragina1995b, author = {P. Ferragina and R. Grossi}, title = {Fast Incremental Text Editing}, booktitle = {Proceedings of the 6th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1995}, pages = {531--540} } |
|||||

Ferragina, P., Grossi, R. & Montangero, M. | A Note on Updating Suffix Tree Labels [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Ferragina1998a, author = {P. Ferragina and R. Grossi and M. Montangero}, title = {A Note on Updating Suffix Tree Labels}, journal = {Theor. Comput. Sci.}, year = {1998}, volume = {201}, number = {1/2}, pages = {249--262} } |
|||||

Ferragina, P., Grossi, R. & Montangero, M. | A Note on Updating Suffix Tree Labels [BibTeX] |
1997 | CIAC: Italian Conference on Algorithms and Complexity | inproceedings | |

BibTeX:
@inproceedings{Ferragina1997b, author = {P. Ferragina and R. Grossi and M. Montangero}, title = {A Note on Updating Suffix Tree Labels}, booktitle = {CIAC: Italian Conference on Algorithms and Complexity}, year = {1997} } |
|||||

Ferragina, P. & Luccio, F. | String Search in Coarse-Grained Parallel Computers [BibTeX] |
1999 | Algorithmica | article | |

BibTeX:
@article{Ferragina1999b, author = {P. Ferragina and F. Luccio}, title = {String Search in Coarse-Grained Parallel Computers}, journal = {Algorithmica}, year = {1999}, volume = {24}, number = {3/4}, pages = {177--194} } |
|||||

Ferragina, P. & Luccio, F. | Dynamic Dictionary Matching in External Memory [BibTeX] |
1998 | Inf. Comput. | article | |

BibTeX:
@article{Ferragina1998b, author = {P. Ferragina and F. Luccio}, title = {Dynamic Dictionary Matching in External Memory}, journal = {Inf. Comput.}, year = {1998}, volume = {146}, number = {2}, pages = {85--99} } |
|||||

Ferragina, P., Manzini, G., Mäkinen, V. & Navarro, G. | Compressed Representations of Sequences and Full-Text Indexes [BibTeX] |
2006 | ACM Transactions on Algorithms (TALG) | article | |

BibTeX:
@article{Ferragina2006, author = {P. Ferragina and G. Manzini and V. M{\"a}kinen and G. Navarro}, title = {Compressed Representations of Sequences and Full-Text Indexes}, journal = {ACM Transactions on Algorithms (TALG)}, year = {2006}, note = {To appear} } |
|||||

Ferragina, P., Muthukrishnan, S. & de Berg M. | Multi-method Dispatching: A Geometric Approach with Applications to String Matching Problems [BibTeX] |
1999 | Proceedings of the 31st ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Ferragina1999c, author = {P. Ferragina and S. Muthukrishnan and de Berg M.}, title = {Multi-method Dispatching: {A} Geometric Approach with Applications to String Matching Problems}, booktitle = {Proceedings of the 31st ACM Symposium on the Theory of Computing}, year = {1999}, pages = {483--491} } |
|||||

Ferretti, V., Nadeau, J. H. & Sankoff, D. | Original Synteny [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Ferretti1996, author = {V. Ferretti and J. H. Nadeau and D. Sankoff}, title = {Original Synteny}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {159--167} } |
|||||

Fickett, J. W. | Fast optimal alignment [BibTeX] |
1984 | Nucleic Acids Res. | article | |

BibTeX:
@article{Fickett1984, author = {J. W. Fickett}, title = {Fast optimal alignment}, journal = {Nucleic Acids Res.}, year = {1984}, volume = {12}, number = {1}, pages = {175--179} } |
|||||

Figueroa, K., Chávez, E., Navarro, G. & Paredes, R. | On the Least Cost For Proximity Searching in Metric Spaces [BibTeX] |
2006 | Proc. 5th Workshop on Efficient and Experimental Algorithms (WEA'06) | inproceedings | |

BibTeX:
@inproceedings{Figueroa2006, author = {Karina Figueroa and Edgar Ch\'avez and Gonzalo Navarro and Rodrigo Paredes}, title = {On the Least Cost For Proximity Searching in Metric Spaces}, booktitle = {Proc. 5th Workshop on Efficient and Experimental Algorithms (WEA'06)}, year = {2006}, pages = {279--290} } |
|||||

Finamore, W. A., de Azevedo, R. D. & da Silva Pinho, M. | On procedures for multiple-string match with respect to two sets [BibTeX] |
1999 | Proceedings of the Prague Stringology Club Workshop~'99 | inproceedings | |

BibTeX:
@inproceedings{Finamore1999, author = {W. A. Finamore and R. D. de Azevedo and M. da Silva Pinho}, title = {On procedures for multiple-string match with respect to two sets}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'99}, year = {1999}, pages = {29--39}, note = {Collaborative Report DC--99--05} } |
|||||

Fine, N. J. & Wilf, H. S. | Uniqueness theorems for periodic functions [BibTeX] |
1965 | Proc. Amer. Math. Soc. | article | |

BibTeX:
@article{Fine1965, author = {N. J. Fine and H. S. Wilf}, title = {Uniqueness theorems for periodic functions}, journal = {Proc. Amer. Math. Soc.}, year = {1965}, volume = {16}, pages = {109--114} } |
|||||

Fischer, D., Norel, R., Nussinov, R. & Wolfson, H. J. | 3-D Docking of Protein Molecules [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fischer1993, author = {D. Fischer and R. Norel and R. Nussinov and H. J. Wolfson}, title = {{3-D} Docking of Protein Molecules}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {20--34} } |
|||||

Fischer, D., Nussinov, R. & Wolfson, H. J. | 3-D structure matching in protein molecules [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fischer1992, author = {D. Fischer and R. Nussinov and H. J. Wolfson}, title = {3-D structure matching in protein molecules}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {136--150} } |
|||||

Fischer, M. J. & Paterson, M. | String matching and other products [BibTeX] |
1974 | Proceedings SIAM-AMS Complexity of Computation | inproceedings | |

BibTeX:
@inproceedings{Fischer1974, author = {M. J. Fischer and M. Paterson}, title = {String matching and other products}, booktitle = {Proceedings SIAM-AMS Complexity of Computation}, year = {1974}, pages = {113--125} } |
|||||

Fischetti, V. A., Landau, G. M., Schmidt, J. P. & Sellers, P. H. | Identifying periodic occurrences of a template with applications to protein struture [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fischetti1992, author = {V. A. Fischetti and G. M. Landau and J. P. Schmidt and P. H. Sellers}, title = {Identifying periodic occurrences of a template with applications to protein struture}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {111--120} } |
|||||

Fischetti, V. A., Landau, G. M., Sellers, P. H. & Schmidt, J. P. | Identifying periodic occurrences of a template with applications to protein struture [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@article{Fischetti1993, author = {V. A. Fischetti and G. M. Landau and P. H. Sellers and J. P. Schmidt}, title = {Identifying periodic occurrences of a template with applications to protein struture}, journal = {Inf. Process. Lett.}, year = {1993}, volume = {45}, number = {1}, pages = {11--18} } |
|||||

Fitch, W. M. & Smith, T. F. | Optimal sequence alignments [BibTeX] |
1983 | Proc. Natl. Acad. Sci. U.S.A. | article | |

BibTeX:
@article{Fitch1983, author = {W. M. Fitch and T. F. Smith}, title = {Optimal sequence alignments}, journal = {Proc. Natl. Acad. Sci. U.S.A.}, year = {1983}, volume = {80}, pages = {1382--1386} } |
|||||

Flajolet, P. & Puech, C. | Partial match retrieval of multidimensional data [BibTeX] |
1986 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Flajolet1986, author = {P. Flajolet and C. Puech}, title = {Partial match retrieval of multidimensional data}, journal = {J. Assoc. Comput. Mach.}, year = {1986}, volume = {33}, number = {2}, pages = {371--407} } |
|||||

Floratos, A., Rigoutsos, I., Parida, L., Stolovitzky, G. & Gao, Y. | Sequence Homology Detection Through Large-Scale Pattern Discovery [BibTeX] |
1999 | Proceedings Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@inproceedings{Floratos1999, author = {A. Floratos and I. Rigoutsos and L. Parida and G. Stolovitzky and Y. Gao}, title = {Sequence Homology Detection Through Large-Scale Pattern Discovery}, booktitle = {Proceedings Annual International Conference on Computational Molecular Biology (RECOMB)}, year = {1999}, pages = {164--169} } |
|||||

Foulser, D. E. | A linear time algorithm for DNA sequencing [BibTeX] |
1990 | techreport | ||

BibTeX:
@techreport{Foulser1990, author = {D. E. Foulser}, title = {A linear time algorithm for {DNA} sequencing}, year = {1990}, number = {YALEU/DCS/RR-812} } |
|||||

Foulser, D. E. | On random strings and sequence comparisons [BibTeX] |
1986 | School: Computer Science Department, Stanford University |
phdthesis | |

BibTeX:
@phdthesis{Foulser1986, author = {D. E. Foulser}, title = {On random strings and sequence comparisons}, school = {Computer Science Department, Stanford University}, year = {1986} } |
|||||

Fraenkel, A. | Recent results and questions in combinatorial game complexities [BibTeX] |
1998 | Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Fraenkel1998, author = {A. Fraenkel}, title = {Recent results and questions in combinatorial game complexities}, booktitle = {Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms}, year = {1998}, pages = {124--146} } |
|||||

Fraenkel, A. S. & Klein, S. T. | Complexity Aspects of Guessing Prefix Codes [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@article{Fraenkel1994, author = {A. S. Fraenkel and S. T. Klein}, title = {Complexity Aspects of Guessing Prefix Codes}, journal = {Algorithmica}, year = {1994}, volume = {12}, number = {4/5}, pages = {409--419} } |
|||||

Fraenkel, A. S. & Simpson, J. | The exact number of squares in Fibonacci words [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Fraenkel1999, author = {A. S. Fraenkel and J. Simpson}, title = {The exact number of squares in {Fibonacci} words}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {218}, number = {1}, pages = {95--106} } |
|||||

Fraenkel, A. S. & Simpson, J. | How many squares can a string contain? [BibTeX] |
1998 | J. Combin. Theory Ser. A | article | |

BibTeX:
@article{Fraenkel1998a, author = {A. S. Fraenkel and J. Simpson}, title = {How many squares can a string contain?}, journal = {J. Combin. Theory Ser. A}, year = {1998}, volume = {82}, pages = {112--120} } |
|||||

Fraenkel, A. S. & Simpson, J. | How many squares must a binary sequence contain? [BibTeX] |
1995 | Electronic Journal of Combinatorics | article | |

BibTeX:
@article{Fraenkel1995, author = {A. S. Fraenkel and J. Simpson}, title = {How many squares must a binary sequence contain?}, journal = {Electronic Journal of Combinatorics}, year = {1995}, volume = {2}, pages = {R2} } |
|||||

Fraenkel, A. S., Simpson, J. & Paterson, M. | On weak circular squares in binary words [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fraenkel1997, author = {A. S. Fraenkel and J. Simpson and M. Paterson}, title = {On weak circular squares in binary words}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {76--82} } |
|||||

Franv ek, F., Karaman, A. & Smyth, W. F. | Repetitions in Sturmian words [BibTeX] |
2000 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Franv2000, author = {F. Fran{\v e}k and A. Karaman and W. F. Smyth}, title = {Repetitions in Sturmian words}, journal = {Theor. Comput. Sci.}, year = {2000}, volume = {249}, number = {2}, pages = {289--303} } |
|||||

Franv ek, F., Karaman, A. & Smyth, W. F. | Repetitions in Sturmian words [BibTeX] |
1998 | Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Franv1998, author = {F. Fran{\v e}k and A. Karaman and W. F. Smyth}, title = {Repetitions in Sturmian words}, booktitle = {Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms}, year = {1998}, pages = {107--116} } |
|||||

Franv ek, F., Lu, W., Ryan, P. J., Smyth, W. F., Sun, Y. & Yang, L. | Verifying a border array in linear time [BibTeX] |
1999 | Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Franv1999, author = {F. Fran{\v e}k and W. Lu and P. J. Ryan and W. F. Smyth and Y. Sun and L. Yang}, title = {Verifying a border array in linear time}, booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms}, year = {1999}, pages = {26--33} } |
|||||

Franv ek, F., Lu, W. & Smyth, W. F. | Repetitions in two-pattern strings [BibTeX] |
2000 | Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia | inproceedings | |

BibTeX:
@inproceedings{Franv2000a, author = {F. Fran{\v e}k and W. Lu and W. F. Smyth}, title = {Repetitions in two-pattern strings}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia}, year = {2000}, pages = {32--48}, note = {Collaborative Report DC--2000--03} } |
|||||

Franv ek, F., Smyth, W. F. & Xiao, X. | A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@inproceedings{Franv2002, author = {F. Fran{\v e}k and W. F. Smyth and X. Xiao}, title = {A Note on {C}rochemore's Repetitions Algorithm a Fast Space-Efficient Approach}, booktitle = {Proceedings of the Prague Stringology Conference~'02}, year = {2002}, pages = {36--43}, note = {Research Report DC--2002--03} } |
|||||

Fraser, C. B. | Consistent subsequences and supersequences [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Fraser1996, author = {C. B. Fraser}, title = {Consistent subsequences and supersequences}, journal = {Theor. Comput. Sci.}, year = {1996}, volume = {165}, number = {2}, pages = {233--246} } |
|||||

Fraser, C. B. | Subsequences and supersequences of strings [BibTeX] |
1995 | School: University of Glasgow, UK |
phdthesis | |

BibTeX:
@phdthesis{Fraser1995, author = {C. B. Fraser}, title = {Subsequences and supersequences of strings}, school = {University of Glasgow, UK}, year = {1995} } |
|||||

Fraser, C. B. & Irving, R. W. | Maximal common subsequences and minimal common supersequences [BibTeX] |
1996 | Inf. Comput. | article | |

BibTeX:
@article{Fraser1996a, author = {C. B. Fraser and R. W. Irving}, title = {Maximal common subsequences and minimal common supersequences}, journal = {Inf. Comput.}, year = {1996}, volume = {124}, number = {2}, pages = {145--153} } |
|||||

Fredkin, E. | Trie memory [BibTeX] |
1960 | Commun. ACM | article | |

BibTeX:
@article{Fredkin1960, author = {E. Fredkin}, title = {Trie memory}, journal = {Commun. ACM}, year = {1960}, volume = {3}, number = {9}, pages = {490--499} } |
|||||

Fredkin, E. | Trie memory [BibTeX] |
1959 | book | ||

BibTeX:
@book{Fredkin1959, author = {E. Fredkin}, title = {Trie memory}, publisher = {Information Memorandum, Bolt Beranek and NewMan Inc.}, year = {1959} } |
|||||

Fredman, M. L. | On computing the length of longest increasing subsequences [BibTeX] |
1975 | Discret. Math. | article | |

BibTeX:
@article{Fredman1975, author = {M. L. Fredman}, title = {On computing the length of longest increasing subsequences}, journal = {Discret. Math.}, year = {1975}, volume = {11}, pages = {29--35} } |
|||||

Fredriksson, K., Mäkinen, V. & Navarro, G. | Rotation and Lighting Invariant Template Matching [BibTeX] |
2006 | Information and Computation | article | |

BibTeX:
@article{Fredriksson2006, author = {K. Fredriksson and V. M{\"a}kinen and G. Navarro}, title = {Rotation and Lighting Invariant Template Matching}, journal = {Information and Computation}, year = {2006}, note = {To appear} } |
|||||

Fredriksson, K., Mäkinen, V. & Navarro, G. | Flexible Music Retrieval in Sublinear Time [BibTeX] |
2006 | International Journal of Foundations of Computer Science (IJFCS) | article | |

BibTeX:
@article{Fredriksson2006a, author = {K. Fredriksson and V. M{\"a}kinen and G. Navarro}, title = {Flexible Music Retrieval in Sublinear Time}, journal = {International Journal of Foundations of Computer Science (IJFCS)}, year = {2006}, volume = {17}, number = {6}, pages = {1345--1364} } |
|||||

Fredriksson, K., Navarro, G. & Ukkonen, E. | Sequential and Indexed Two-Dimensional Combinatorial Template Matching Allowing Rotations [BibTeX] |
2005 | Theoretical Computer Science A | article | |

BibTeX:
@article{Fredriksson2005, author = {K. Fredriksson and G. Navarro and E. Ukkonen}, title = {Sequential and Indexed Two-Dimensional Combinatorial Template Matching Allowing Rotations}, journal = {Theoretical Computer Science A}, year = {2005}, volume = {347}, number = {1--2}, pages = {239--275} } |
|||||

Fredriksson, K. & Ukkonen, E. | Rotation Invariant Filters for Multidimensional String Matching and Orientation Search [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fredriksson1998, author = {K. Fredriksson and E. Ukkonen}, title = {Rotation Invariant Filters for Multidimensional String Matching and Orientation Search}, booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1448}, pages = {118--125} } |
|||||

French, J., Powell, A. & Schulman, E. | Applications of approximate word matching in information retrieval [BibTeX] |
1997 | Proceedings ACM CIKM'97 | inproceedings | |

BibTeX:
@inproceedings{French1997, author = {J. French and A. Powell and E. Schulman}, title = {Applications of approximate word matching in information retrieval}, booktitle = {Proceedings ACM CIKM'97}, year = {1997}, pages = {9--15} } |
|||||

Freund, H. & Wolter, R. | Evolution of Bit Strings: Some Preliminary Results [BibTeX] |
1991 | Complex Syst. | article | |

BibTeX:
@article{Freund1991, author = {H. Freund and R. Wolter}, title = {Evolution of Bit Strings: Some Preliminary Results}, journal = {Complex Syst.}, year = {1991}, volume = {5}, number = {3}, pages = {279--298} } |
|||||

Friedemann, T. | Alignment of multiple DNA and protein sequence data [BibTeX] |
1988 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Friedemann1988, author = {T. Friedemann}, title = {Alignment of multiple {DNA} and protein sequence data}, journal = {Comput. Appl. Biosci.}, year = {1988}, volume = {4}, pages = {213--214} } |
|||||

Frieze, A. M. & Szpankowski, W. | Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal [BibTeX] |
1998 | Algorithmica | article | |

BibTeX:
@article{Frieze1998, author = {A. M. Frieze and W. Szpankowski}, title = {Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal}, journal = {Algorithmica}, year = {1998}, volume = {21}, number = {1}, pages = {21--36} } |
|||||

Fu, J. | Pattern matching in directed graphs [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fu1995, author = {J. Fu}, title = {Pattern matching in directed graphs}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {64--77} } |
|||||

Fu, K. J. | Approximate Pattern Matching in Directed Graphs [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Fu1996, author = {K. J. Fu}, title = {Approximate Pattern Matching in Directed Graphs}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {373--383} } |
|||||

Fudos, I., Pitoura, E. & Szpankowski, W. | On pattern occurrences in a random text [BibTeX] |
1996 | Inf. Process. Lett. | article | |

BibTeX:
@article{Fudos1996, author = {I. Fudos and E. Pitoura and W. Szpankowski}, title = {On pattern occurrences in a random text}, journal = {Inf. Process. Lett.}, year = {1996}, volume = {57}, pages = {307--312} } |
|||||

Galil, Z. | Hunting lions in the desert optimally or a constant time optimal parallel string matching algorithms [BibTeX] |
1992 | Proceedings of the 24th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Galil1992, author = {Z. Galil}, title = {Hunting lions in the desert optimally or a constant time optimal parallel string matching algorithms}, booktitle = {Proceedings of the 24th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1992}, pages = {69--76} } |
|||||

Galil, Z. | Open problems in stringology [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@incollection{Galil1985, author = {Z. Galil}, title = {Open problems in stringology}, booktitle = {Combinatorial Algorithms on Words}, publisher = {Springer-Verlag, Berlin}, year = {1985}, pages = {1--8} } |
|||||

Galil, Z. | Optimal parallel algorithms for string matching [BibTeX] |
1985 | Inf. Control | article | |

BibTeX:
@article{Galil1985a, author = {Z. Galil}, title = {Optimal parallel algorithms for string matching}, journal = {Inf. Control}, year = {1985}, volume = {67}, number = {1--3}, pages = {144--157} } |
|||||

Galil, Z. | Optimal parallel algorithms for string matching [BibTeX] |
1984 | Proceedings of the 16th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Galil1984, author = {Z. Galil}, title = {Optimal parallel algorithms for string matching}, booktitle = {Proceedings of the 16th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1984}, pages = {240--248} } |
|||||

Galil, Z. | Optimal Parallel Algorithms for String Matching [BibTeX] |
1983 | techreport | ||

BibTeX:
@techreport{Galil1983, author = {Z. Galil}, title = {Optimal Parallel Algorithms for String Matching}, year = {1983}, number = {CUCS-74-83} } |
|||||

Galil, Z. | String matching in real time [BibTeX] |
1981 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Galil1981, author = {Z. Galil}, title = {String matching in real time}, journal = {J. Assoc. Comput. Mach.}, year = {1981}, volume = {28}, number = {1}, pages = {134--149} } |
|||||

Galil, Z. | On improving the worst case running time of the Boyer-Moore string searching algorithm [BibTeX] |
1979 | Commun. ACM | article | |

BibTeX:
@article{Galil1979, author = {Z. Galil}, title = {On improving the worst case running time of the {Boyer-Moore} string searching algorithm}, journal = {Commun. ACM}, year = {1979}, volume = {22}, number = {9}, pages = {505--508} } |
|||||

Galil, Z. | Palindrome recognition in real time by a multitape Turing machine [BibTeX] |
1978 | Proceedings of the 5th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Galil1978, author = {Z. Galil}, title = {Palindrome recognition in real time by a multitape Turing machine}, booktitle = {Proceedings of the 5th International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1978}, number = {62}, pages = {241--250} } |
|||||

Galil, Z. | Palindrome recognition in real time by a multitape Turing machine [BibTeX] |
1978 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Galil1978a, author = {Z. Galil}, title = {Palindrome recognition in real time by a multitape Turing machine}, journal = {J. Comput. Syst. Sci.}, year = {1978}, volume = {16}, number = {2}, pages = {140--157} } |
|||||

Galil, Z. | Some open problems in the theory of computations as questions about two-way deterministic pushdown automaton languages [BibTeX] |
1977 | Math. Syst. Theory | article | |

BibTeX:
@article{Galil1977, author = {Z. Galil}, title = {Some open problems in the theory of computations as questions about two-way deterministic pushdown automaton languages}, journal = {Math. Syst. Theory}, year = {1977}, volume = {10}, pages = {211--228} } |
|||||

Galil, Z. | Real time algorithms for string matching and palindrome recognition [BibTeX] |
1976 | Proceedings of the 8th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Galil1976, author = {Z. Galil}, title = {Real time algorithms for string matching and palindrome recognition}, booktitle = {Proceedings of the 8th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1976}, pages = {161--173} } |
|||||

Galil, Z. | Two fast simulations which imply some fast string matching and palindrome recognition algorithms [BibTeX] |
1976 | Inf. Process. Lett. | article | |

BibTeX:
@article{Galil1976a, author = {Z. Galil}, title = {Two fast simulations which imply some fast string matching and palindrome recognition algorithms}, journal = {Inf. Process. Lett.}, year = {1976}, volume = {4}, number = {4}, pages = {85--87} } |
|||||

Galil, Z. & Giancarlo, R. | On the exact complexity of string matching: upper bounds [BibTeX] |
1992 | SIAM J. Comput. | article | |

BibTeX:
@article{Galil1992a, author = {Z. Galil and R. Giancarlo}, title = {On the exact complexity of string matching: upper bounds}, journal = {SIAM J. Comput.}, year = {1992}, volume = {21}, number = {3}, pages = {407--437} } |
|||||

Galil, Z. & Giancarlo, R. | On the exact complexity of string matching: lower bounds [BibTeX] |
1991 | SIAM J. Comput. | article | |

BibTeX:
@article{Galil1991, author = {Z. Galil and R. Giancarlo}, title = {On the exact complexity of string matching: lower bounds}, journal = {SIAM J. Comput.}, year = {1991}, volume = {20}, number = {6}, pages = {1008--1020} } |
|||||

Galil, Z. & Giancarlo, R. | Speeding up dynamic programming with applications to molecular biology [BibTeX] |
1989 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Galil1989, author = {Z. Galil and R. Giancarlo}, title = {Speeding up dynamic programming with applications to molecular biology}, journal = {Theor. Comput. Sci.}, year = {1989}, volume = {64}, number = {1}, pages = {107--118} } |
|||||

Galil, Z. & Giancarlo, R. | Data structures and algorithms for approximate string matching [BibTeX] |
1988 | J. Complexity | article | |

BibTeX:
@article{Galil1988, author = {Z. Galil and R. Giancarlo}, title = {Data structures and algorithms for approximate string matching}, journal = {J. Complexity}, year = {1988}, volume = {4}, number = {1}, pages = {33--72} } |
|||||

Galil, Z. & Giancarlo, R. | Parallel string matching with k mismatches [BibTeX] |
1987 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Galil1987, author = {Z. Galil and R. Giancarlo}, title = {Parallel string matching with {\emph{k}} mismatches}, journal = {Theor. Comput. Sci.}, year = {1987}, volume = {51}, number = {1}, pages = {341--348} } |
|||||

Galil, Z. & Giancarlo, R. | Data Structures and Algorithms for approximate String Matching [BibTeX] |
1987 | techreport | ||

BibTeX:
@techreport{Galil1987a, author = {Z. Galil and R. Giancarlo}, title = {Data Structures and Algorithms for approximate String Matching}, year = {1987}, number = {CUCS-299-87} } |
|||||

Galil, Z. & Giancarlo, R. | Improved string matching with k mismatches [BibTeX] |
1986 | SIGACT News | article | |

BibTeX:
@article{Galil1986, author = {Z. Galil and R. Giancarlo}, title = {Improved string matching with {\emph{k}} mismatches}, journal = {SIGACT News}, year = {1986}, volume = {17}, number = {4}, pages = {52--54} } |
|||||

Galil, Z., Giancarlo, R. & Park, K. | Fully Dynamic Dictionary Matching [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Galil1991a, author = {Z. Galil and R. Giancarlo and K. Park}, title = {Fully Dynamic Dictionary Matching}, year = {1991}, number = {CUCS-043-91} } |
|||||

Galil, Z. & Park, K. | Alphabet-independent two-dimensional witness computation [BibTeX] |
1996 | SIAM J. Comput. | article | |

BibTeX:
@article{Galil1996, author = {Z. Galil and K. Park}, title = {Alphabet-independent two-dimensional witness computation}, journal = {SIAM J. Comput.}, year = {1996}, volume = {25}, number = {5}, pages = {907--935} } |
|||||

Galil, Z. & Park, K. | Dynamic programming with convexity, concavity, and sparsity [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Galil1992b, author = {Z. Galil and K. Park}, title = {Dynamic programming with convexity, concavity, and sparsity}, journal = {Theor. Comput. Sci.}, year = {1992}, volume = {92}, number = {1}, pages = {49--76} } |
|||||

Galil, Z. & Park, K. | Truly alphabet-independent two-dimensional pattern matching [BibTeX] |
1992 | Proceedings of the 33th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Galil1992c, author = {Z. Galil and K. Park}, title = {Truly alphabet-independent two-dimensional pattern matching}, booktitle = {Proceedings of the 33th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1992}, pages = {247--256} } |
|||||

Galil, Z. & Park, K. | A linear-time algorithm for concave one-dimensional dynamic programming [BibTeX] |
1990 | Inf. Process. Lett. | article | |

BibTeX:
@article{Galil1990, author = {Z. Galil and K. Park}, title = {A linear-time algorithm for concave one-dimensional dynamic programming}, journal = {Inf. Process. Lett.}, year = {1990}, volume = {33}, number = {6}, pages = {309--311} } |
|||||

Galil, Z. & Park, K. | An improved algorithm for approximate string matching [BibTeX] |
1990 | SIAM J. Comput. | article | |

BibTeX:
@article{Galil1990a, author = {Z. Galil and K. Park}, title = {An improved algorithm for approximate string matching}, journal = {SIAM J. Comput.}, year = {1990}, volume = {19}, number = {6}, pages = {989--999} } |
|||||

Galil, Z. & Park, K. | An improved algorithm for approximate string matching [BibTeX] |
1989 | Proceedings of the 16th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Galil1989a, author = {Z. Galil and K. Park}, title = {An improved algorithm for approximate string matching}, booktitle = {Proceedings of the 16th International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1989}, number = {372}, pages = {394--404} } |
|||||

Galil, Z. & Park, K. | An Improved Algorithm for Approximate String Matching [BibTeX] |
1989 | techreport | ||

BibTeX:
@techreport{Galil1989b, author = {Z. Galil and K. Park}, title = {An Improved Algorithm for Approximate String Matching}, year = {1989}, number = {CUCS-468-89} } |
|||||

Galil, Z. & Rabani, Y. | On the space Complexity of Some Algorithms for Sequence Comparison [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Galil1992d, author = {Z. Galil and Y. Rabani}, title = {On the space Complexity of Some Algorithms for Sequence Comparison}, journal = {Theor. Comput. Sci.}, year = {1992}, volume = {95}, number = {2}, pages = {231--244} } |
|||||

Galil, Z. & Seiferas, J. | Time-space optimal string matching [BibTeX] |
1983 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Galil1983a, author = {Z. Galil and J. Seiferas}, title = {Time-space optimal string matching}, journal = {J. Comput. Syst. Sci.}, year = {1983}, volume = {26}, number = {3}, pages = {280--294} } |
|||||

Galil, Z. & Seiferas, J. | Linear-time string matching using only a fixed number of local storage locations [BibTeX] |
1981 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Galil1981a, author = {Z. Galil and J. Seiferas}, title = {Linear-time string matching using only a fixed number of local storage locations}, journal = {Theor. Comput. Sci.}, year = {1981}, volume = {13}, number = {3}, pages = {331--336} } |
|||||

Galil, Z. & Seiferas, J. | Time-space optimal string matching [BibTeX] |
1981 | Proceedings of the 13th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Galil1981b, author = {Z. Galil and J. Seiferas}, title = {Time-space optimal string matching}, booktitle = {Proceedings of the 13th ACM Symposium on the Theory of Computing}, year = {1981}, pages = {106--113} } |
|||||

Galil, Z. & Seiferas, J. | Saving space in fast string-matching [BibTeX] |
1980 | SIAM J. Comput. | article | |

BibTeX:
@article{Galil1980, author = {Z. Galil and J. Seiferas}, title = {Saving space in fast string-matching}, journal = {SIAM J. Comput.}, year = {1980}, volume = {9}, number = {2}, pages = {417--438} } |
|||||

Galil, Z. & Seiferas, J. | A linear-time on-line recognition algorithm for ``Palstars'' [BibTeX] |
1978 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Galil1978b, author = {Z. Galil and J. Seiferas}, title = {A linear-time on-line recognition algorithm for ``Palstars''}, journal = {J. Assoc. Comput. Mach.}, year = {1978}, volume = {25}, number = {1}, pages = {102--111} } |
|||||

Galil, Z. & Seiferas, J. | Saving space in fast string-matching [BibTeX] |
1977 | Proceedings of the 18th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Galil1977a, author = {Z. Galil and J. Seiferas}, title = {Saving space in fast string-matching}, booktitle = {Proceedings of the 18th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1977}, pages = {179--188} } |
|||||

Galil, Z. & Seiferas, J. | Recognizing certain repetitions and reversals within strings [BibTeX] |
1976 | Proceedings of the 17th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Galil1976b, author = {Z. Galil and J. Seiferas}, title = {Recognizing certain repetitions and reversals within strings}, booktitle = {Proceedings of the 17th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1976}, pages = {236--252} } |
|||||

Galil, Z. & Yudkiewicz, I. | On-line parallel exact string searching [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@incollection{Galil1997, author = {Z. Galil and I. Yudkiewicz}, title = {On-line parallel exact string searching}, booktitle = {Pattern matching algorithms}, publisher = {Oxford University Press}, year = {1997}, pages = {55--88} } |
|||||

Gallant, J., Maier, D. & Storer, J. | On finding minimal length superstring [BibTeX] |
1980 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Gallant1980, author = {J. Gallant and D. Maier and J. Storer}, title = {On finding minimal length superstring}, journal = {J. Comput. Syst. Sci.}, year = {1980}, volume = {20}, number = {1}, pages = {50--58} } |
|||||

Garel, E. | Séparateurs dans les mots infinis engendrés par morphismes [BibTeX] |
1997 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Garel1997, author = {E. Garel}, title = {S\'eparateurs dans les mots infinis engendr\'es par morphismes}, journal = {Theor. Comput. Sci.}, year = {1997}, volume = {180}, number = {1--2}, pages = {81--113} } |
|||||

Garel, E. | Minimal separators of two words [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Garel1993, author = {E. Garel}, title = {Minimal separators of two words}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {35--53} } |
|||||

Garey, M. R. & Johnson, D. S. | Computers and intractability: a guide to the theory of NP-completeness [BibTeX] |
1979 | book | ||

BibTeX:
@book{Garey1979, author = {M. R. Garey and D. S. Johnson}, title = {Computers and intractability: a guide to the theory of NP-completeness}, publisher = {Freeman}, year = {1979} } |
|||||

Gelfand, M. S. & Koonin, E. | Avoidance of palindromic words in bacterial and archaeal genomes: a close connection with restriction enzymes [BibTeX] |
1997 | Nucleic Acids Res. | article | |

BibTeX:
@article{Gelfand1997, author = {M. S. Gelfand and E.V. Koonin}, title = {Avoidance of palindromic words in bacterial and archaeal genomes: a close connection with restriction enzymes}, journal = {Nucleic Acids Res.}, year = {1997}, volume = {25}, pages = {2430--2439} } |
|||||

Gelfand, M. S., Koonin, E. V. & Mironov, A. A. | Prediction of transcription regulatory sites in Archaea by a comparative genomic approach [BibTeX] |
2000 | Nucleic Acids Res. | article | |

BibTeX:
@article{Gelfand2000, author = {M. S. Gelfand and E. V. Koonin and A. A. Mironov}, title = {Prediction of transcription regulatory sites in Archaea by a comparative genomic approach}, journal = {Nucleic Acids Res.}, year = {2000}, volume = {28}, number = {3}, pages = {695--705} } |
|||||

Gelfand, M. S., Kozhukhin, C. G. & Pevzner, P. A. | Extendable words in nucleotide sequences [BibTeX] |
1992 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Gelfand1992, author = {M. S. Gelfand and C. G. Kozhukhin and P. A. Pevzner}, title = {Extendable words in nucleotide sequences}, journal = {Comput. Appl. Biosci.}, year = {1992}, volume = {8}, pages = {129--135} } |
|||||

Gelfand, M. S., Mironov, A. A. & Pevzner, P. A. | Spliced Alignment: A New Approach to Gene Recognition [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gelfand1996, author = {M. S. Gelfand and A. A. Mironov and P. A. Pevzner}, title = {Spliced Alignment: A New Approach to Gene Recognition}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {141--158} } |
|||||

Geréb-Graus, M. & Li, M. | Three one-way heads cannot do string matching [BibTeX] |
1994 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Ger'eb-Graus1994, author = {M. Ger{\'e}b-Graus and M. Li}, title = {Three one-way heads cannot do string matching}, journal = {J. Comput. Syst. Sci.}, year = {1994}, volume = {48}, number = {1}, pages = {1--8} } |
|||||

Giammarresi, D. | Periodicities on trees [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Giammarresi1998, author = {D. Giammarresi}, title = {Periodicities on trees}, journal = {Theor. Comput. Sci.}, year = {1998}, volume = {205}, number = {1/2}, pages = {145--181} } |
|||||

Giammarresi, D. & Restivo, A. | Recognizable picture languages [BibTeX] |
1992 | Internat. J. Pattern Recognition and Artificial Intelligence | article | |

BibTeX:
@article{Giammarresi1992, author = {D. Giammarresi and A. Restivo}, title = {Recognizable picture languages}, journal = {Internat. J. Pattern Recognition and Artificial Intelligence}, year = {1992}, volume = {6}, number = {2--3}, pages = {241--256} } |
|||||

Giammarresi, D. & Restivo, A. | Recognizable picture languages [BibTeX] |
1991 | Proceedings of the 1st International Colloquium on Parallel Image Processing | inproceedings | |

BibTeX:
@inproceedings{Giammarresi1991, author = {D. Giammarresi and A. Restivo}, title = {Recognizable picture languages}, booktitle = {Proceedings of the 1st International Colloquium on Parallel Image Processing}, year = {1991}, pages = {?--?} } |
|||||

Giammarresi, D., Restivo, A., Seibert, S. & Thomas, W. | Monadic second-order logic over pictures and recognizability [BibTeX] |
1994 | Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Giammarresi1994, author = {D. Giammarresi and A. Restivo and S. Seibert and W. Thomas}, title = {Monadic second-order logic over pictures and recognizability}, booktitle = {Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {775}, pages = {365--375} } |
|||||

Giancarlo, R. | Dynamic programming: special cases [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@incollection{Giancarlo1997, author = {R. Giancarlo}, title = {Dynamic programming: special cases}, booktitle = {Pattern matching algorithms}, publisher = {Oxford University Press}, year = {1997}, pages = {201--236} } |
|||||

Giancarlo, R. | A generalization of the suffix tree to square matrices, with applications [BibTeX] |
1995 | SIAM J. Comput. | article | |

BibTeX:
@article{Giancarlo1995, author = {R. Giancarlo}, title = {A generalization of the suffix tree to square matrices, with applications}, journal = {SIAM J. Comput.}, year = {1995}, volume = {24}, number = {3}, pages = {520--562} } |
|||||

Giancarlo, R. | An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching [BibTeX] |
1993 | Proceedings of the 3rd Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@inproceedings{Giancarlo1993, author = {R. Giancarlo}, title = {An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching}, booktitle = {Proceedings of the 3rd Workshop on Algorithms and Data Structures}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {709}, pages = {337--348} } |
|||||

Giancarlo, R. | The suffix tree of a square matrix with applications [BibTeX] |
1993 | Proceedings of the 4th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Giancarlo1993a, author = {R. Giancarlo}, title = {The suffix tree of a square matrix with applications}, booktitle = {Proceedings of the 4th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1993}, pages = {402--411} } |
|||||

Giancarlo, R. | Efficient algorithms on strings [BibTeX] |
1990 | School: Departement of Computer Science, Columbia University, New-York |
phdthesis | |

BibTeX:
@phdthesis{Giancarlo1990, author = {R. Giancarlo}, title = {Efficient algorithms on strings}, school = {Departement of Computer Science, Columbia University, New-York}, year = {1990} } |
|||||

Giancarlo, R. & Grossi, R. | Suffix tree data structures for matrices [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@incollection{Giancarlo1997a, author = {R. Giancarlo and R. Grossi}, title = {Suffix tree data structures for matrices}, booktitle = {Pattern matching algorithms}, publisher = {Oxford University Press}, year = {1997}, pages = {293--340} } |
|||||

Giancarlo, R. & Grossi, R. | Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms [BibTeX] |
1997 | J. Algorithms | article | |

BibTeX:
@article{Giancarlo1997b, author = {R. Giancarlo and R. Grossi}, title = {Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms}, journal = {J. Algorithms}, year = {1997}, volume = {24}, number = {2}, pages = {223--265} } |
|||||

Giancarlo, R. & Grossi, R. | On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications [BibTeX] |
1996 | Inf. Comput. | article | |

BibTeX:
@article{Giancarlo1996, author = {R. Giancarlo and R. Grossi}, title = {On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications}, journal = {Inf. Comput.}, year = {1996}, volume = {130}, number = {2}, pages = {151--182} } |
|||||

Giancarlo, R. & Grossi, R. | Multi-dimensional pattern matching with dimensional wildcards [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Giancarlo1995a, author = {R. Giancarlo and R. Grossi}, title = {Multi-dimensional pattern matching with dimensional wildcards}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {90--101} } |
|||||

Giancarlo, R. & Grossi, R. | Parallel construction and query of suffix trees for two-dimensional matrices [BibTeX] |
1993 | Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures | inproceedings | |

BibTeX:
@inproceedings{Giancarlo1993b, author = {R. Giancarlo and R. Grossi}, title = {Parallel construction and query of suffix trees for two-dimensional matrices}, booktitle = {Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures}, publisher = {ACM Press}, year = {1993}, pages = {86--97} } |
|||||

Gibbons, A. & Rytter, W. | Optimal parallel algorithms for dynamic expression evaluation and context-free recognition [BibTeX] |
1989 | Inf. Comput. | article | |

BibTeX:
@article{Gibbons1989, author = {A. Gibbons and W. Rytter}, title = {Optimal parallel algorithms for dynamic expression evaluation and context-free recognition}, journal = {Inf. Comput.}, year = {1989}, volume = {81}, number = {1}, pages = {32--45} } |
|||||

Gibbons, A. & Rytter, W. | Efficient parallel algorithms [BibTeX] |
1988 | book | ||

BibTeX:
@book{Gibbons1988, author = {A. Gibbons and W. Rytter}, title = {Efficient parallel algorithms}, publisher = {Cambridge University Press}, year = {1988} } |
|||||

Gibbons, A. & Rytter, W. | On the decidability of some problems about rational subsets of free partially commutative monoids [BibTeX] |
1986 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Gibbons1986, author = {A. Gibbons and W. Rytter}, title = {On the decidability of some problems about rational subsets of free partially commutative monoids}, journal = {Theor. Comput. Sci.}, year = {1986}, volume = {48}, number = {2--3}, pages = {329--337} } |
|||||

Giegerich, R. | Explaining and Controlling Ambiguity in Dynamic Programming [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Giegerich2000, author = {R. Giegerich}, title = {Explaining and Controlling Ambiguity in Dynamic Programming}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {46--59} } |
|||||

Giegerich, R. & Kurtz, S. | From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction [BibTeX] |
1997 | Algorithmica | article | |

BibTeX:
@article{Giegerich1997, author = {R. Giegerich and S. Kurtz}, title = {From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction}, journal = {Algorithmica}, year = {1997}, volume = {19}, number = {3}, pages = {331--353} } |
|||||

Giegerich, R. & Kurtz, S. | A comparison of imperative and purely functional suffix tree constructions [BibTeX] |
1995 | Sci. Comp. Program. | article | |

BibTeX:
@article{Giegerich1995, author = {R. Giegerich and S. Kurtz}, title = {A comparison of imperative and purely functional suffix tree constructions}, journal = {Sci. Comp. Program.}, year = {1995}, volume = {25}, number = {2--3}, pages = {187--218} } |
|||||

Giegerich, R. & Kurtz, S. | Suffix Trees in the Functional Programming Paradigm [BibTeX] |
1994 | Proceedings of the 5th European Symposium on Programming | inproceedings | |

BibTeX:
@inproceedings{Giegerich1994, author = {R. Giegerich and S. Kurtz}, title = {Suffix Trees in the Functional Programming Paradigm}, booktitle = {Proceedings of the 5th European Symposium on Programming}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {788}, pages = {225--240} } |
|||||

Giegerich, R. & Kurtz, S. | Suffix trees in the functional programming paradigm [BibTeX] |
1994 | Programming Languages and Systems | inproceedings | |

BibTeX:
@inproceedings{Giegerich1994a, author = {R. Giegerich and S. Kurtz}, title = {Suffix trees in the functional programming paradigm}, booktitle = {Programming Languages and Systems}, year = {1994}, pages = {225--240} } |
|||||

Giegerich, R., Kurtz, S., Hischke, F. & Ohlebusch, E. | A General Technique to Improve Filter Algorithms for Approximate String Matching [BibTeX] |
1997 | Proceedings of the 4th South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Giegerich1997a, author = {R. Giegerich and S. Kurtz and F. Hischke and E. Ohlebusch}, title = {A General Technique to Improve Filter Algorithms for Approximate String Matching}, booktitle = {Proceedings of the 4th South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1997}, pages = {38--52} } |
|||||

Giegerich, R., Kurtz, S. & Stoye, J. | Efficient implementation of lazy suffix trees [BibTeX] |
1999 | Proceedings of the 3rd Workshop on Algorithm Engineering | inproceedings | |

BibTeX:
@inproceedings{Giegerich1999, author = {R. Giegerich and S. Kurtz and J. Stoye}, title = {Efficient implementation of lazy suffix trees}, booktitle = {Proceedings of the 3rd Workshop on Algorithm Engineering}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1668}, pages = {30--42} } |
|||||

Gilbert, W. | Genome sequencing: Creating a new biology for the twenty--first century [BibTeX] |
1987 | Issues Sci. Tech. | article | |

BibTeX:
@article{Gilbert1987, author = {W. Gilbert}, title = {Genome sequencing: Creating a new biology for the twenty--first century}, journal = {Issues Sci. Tech.}, year = {1987}, volume = {3}, pages = {26--35} } |
|||||

Goad, W. B. & Kanehisa, M. I. | Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries [BibTeX] |
1982 | Nucleic Acids Res. | article | |

BibTeX:
@article{Goad1982, author = {W. B. Goad and M. I. Kanehisa}, title = {Pattern recognition in nucleic acid sequences. {I}. {A} general method for finding local homologies and symmetries}, journal = {Nucleic Acids Res.}, year = {1982}, volume = {10}, pages = {247--263} } |
|||||

Goeman, H. & Clausen, M. | A new practical linear space algorithm for the longest common subsequence problem [BibTeX] |
1999 | Proceedings of the Prague Stringology Club Workshop~'99 | inproceedings | |

BibTeX:
@inproceedings{Goeman1999, author = {H. Goeman and M. Clausen}, title = {A new practical linear space algorithm for the longest common subsequence problem}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'99}, year = {1999}, pages = {40--60}, note = {Collaborative Report DC--99--05} } |
|||||

Goldberg, L. A., Goldberg, P. W., Philipps, C. A., Sweedyk, E. & Warnow, T. | Minimizing phylogenetic number to find good evolutionary trees [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Goldberg1995, author = {L. A. Goldberg and P. W. Goldberg and C. A. Philipps and E. Sweedyk and T. Warnow}, title = {Minimizing phylogenetic number to find good evolutionary trees}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {102--127} } |
|||||

Goldberg, L. A., Goldberg, P. W., Phillip, C. A. & Sorkin, G. B. | Constructing Computer Virus Phylogenies [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Goldberg1996, author = {L. A. Goldberg and P. W. Goldberg and C. A. Phillip and G. B. Sorkin}, title = {Constructing Computer Virus Phylogenies}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {253--270} } |
|||||

Goldberg, R. N. | Minimal string difference encodings [BibTeX] |
1982 | J. Algorithms | article | |

BibTeX:
@article{Goldberg1982, author = {R. N. Goldberg}, title = {Minimal string difference encodings}, journal = {J. Algorithms}, year = {1982}, volume = {3}, number = {2}, pages = {147--156} } |
|||||

Goldberg, T. & Zwick, U. | Faster parallel string matching via larger deterministic samples [BibTeX] |
1994 | J. Algorithms | article | |

BibTeX:
@article{Goldberg1994, author = {T. Goldberg and U. Zwick}, title = {Faster parallel string matching via larger deterministic samples}, journal = {J. Algorithms}, year = {1994}, volume = {16}, number = {2}, pages = {295--308} } |
|||||

Goldwurm, M. | Random generation of words in an algebraic language in linear binary space [BibTeX] |
1995 | Inf. Process. Lett. | article | |

BibTeX:
@article{Goldwurm1995, author = {M. Goldwurm}, title = {Random generation of words in an algebraic language in linear binary space}, journal = {Inf. Process. Lett.}, year = {1995}, volume = {54}, number = {4}, pages = {229--233} } |
|||||

Golic, J. & Mihaljevic, M. | A noisy clock-controlled shift register cryptanalysis concept based on sequence comparison approach [BibTeX] |
1990 | Proceedings of the 7th EUROCRYPT | inproceedings | |

BibTeX:
@inproceedings{Golic1990, author = {J. Golic and M. Mihaljevic}, title = {A noisy clock-controlled shift register cryptanalysis concept based on sequence comparison approach}, booktitle = {Proceedings of the 7th EUROCRYPT}, publisher = {Springer-Verlag, Berlin}, year = {1990}, number = {473}, pages = {487--491} } |
|||||

Gonnet, G., Baeza-Yates, R. & Snider, T. | New Indices for Text: PAT trees and PAT arrays [BibTeX] |
1992 | Information Retrieval Data Structures & Algorithms | incollection | |

BibTeX:
@incollection{Gonnet1992, author = {G. Gonnet and R. Baeza-Yates and T. Snider}, title = {New Indices for Text: {PAT} trees and {PAT} arrays}, booktitle = {Information Retrieval Data Structures \& Algorithms }, publisher = {Prentice-Hall}, year = {1992} } |
|||||

Gonnet, G. H. | Efficient two-dimensional searching [BibTeX] |
1992 | Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory | inproceedings | |

BibTeX:
@inproceedings{Gonnet1992a, author = {G. H. Gonnet}, title = {Efficient two-dimensional searching}, booktitle = {Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {621}, pages = {317} } |
|||||

Gonnet, G. H. | A tutorial introduction to Computation Biochemistry using Darwin [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Gonnet1992b, author = {G. H. Gonnet}, title = {A tutorial introduction to Computation Biochemistry using Darwin}, year = {1992} } |
|||||

Gonnet, G. H. | Efficient searching of text and pictures [BibTeX] |
1988 | techreport | ||

BibTeX:
@techreport{Gonnet1988, author = {G. H. Gonnet}, title = {Efficient searching of text and pictures}, year = {1988}, number = {OED-88-02} } |
|||||

Gonnet, G. H. | The PAT text searching system [BibTeX] |
1987 | techreport | ||

BibTeX:
@techreport{Gonnet1987, author = {G. H. Gonnet}, title = {The {PAT} text searching system}, year = {1987} } |
|||||

Gonnet, G. H. | Unstructured data bases or very efficient text searching [BibTeX] |
1983 | Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems | inproceedings | |

BibTeX:
@inproceedings{Gonnet1983, author = {G. H. Gonnet}, title = {Unstructured data bases or very efficient text searching}, booktitle = {Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems}, publisher = {ACM Press}, year = {1983}, pages = {117--124} } |
|||||

Gonnet, G. H. & Baeza-Yates, R. A. | Handbook of Algorithms and Data Structures [BibTeX] |
1991 | book | ||

BibTeX:
@book{Gonnet1991, author = {G. H. Gonnet and R. A. Baeza-Yates}, title = {Handbook of Algorithms and Data Structures}, publisher = {Addison-Wesley}, year = {1991} } |
|||||

Gonnet, G. H. & Baeza-Yates, R. A. | Text algorithms [BibTeX] |
1991 | Handbook of Algorithms and Data Structures in Pascal and C | inbook | |

BibTeX:
@inbook{Gonnet1991a, author = {G. H. Gonnet and R. A. Baeza-Yates}, title = {Text algorithms}, booktitle = {Handbook of Algorithms and Data Structures in Pascal and C}, publisher = {Addison-Wesley}, year = {1991}, pages = {251--288}, edition = {Second} } |
|||||

Gonnet, G. H. & Baeza-Yates, R. A. | An analysis of the Karp-Rabin string matching algorithm [BibTeX] |
1990 | Inf. Process. Lett. | article | |

BibTeX:
@article{Gonnet1990, author = {G. H. Gonnet and R. A. Baeza-Yates}, title = {An analysis of the {Karp-Rabin} string matching algorithm}, journal = {Inf. Process. Lett.}, year = {1990}, volume = {34}, number = {5}, pages = {271--274} } |
|||||

Gonnet, G. H., Cohen, M. & Benner, S. | The all-against-all matching of a major protein sequence data base: reliable parameters for aligning sequences and scoring gaps [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Gonnet1991b, author = {G. H. Gonnet and M. Cohen and S. Benner}, title = {The all-against-all matching of a major protein sequence data base: reliable parameters for aligning sequences and scoring gaps}, year = {1991} } |
|||||

Gonnet, G. H. & Tompa, F. W. | Mind your grammar: a new approach to modelling text [BibTeX] |
1987 | Proceedings of the 13th International Conference on Very Large Data Bases | inproceedings | |

BibTeX:
@inproceedings{Gonnet1987a, author = {G. H. Gonnet and F. W. Tompa}, title = {Mind your grammar: a new approach to modelling text}, booktitle = {Proceedings of the 13th International Conference on Very Large Data Bases}, year = {1987}, pages = {339--346} } |
|||||

González, R. & Navarro, G. | Statistical Encoding of Succinct Data Structures [BibTeX] |
2006 | Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006) | inproceedings | |

BibTeX:
@inproceedings{Gonzalez2006, author = {R. Gonz\'{a}lez and G. Navarro}, title = {Statistical Encoding of Succinct Data Structures}, booktitle = {Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006)}, year = {2006}, pages = {295--306} } |
|||||

Goodrich, M. T. & Tamassia, R. | Data Structures and Algorithms in Java [BibTeX] |
1998 | book | ||

BibTeX:
@book{Goodrich1998, author = {M. T. Goodrich and R. Tamassia}, title = {Data Structures and Algorithms in Java}, publisher = {John Wiley \& Sons}, year = {1998} } |
|||||

Gotoh, O. | Homology-based Gene Structure Prediction: Simplified Matching Algorithm Using a Translated Codon (tron) and Improved Accuracy by Allowing for Long Gaps [BibTeX] |
2000 | Bioinformatics | article | |

BibTeX:
@article{Gotoh2000, author = {O. Gotoh}, title = {Homology-based Gene Structure Prediction: Simplified Matching Algorithm Using a Translated Codon (tron) and Improved Accuracy by Allowing for Long Gaps}, journal = {Bioinformatics}, year = {2000}, volume = {16}, number = {?}, pages = {?--?} } |
|||||

Gotoh, O. | Optimal Alignment between Groups of Sequences and its Application to Multiple Sequence Alignment [BibTeX] |
1993 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Gotoh1993, author = {O. Gotoh}, title = {Optimal Alignment between Groups of Sequences and its Application to Multiple Sequence Alignment}, journal = {Comput. Appl. Biosci.}, year = {1993}, volume = {9}, number = {3}, pages = {361--370} } |
|||||

Gotoh, O. | Consistency of optimal sequence alignments [BibTeX] |
1990 | Bull. Math. Biol. | article | |

BibTeX:
@article{Gotoh1990, author = {O. Gotoh}, title = {Consistency of optimal sequence alignments}, journal = {Bull. Math. Biol.}, year = {1990}, volume = {52}, pages = {509--525} } |
|||||

Gotoh, O. | Alignments of three biological sequences with an efficient trace-back procedure [BibTeX] |
1986 | J. Theor. Biol. | article | |

BibTeX:
@article{Gotoh1986, author = {O. Gotoh}, title = {Alignments of three biological sequences with an efficient trace-back procedure}, journal = {J. Theor. Biol.}, year = {1986}, volume = {121}, pages = {327--337} } |
|||||

Gotoh, O. | An improved algorithm for matching biological sequences [BibTeX] |
1982 | J. Mol. Biol. | article | |

BibTeX:
@article{Gotoh1982, author = {O. Gotoh}, title = {An improved algorithm for matching biological sequences}, journal = {J. Mol. Biol.}, year = {1982}, volume = {162}, pages = {705--708} } |
|||||

Grabowski, S., Mäkinen, V., Navarro, G. & Salinger, A. | A Simple Alphabet-Independent FM-Index [BibTeX] |
2005 | Proceedings of the 10th Prague Stringology Conference (PSC'05) | inproceedings | |

BibTeX:
@inproceedings{Grabowski2005, author = {Sz. Grabowski and V. M{\"a}kinen and G. Navarro and A. Salinger}, title = {A Simple Alphabet-Independent FM-Index}, booktitle = {Proceedings of the 10th Prague Stringology Conference (PSC'05)}, year = {2005}, pages = {230--244} } |
|||||

Grabowski, S., Navarro, G., Przywarski, R., Salinger, A. & Mäkinen, V. | A Simple Alphabet-Independent FM-Index [BibTeX] |
2006 | International Journal of Foundations of Computer Science (IJFCS) | article | |

BibTeX:
@article{Grabowski2006, author = {Sz. Grabowski and G. Navarro and R. Przywarski and A. Salinger and V. M{\"a}kinen}, title = {A Simple Alphabet-Independent {FM}-Index}, journal = {International Journal of Foundations of Computer Science (IJFCS)}, year = {2006}, volume = {17}, number = {6}, pages = {1365--1384} } |
|||||

Gries, D. & Burkhardt, B. | Presenting an Algorithm to Find the Minimum Edit Distance [BibTeX] |
1988 | techreport | ||

BibTeX:
@techreport{Gries1988, author = {D. Gries and B. Burkhardt}, title = {Presenting an Algorithm to Find the Minimum Edit Distance}, year = {1988}, number = {TR88-903} } |
|||||

Griggs, J., Halton, P., Odlyzko, A. & Waterman, M. S. | On the number of alignments of k sequences [BibTeX] |
1990 | Graphs Comb. | article | |

BibTeX:
@article{Griggs1990, author = {J. Griggs and P. Halton and A. Odlyzko and M. S. Waterman}, title = {On the number of alignments of {\emph{k}} sequences}, journal = {Graphs Comb.}, year = {1990}, volume = {6}, pages = {133--146} } |
|||||

Griggs, J., Halton, P. & Waterman, M. S. | Sequence alignments with matched sections [BibTeX] |
1986 | SIAM J. Algebr. Discret. Methods | article | |

BibTeX:
@article{Griggs1986, author = {J. Griggs and P. Halton and M. S. Waterman}, title = {Sequence alignments with matched sections}, journal = {SIAM J. Algebr. Discret. Methods}, year = {1986}, volume = {7}, pages = {604--608} } |
|||||

Griswold, R. E. | String scanning in the Icon programming language [BibTeX] |
1990 | Comput. J. | article | |

BibTeX:
@article{Griswold1990, author = {R. E. Griswold}, title = {String scanning in the {Icon} programming language}, journal = {Comput. J.}, year = {1990}, volume = {33}, number = {2} } |
|||||

Gross, M. | Constructing lexicon-grammars [BibTeX] |
1993 | Computational Approaches to the Lexicon | incollection | |

BibTeX:
@incollection{Gross1993, author = {M. Gross}, title = {Constructing lexicon-grammars}, booktitle = {Computational Approaches to the Lexicon}, publisher = {Oxford University Press}, year = {1993}, pages = {259--316} } |
|||||

Grossi, R. | On finding common subtrees [BibTeX] |
1993 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Grossi1993, author = {R. Grossi}, title = {On finding common subtrees}, journal = {Theor. Comput. Sci.}, year = {1993}, volume = {108}, number = {2}, pages = {345--356} } |
|||||

Grossi, R. | A fast VLSI solution for the approximate string matching [BibTeX] |
1992 | Integr., The VLSI J. | article | |

BibTeX:
@article{Grossi1992, author = {R. Grossi}, title = {A fast {VLSI} solution for the approximate string matching}, journal = {Integr., The VLSI J.}, year = {1992}, volume = {13}, number = {2}, pages = {195--206} } |
|||||

Grossi, R. & Luccio, F. | Simple and efficient string matching with k mismatches [BibTeX] |
1989 | Inf. Process. Lett. | article | |

BibTeX:
@article{Grossi1989, author = {R. Grossi and F. Luccio}, title = {Simple and efficient string matching with {\emph{k}} mismatches}, journal = {Inf. Process. Lett.}, year = {1989}, volume = {33}, number = {3}, pages = {113--120} } |
|||||

Grossi, R. & Vitter, J. S. | Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching [BibTeX] |
2000 | Proceedings ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Grossi2000, author = {R. Grossi and J. S. Vitter}, title = {Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching}, booktitle = {Proceedings ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {2000}, pages = {397--406} } |
|||||

Gräf, A. | Left-to-right tree pattern matching [BibTeX] |
1991 | RTA | inproceedings | |

BibTeX:
@inproceedings{Graf1991, author = {A. Gr{\"a}f}, title = {Left-to-right tree pattern matching}, booktitle = {RTA}, publisher = {Springer-Verlag, Berlin}, year = {1991}, number = {488}, pages = {323--334} } |
|||||

Gu, M., Farach, M. & Beigel, R. | An Efficient Algorithm for Dynamic Text Indexing [BibTeX] |
1994 | Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Gu1994, author = {M. Gu and M. Farach and R. Beigel}, title = {An Efficient Algorithm for Dynamic Text Indexing}, booktitle = {Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1994}, pages = {697--704} } |
|||||

Gua, Q., Penga, S. & Sudboroughb, H. | A 2-approximation algorithm for genome rearrangements by reversals and transpositions [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Gua1999, author = {Q.-P. Gua and S. Penga and H. Sudboroughb}, title = {A 2-approximation algorithm for genome rearrangements by reversals and transpositions}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {210}, number = {2}, pages = {327--339} } |
|||||

Guibas, L. | Periodicities in strings [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@incollection{Guibas1985, author = {L. Guibas}, title = {Periodicities in strings}, booktitle = {Combinatorial Algorithms on Words}, publisher = {Springer-Verlag, Berlin}, year = {1985}, pages = {257--269} } |
|||||

Guibas, L. J. & Odlyzko, A. M. | Periods in strings [BibTeX] |
1981 | J. Comb. Theory Ser. A | article | |

BibTeX:
@article{Guibas1981, author = {L. J. Guibas and A. M. Odlyzko}, title = {Periods in strings}, journal = {J. Comb. Theory Ser. A}, year = {1981}, volume = {30}, pages = {19--43} } |
|||||

Guibas, L. J. & Odlyzko, A. M. | String overlaps, pattern matching and nontransitive games [BibTeX] |
1981 | J. Comb. Theory Ser. A | article | |

BibTeX:
@article{Guibas1981a, author = {L. J. Guibas and A. M. Odlyzko}, title = {String overlaps, pattern matching and nontransitive games}, journal = {J. Comb. Theory Ser. A}, year = {1981}, volume = {30}, pages = {183--208} } |
|||||

Guibas, L. J. & Odlyzko, A. M. | A new proof of the linearity of the Boyer-Moore string searching algorithm [BibTeX] |
1980 | SIAM J. Comput. | article | |

BibTeX:
@article{Guibas1980, author = {L. J. Guibas and A. M. Odlyzko}, title = {A new proof of the linearity of the {Boyer-Moore} string searching algorithm}, journal = {SIAM J. Comput.}, year = {1980}, volume = {9}, number = {4}, pages = {672--682} } |
|||||

Guibas, L. J. & Odlyzko, A. M. | A new proof of the linearity of the Boyer-Moore string searching algorithm [BibTeX] |
1977 | Proceedings of the 18th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Guibas1977, author = {L. J. Guibas and A. M. Odlyzko}, title = {A new proof of the linearity of the {Boyer-Moore} string searching algorithm}, booktitle = {Proceedings of the 18th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1977}, pages = {189--195} } |
|||||

Guimarães, K. & Melo, J. | String alignment and approximate matching [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Guimaraes1996, author = {K. Guimar{\~a}es and J. Melo}, title = {String alignment and approximate matching}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {85--100} } |
|||||

Guimarães, K. & Melo, J. | String alignment and approximate matching [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Guimaraes1996a, author = {K. Guimar{\~a}es and J. Melo}, title = {String alignment and approximate matching}, year = {1996}, number = {TR-005/96} } |
|||||

Gupta, S. K., Kececioglu, J. D. & Schäffer, A. A. | Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gupta1995, author = {S. K. Gupta and J. D. Kececioglu and A. A. Sch{\"a}ffer}, title = {Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {128--143} } |
|||||

Gusfield, D. | Algorithms on strings, trees and sequences: computer science and computational biology [BibTeX] |
1997 | book | ||

BibTeX:
@book{Gusfield1997, author = {D. Gusfield}, title = {Algorithms on strings, trees and sequences: computer science and computational biology}, publisher = {Cambridge University Press}, year = {1997} } |
|||||

Gusfield, D. | Faster implementation of a shortest superstring approximation [BibTeX] |
1994 | Inf. Process. Lett. | article | |

BibTeX:
@article{Gusfield1994, author = {D. Gusfield}, title = {Faster implementation of a shortest superstring approximation}, journal = {Inf. Process. Lett.}, year = {1994}, volume = {51}, number = {5}, pages = {271--274} } |
|||||

Gusfield, D. | Efficient methods for multiple sequence alignment with guaranteed error bounds [BibTeX] |
1993 | Bull. Math. Biol. | article | |

BibTeX:
@article{Gusfield1993, author = {D. Gusfield}, title = {Efficient methods for multiple sequence alignment with guaranteed error bounds}, journal = {Bull. Math. Biol.}, year = {1993}, volume = {55}, number = {1}, pages = {141--154} } |
|||||

Gusfield, D. | Efficient method for multiple sequence alignment with guaranteed error bounds [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Gusfield1991, author = {D. Gusfield}, title = {Efficient method for multiple sequence alignment with guaranteed error bounds}, year = {1991}, number = {CSE-91-4} } |
|||||

Gusfield, D., Balasubramanian, K. & Naor, D. | Parametric Optimization of Sequence Alignment [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@article{Gusfield1994a, author = {D. Gusfield and K. Balasubramanian and D. Naor}, title = {Parametric Optimization of Sequence Alignment}, journal = {Algorithmica}, year = {1994}, volume = {12}, number = {4/5}, pages = {312--326} } |
|||||

Gusfield, D., Balasubramanian, K. & Naor, D. | Parametric optimization of sequence alignment [BibTeX] |
1992 | Proceedings of the 3rd ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Gusfield1992, author = {D. Gusfield and K. Balasubramanian and D. Naor}, title = {Parametric optimization of sequence alignment}, booktitle = {Proceedings of the 3rd ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1992}, pages = {432--439} } |
|||||

Gusfield, D., Karp, R. M., Wang, L. & Stelling, P. | Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gusfield1996, author = {D. Gusfield and R. M. Karp and L. Wang and P. Stelling}, title = {Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {304--319} } |
|||||

Gusfield, D., Landau, G. & Schieber, B. | An efficient algorithm for all the pairs suffix-prefix problem [BibTeX] |
1992 | Inf. Process. Lett. | article | |

BibTeX:
@article{Gusfield1992a, author = {D. Gusfield and G. Landau and B. Schieber}, title = {An efficient algorithm for all the pairs suffix-prefix problem}, journal = {Inf. Process. Lett.}, year = {1992}, volume = {41}, number = {4}, pages = {181--185} } |
|||||

Gutiérrez, C. | Solving Equations in Strings: On Makanin's Algorithm [BibTeX] |
1998 | Proceedings of the 3rd Latin American Symposium | inproceedings | |

BibTeX:
@inproceedings{Guti'errez1998, author = {C. Guti{\'e}rrez}, title = {Solving Equations in Strings: On {Makanin}'s Algorithm}, booktitle = {Proceedings of the 3rd Latin American Symposium}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1380}, pages = {358--373} } |
|||||

Gutiérrez, G., Navarro, G., Rodríguez, A., González, A. & Orellana, J. | A Spatio-Temporal Access Method based on Snapshots and Events [BibTeX] |
2005 | Proceedings of the 13th ACM International Symposium on Advances in Geographic Information Systems (GIS'05) | inproceedings | |

BibTeX:
@inproceedings{Gutierrez2005, author = {G. Guti{\'{e}}rrez and G. Navarro and A. Rodr{\'{i}}guez and A. Gonz{\'{a}}lez and J. Orellana}, title = {A Spatio-Temporal Access Method based on Snapshots and Events}, booktitle = {Proceedings of the 13th {ACM} International Symposium on Advances in Geographic Information Systems (GIS'05)}, publisher = {ACM Press}, year = {2005}, pages = {115--124} } |
|||||

Guénoche, A. & Vitte, P. | Distances entre chaines de caractères par un algorithme sous-linéaire en place mémoire [BibTeX] |
1992 | Proceedings Distancia | inproceedings | |

BibTeX:
@inproceedings{Gu'enoche1992, author = {A. Gu{\'e}noche and P. Vitte}, title = {Distances entre cha{\^\i}nes de caract{\`e}res par un algorithme sous-lin{\'e}aire en place m{\'e}moire}, booktitle = {Proceedings Distancia}, year = {1992} } |
|||||

Gwangsoo, R. | An approximation algorithm for the reversible shortest common superstring problem [BibTeX] |
1994 | Journal of the Korea Information Science Society | article | |

BibTeX:
@article{Gwangsoo1994, author = {R. Gwangsoo}, title = {An approximation algorithm for the reversible shortest common superstring problem}, journal = {Journal of the Korea Information Science Society}, year = {1994}, volume = {21}, number = {7}, pages = {1261--1268}, note = {In Korean} } |
|||||

Gasieniec, L., Indyk, P. & Krysta, P. | External inverse pattern matching [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gc1997, author = {L. G{\c a}sieniec and P. Indyk and P. Krysta}, title = {External inverse pattern matching}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {90--101} } |
|||||

Gasieniec, L., Karpinski, M., Plandowski, W. & Rytter, W. | Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract) [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gc1996, author = {L. G{\c a}sieniec and M. Karpinski and W. Plandowski and W. Rytter}, title = {Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {39--49} } |
|||||

Gasieniec, L. & Park, K. | Work-time optimal parallel prefix matching [BibTeX] |
1994 | Proceedings of the 2nd Annual European Symposium | inproceedings | |

BibTeX:
@inproceedings{Gc1994, author = {L. G{\c a}sieniec and K. Park}, title = {Work-time optimal parallel prefix matching}, booktitle = {Proceedings of the 2nd Annual European Symposium}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {855}, pages = {471--482} } |
|||||

Gasieniec, L., Plandowski, W. & Rytter, W. | Constant-space string matching with smaller number of comparisons: sequential sampling [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gc1995, author = {L. G{\c a}sieniec and W. Plandowski and W. Rytter}, title = {Constant-space string matching with smaller number of comparisons: sequential sampling}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {78--89} } |
|||||

Gasieniec, L., Plandowski, W. & Rytter, W. | The zooming method: a recursive approach to time-space efficient string-matching [BibTeX] |
1995 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Gc1995a, author = {L. G{\c a}sieniec and W. Plandowski and W. Rytter}, title = {The zooming method: a recursive approach to time-space efficient string-matching}, journal = {Theor. Comput. Sci.}, year = {1995}, volume = {147}, number = {1--2}, pages = {19--30} } |
|||||

Gasieniec, L. & Rytter, W. | Searching patterns with short variables [BibTeX] |
1999 | Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Gc1999, author = {L. G{\c a}sieniec and W. Rytter}, title = {Searching patterns with short variables}, booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms}, year = {1999}, pages = {145--151} } |
|||||

Gsieniec, L., Jansson, J. & Lingas, A. | Approximation Algorithms for Hamming Clustering Problems [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Gc2000, author = {L. G{\c{a}}sieniec and J. Jansson and A. Lingas}, title = {Approximation Algorithms for Hamming Clustering Problems}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {108--118} } |
|||||

Hagerup, T. | Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum [BibTeX] |
1994 | Proceedings of the 26th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Hagerup1994, author = {T. Hagerup}, title = {Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum}, booktitle = {Proceedings of the 26th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1994}, pages = {382--391} } |
|||||

Hagerup, T. | Optimal Parallel String Algorithms: Sorting, Merging and Computing the Minimum [BibTeX] |
1993 | techreport | ||

BibTeX:
@techreport{Hagerup1993, author = {T. Hagerup}, title = {Optimal Parallel String Algorithms: Sorting, Merging and Computing the Minimum}, year = {1993}, number = {MPI-I-93-152} } |
|||||

Hai, L. C. K. | Color set size problem with applications to string matching [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hai1992, author = {L. C. K. Hai}, title = {Color set size problem with applications to string matching}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {230--243} } |
|||||

Hakonen, H., Kaukoranta, T. & Raita, T. | A comparison of longest common subsequence algorithms [BibTeX] |
1996 | unpublished | ||

BibTeX:
@unpublished{Hakonen1996, author = {H. Hakonen and T. Kaukoranta and T. Raita}, title = {A comparison of longest common subsequence algorithms}, year = {1996}, note = {University of Turku, Finland} } |
|||||

Hakonen, H. & Raita, T. | A Family of Fast Constant-Space Substring Search Algorithms [BibTeX] |
1999 | Acta Cybernetica | article | |

BibTeX:
@article{Hakonen1999, author = {H. Hakonen and T. Raita}, title = {A Family of Fast Constant-Space Substring Search Algorithms}, journal = {Acta Cybernetica}, year = {1999}, volume = {14}, number = {2}, pages = {239--250} } |
|||||

Hakuta, K. & Imai, H. | The longest common subsequence problem for small alphabet size between many strings [BibTeX] |
1992 | Proceedings of the 3rd International Symposium on Algorithms and Computation | inproceedings | |

BibTeX:
@inproceedings{Hakuta1992, author = {K. Hakuta and H. Imai}, title = {The longest common subsequence problem for small alphabet size between many strings}, booktitle = {Proceedings of the 3rd International Symposium on Algorithms and Computation}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {650}, pages = {469--478} } |
|||||

Halaas, A. | A systolic VLSI matrix for a family of fundamental search problem [BibTeX] |
1983 | Integr., The VLSI J. | article | |

BibTeX:
@article{Halaas1983, author = {A. Halaas}, title = {A systolic {VLSI} matrix for a family of fundamental search problem}, journal = {Integr., The VLSI J.}, year = {1983}, volume = {1}, number = {4}, pages = {269--282} } |
|||||

Hall, P. A. V. & Dowling, G. R. | Approximate string matching [BibTeX] |
1980 | ACM Comp. Surv. | article | |

BibTeX:
@article{Hall1980, author = {P. A. V. Hall and G. R. Dowling}, title = {Approximate string matching}, journal = {ACM Comp. Surv.}, year = {1980}, volume = {12}, number = {4}, pages = {381--402} } |
|||||

Hamilton, E. | Expanded generalized regular expression [BibTeX] |
1988 | Commun. ACM | article | |

BibTeX:
@article{Hamilton1988, author = {E. Hamilton}, title = {Expanded generalized regular expression}, journal = {Commun. ACM}, year = {1988}, volume = {31}, number = {12}, pages = {1376--1385} } |
|||||

Hamming, R. W. | Hamming Distance and Its Discovery [BibTeX] |
1993 | UMAP: The Journal of Undergraduate Mathematics and its Applications | article | |

BibTeX:
@article{Hamming1993, author = {R. W. Hamming}, title = {Hamming Distance and Its Discovery}, journal = {UMAP: The Journal of Undergraduate Mathematics and its Applications}, year = {1993}, volume = {14} } |
|||||

Hamming, R. W. | Coding and information theory [BibTeX] |
1982 | book | ||

BibTeX:
@book{Hamming1982, author = {R. W. Hamming}, title = {Coding and information theory}, publisher = {Prentice Hall}, year = {1982} } |
|||||

Hamming, R. W. | Error detecting and error correcting codes [BibTeX] |
1950 | The Bell System Technical Journal | article | |

BibTeX:
@article{Hamming1950, author = {R. W. Hamming}, title = {Error detecting and error correcting codes}, journal = {The Bell System Technical Journal}, year = {1950}, volume = {29}, number = {2}, pages = {147--160} } |
|||||

Hancart, C. | Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif [BibTeX] |
1994 | Bull. Belg. Math. Soc. | article | |

BibTeX:
@article{Hancart1994, author = {C. Hancart}, title = {Des bornes exactes de la complexit{\'e} des algorithmes s{\'e}quentiels de recherche d'un motif}, journal = {Bull. Belg. Math. Soc.}, year = {1994}, volume = {1}, number = {2}, pages = {239--252} } |
|||||

Hancart, C. | Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte [BibTeX] |
1993 | School: Université Paris 7 |
phdthesis | |

BibTeX:
@phdthesis{Hancart1993, author = {C. Hancart}, title = {Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte}, school = {Universit{\'e} Paris 7}, year = {1993} } |
|||||

Hancart, C. | Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte [BibTeX] |
1993 | techreport | ||

BibTeX:
@techreport{Hancart1993a, author = {C. Hancart}, title = {Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte}, year = {1993}, number = {93-11} } |
|||||

Hancart, C. | On Simon's string searching algorithm [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@article{Hancart1993b, author = {C. Hancart}, title = {On {Simon}'s string searching algorithm}, journal = {Inf. Process. Lett.}, year = {1993}, volume = {47}, number = {2}, pages = {95--99} } |
|||||

Hancart, C. | Une analyse en moyenne de l'algorithme de Morris et Pratt et de ses raffinements [BibTeX] |
1991 | Actes des 2e Journées franco-belges: Théories des Automates et Applications | inproceedings | |

BibTeX:
@inproceedings{Hancart1991, author = {C. Hancart}, title = {Une analyse en moyenne de l'algorithme de {Morris} et {Pratt} et de ses raffinements}, booktitle = {Actes des 2e Journ{\'e}es franco-belges: Th{\'e}ories des Automates et Applications}, year = {1991}, number = {176}, pages = {99--110} } |
|||||

Hancart, C. | Algorithme de Morris et Pratt et ses raffinements : une analyse en moyenne [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Hancart1991a, author = {C. Hancart}, title = {Algorithme de {Morris} et {Pratt} et ses raffinements : une analyse en moyenne}, year = {1991}, number = {LITP 91.56} } |
|||||

Hancart, C. | Sur l'analyse en moyenne des algorithmes de recherche d'un mot dans un texte [BibTeX] |
1990 | School: CERIL, Université Paris 7 |
mastersthesis | |

BibTeX:
@mastersthesis{Hancart1990, author = {C. Hancart}, title = {Sur l'analyse en moyenne des algorithmes de recherche d'un mot dans un texte}, school = {CERIL, Universit{\'e} Paris 7}, year = {1990}, pages = {1--50} } |
|||||

Hanks, L., Cytron, R. K. & Gillett, W. | An efficient algorithm for developing topologically valid matchings [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hanks1995, author = {L. Hanks and R. K. Cytron and W. Gillett}, title = {An efficient algorithm for developing topologically valid matchings}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {144--161} } |
|||||

Hannenhalli, S. | Polynomial-time algorithm for computing translocation distance between genomes [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hannenhalli1995, author = {S. Hannenhalli}, title = {Polynomial-time algorithm for computing translocation distance between genomes}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {162--176} } |
|||||

Hannenhalli, S. & Pevzner, P. A. | Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals [BibTeX] |
1999 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Hannenhalli1999, author = {S. Hannenhalli and P. A. Pevzner}, title = {Transforming cabbage into turnip: {P}olynomial algorithm for sorting signed permutations by reversals}, journal = {J. Assoc. Comput. Mach.}, year = {1999}, volume = {46}, number = {1}, pages = {1--27} } |
|||||

Hanson, D. | Literate Programming -- Printing common words [BibTeX] |
1987 | Commun. ACM | article | |

BibTeX:
@article{Hanson1987, author = {D. Hanson}, title = {Literate Programming -- Printing common words}, journal = {Commun. ACM}, year = {1987}, volume = {30}, number = {7}, pages = {594--599} } |
|||||

Harel, D. & Tarjan, R. E. | Fast algorithms for finding nearest common ancestors [BibTeX] |
1984 | SIAM J. Comput. | article | |

BibTeX:
@article{Harel1984, author = {D. Harel and R. E. Tarjan}, title = {Fast algorithms for finding nearest common ancestors}, journal = {SIAM J. Comput.}, year = {1984}, volume = {13}, number = {2}, pages = {338--355} } |
|||||

Hariharan, R. | Optimal Parallel Suffix Tree Construction [BibTeX] |
1997 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Hariharan1997, author = {R. Hariharan}, title = {Optimal Parallel Suffix Tree Construction}, journal = {J. Comput. Syst. Sci.}, year = {1997}, volume = {55}, number = {1}, pages = {44--69} } |
|||||

Hariharan, R. | Optimal Parallel Suffix Tree Construction [BibTeX] |
1994 | Proceedings of the 26th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Hariharan1994, author = {R. Hariharan}, title = {Optimal Parallel Suffix Tree Construction}, booktitle = {Proceedings of the 26th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1994}, pages = {290--299} } |
|||||

Harrison, M. C. | Implementation of the substring test by hashing [BibTeX] |
1971 | Commun. ACM | article | |

BibTeX:
@article{Harrison1971, author = {M. C. Harrison}, title = {Implementation of the substring test by hashing}, journal = {Commun. ACM}, year = {1971}, volume = {14}, number = {12}, pages = {777--779} } |
|||||

Hart, W. E. & Istrail, S. | Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract) [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hart1996, author = {W. E. Hart and S. Istrail}, title = {Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {288--303} } |
|||||

Hartman, A. & Rodeh, M. | Optimal sparsing of strings [BibTeX] |
1985 | Combinatorial Algorithms on Words | incollection | |

BibTeX:
@incollection{Hartman1985, author = {A. Hartman and M. Rodeh}, title = {Optimal sparsing of strings}, booktitle = {Combinatorial Algorithms on Words}, publisher = {Springer-Verlag, Berlin}, year = {1985}, volume = {12}, pages = {155--167} } |
|||||

Hashiguchi, K. & Yamada, K. | Two recognizable string-matching problems over free partially commutative monoids [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Hashiguchi1992, author = {K. Hashiguchi and K. Yamada}, title = {Two recognizable string-matching problems over free partially commutative monoids}, journal = {Theor. Comput. Sci.}, year = {1992}, volume = {92}, number = {1}, pages = {77--86} } |
|||||

Hashigushi, K. & Yamada, K. | String matching problems over free partially commutative monoid [BibTeX] |
1992 | Inf. Comput. | article | |

BibTeX:
@article{Hashigushi1992, author = {K. Hashigushi and K. Yamada}, title = {String matching problems over free partially commutative monoid}, journal = {Inf. Comput.}, year = {1992}, volume = {101}, number = {2}, pages = {131--149} } |
|||||

Haskins, R. L. | Special purpose processors for text retrieval [BibTeX] |
1981 | Database Eng. | article | |

BibTeX:
@article{Haskins1981, author = {R. L. Haskins}, title = {Special purpose processors for text retrieval}, journal = {Database Eng.}, year = {1981}, volume = {4}, number = {1}, pages = {16--29} } |
|||||

Haskins, R. L. | Hardware for searching very large text data-bases [BibTeX] |
1980 | Proceedings of the 5th Workshop on Computer Architecture for Non-numeric Processing | inproceedings | |

BibTeX:
@inproceedings{Haskins1980, author = {R. L. Haskins}, title = {Hardware for searching very large text data-bases}, booktitle = {Proceedings of the 5th Workshop on Computer Architecture for Non-numeric Processing}, year = {1980}, pages = {?--?} } |
|||||

Haskins, R. L. & Hollaar, L. A. | Operational characteristics of a hardware-based pattern matcher [BibTeX] |
1983 | ACM Trans. Database Syst. | article | |

BibTeX:
@article{Haskins1983, author = {R. L. Haskins and L. A. Hollaar}, title = {Operational characteristics of a hardware-based pattern matcher}, journal = {ACM Trans. Database Syst.}, year = {1983}, volume = {8}, number = {1}, pages = {15--40} } |
|||||

Hatcher, P. J. & Cristopher, T. W. | High quality code generation via bottom up trie pattern matching [BibTeX] |
1986 | Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages | inproceedings | |

BibTeX:
@inproceedings{Hatcher1986, author = {P. J. Hatcher and T. W. Cristopher}, title = {High quality code generation via bottom up trie pattern matching}, booktitle = {Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages}, year = {1986}, pages = {119--130} } |
|||||

Haton, J. P. | Contribution à l'analyse, paramétrisation et la reconnaissance automatique de la parole [BibTeX] |
1973 | School: Université de Nancy, France |
phdthesis | |

BibTeX:
@phdthesis{Haton1973, author = {J. P. Haton}, title = {Contribution {\`a} l'analyse, param{\'e}trisation et la reconnaissance automatique de la parole}, school = {Universit{\'e} de Nancy, France}, year = {1973} } |
|||||

Havas, G. & Lian, J. | A New Problem in String Searching [BibTeX] |
1994 | Proceedings of the 5th International Symposium on Algorithms and Computation | inproceedings | |

BibTeX:
@inproceedings{Havas1994, author = {G. Havas and J.-X. Lian}, title = {A New Problem in String Searching}, booktitle = {Proceedings of the 5th International Symposium on Algorithms and Computation}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {834}, pages = {660--668} } |
|||||

Heaps, H. S. | Information retrieval: theoretical and computational aspects [BibTeX] |
1978 | book | ||

BibTeX:
@book{Heaps1978, author = {H. S. Heaps}, title = {Information retrieval: theoretical and computational aspects}, publisher = {Academic Press}, year = {1978} } |
|||||

Heckel, P. | A technique for isolating differences between files [BibTeX] |
1978 | Commun. ACM | article | |

BibTeX:
@article{Heckel1978, author = {P. Heckel}, title = {A technique for isolating differences between files}, journal = {Commun. ACM}, year = {1978}, volume = {21}, number = {4}, pages = {264--268} } |
|||||

Hein, J. | Unified approach to alignment and phylogenies [BibTeX] |
1990 | Methods Enzymol. | article | |

BibTeX:
@article{Hein1990, author = {J. Hein}, title = {Unified approach to alignment and phylogenies}, journal = {Methods Enzymol.}, year = {1990}, volume = {183}, pages = {626--645} } |
|||||

Hein, J. | A new method that simultaneously aligns and reconstruct ancestral sequences for any number of homologous sequences, when the phylogeny is given [BibTeX] |
1989 | Mol. Biol. Evol. | article | |

BibTeX:
@article{Hein1989, author = {J. Hein}, title = {A new method that simultaneously aligns and reconstruct ancestral sequences for any number of homologous sequences, when the phylogeny is given}, journal = {Mol. Biol. Evol.}, year = {1989}, volume = {6}, pages = {649--668} } |
|||||

Hein, J., Jiang, T., Wang, L. & Zhang, K. | On the complexity of comparing evolutionary trees [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hein1995, author = {J. Hein and T. Jiang and L. Wang and K. Zhang}, title = {On the complexity of comparing evolutionary trees}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {177--190} } |
|||||

Held, G. | Data Compression - Techniques and Applications, Hardware and Software Considerations [BibTeX] |
1987 | book | ||

BibTeX:
@book{Held1987, author = {G. Held}, title = {Data Compression - Techniques and Applications, Hardware and Software Considerations}, publisher = {John Wiley {\&} Sons}, year = {1987} } |
|||||

Held, J. P. & Carlis, J. V. | MATCH -- A New High-Level Relational Operator for Pattern Matching [BibTeX] |
1987 | Commun. ACM | article | |

BibTeX:
@article{Held1987a, author = {J. P. Held and J. V. Carlis}, title = {{MATCH} -- {A} New High-Level Relational Operator for Pattern Matching}, journal = {Commun. ACM}, year = {1987}, volume = {30}, number = {1}, pages = {62--75} } |
|||||

Held, M. & Karp, R. M. | A dynamic programming approach to sequencing problems [BibTeX] |
1962 | SIAM J. Appl. Math. | article | |

BibTeX:
@article{Held1962, author = {M. Held and R. M. Karp}, title = {A dynamic programming approach to sequencing problems}, journal = {SIAM J. Appl. Math.}, year = {1962}, volume = {10}, pages = {196--210} } |
|||||

Henneke, C. M. | A multiple sequence alignment algorithm for homologous proteins using secondary structure information and optionally keying alignments to functionally important sites [BibTeX] |
1989 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Henneke1989, author = {C. M. Henneke}, title = {A multiple sequence alignment algorithm for homologous proteins using secondary structure information and optionally keying alignments to functionally important sites}, journal = {Comput. Appl. Biosci.}, year = {1989}, volume = {5}, pages = {141--150} } |
|||||

Herrmannsfeldt, G. | A highly parallel finite state automaton processor for biological pattern matching [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@inproceedings{Herrmannsfeldt1998, author = {G. Herrmannsfeldt}, title = {A highly parallel finite state automaton processor for biological pattern matching}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'98}, year = {1998}, pages = {58--72}, note = {Collaborative Report DC--98--06} } |
|||||

Hertz, G. Z. & Stormo, G. D. | Identifying DNA and protein patterns with statistically sign ificant alignments of multiple sequences [BibTeX] |
1999 | Bioinformatics | article | |

BibTeX:
@article{Hertz1999, author = {G. Z. Hertz and G. D. Stormo}, title = {Identifying {DNA} and protein patterns with statistically sign ificant alignments of multiple sequences}, journal = {Bioinformatics}, year = {1999}, volume = {15}, pages = {563--577} } |
|||||

Herz, J. & Hersch, R. D. | Analysing Character Shapes by String Matching Techniques [BibTeX] |
1993 | Electronic Publishing | article | |

BibTeX:
@article{Herz1993, author = {J. Herz and R. D. Hersch}, title = {Analysing Character Shapes by String Matching Techniques}, journal = {Electronic Publishing}, year = {1993}, volume = {6}, number = {3}, pages = {261--272} } |
|||||

Hester, J. H. & Hirschberg, D. S. | Self-organizing linear search [BibTeX] |
1985 | ACM Comp. Surv. | article | |

BibTeX:
@article{Hester1985, author = {J. H. Hester and D. S. Hirschberg}, title = {Self-organizing linear search}, journal = {ACM Comp. Surv.}, year = {1985}, volume = {17}, pages = {295--311} } |
|||||

Heumann, K. & Mewes, H. | The Hashes Position Tree (HPT): a suffix tree variant for large data sets stored on slow mass storage devices [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Heumann1996, author = {K. Heumann and H.-W. Mewes}, title = {{The Hashes Position Tree (HPT): a suffix tree variant for large data sets stored on slow mass storage devices}}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {101--114} } |
|||||

Hickey, T. & Cohen, J. | Uniform random generation of strings in acontext-free language [BibTeX] |
1983 | SIAM J. Comput. | article | |

BibTeX:
@article{Hickey1983, author = {T. Hickey and J. Cohen}, title = {Uniform random generation of strings in acontext-free language}, journal = {SIAM J. Comput.}, year = {1983}, volume = {12}, number = {4}, pages = {645--655} } |
|||||

Higgins, D. G., Bleasby, A. J. & Fuchs, R. | CLUSTAL V: improved software for multiple sequence alignment [BibTeX] |
1992 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Higgins1992, author = {D. G. Higgins and A. J. Bleasby and R. Fuchs}, title = {{CLUSTAL} {V}: improved software for multiple sequence alignment}, journal = {Comput. Appl. Biosci.}, year = {1992}, volume = {8}, number = {2}, pages = {189--191} } |
|||||

Higgins, D. G. & Sharp, P. M. | Fast and sensitive multiple sequence alignments on a microcomputer [BibTeX] |
1989 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Higgins1989, author = {D. G. Higgins and P. M. Sharp}, title = {Fast and sensitive multiple sequence alignments on a microcomputer}, journal = {Comput. Appl. Biosci.}, year = {1989}, volume = {5}, pages = {151--153} } |
|||||

Higgins, D. G. & Sharp, P. M. | CLUSTAL: a package for performing multiple sequence alignment on a microcomputer [BibTeX] |
1988 | Gene | article | |

BibTeX:
@article{Higgins1988, author = {D. G. Higgins and P. M. Sharp}, title = {{CLUSTAL}: a package for performing multiple sequence alignment on a microcomputer}, journal = {Gene}, year = {1988}, volume = {73}, pages = {237--244} } |
|||||

Hirata, M., Yamada, H., Nagai, H. & Takahashi, K. | A versatile data string-search VLSI [BibTeX] |
1988 | IEEE J. Solid-State Circuits | article | |

BibTeX:
@article{Hirata1988, author = {M. Hirata and H. Yamada and H. Nagai and K. Takahashi}, title = {A versatile data string-search {VLSI}}, journal = {IEEE J. Solid-State Circuits}, year = {1988}, volume = {23}, number = {2}, pages = {329--335} } |
|||||

Hirata, M., Yamada, H., Nagai, H. & Takahashi, K. | A versatile data string-search VLSI [BibTeX] |
1987 | Proceedings of the IEEE Custom Integrated Circuits Conference | inproceedings | |

BibTeX:
@inproceedings{Hirata1987, author = {M. Hirata and H. Yamada and H. Nagai and K. Takahashi}, title = {A versatile data string-search {VLSI}}, booktitle = {Proceedings of the IEEE Custom Integrated Circuits Conference}, year = {1987}, pages = {563--566} } |
|||||

Hirschberg, D. S. | Bounds on the Number of String Subsequences [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hirschberg1999, author = {D. S. Hirschberg}, title = {Bounds on the Number of String Subsequences}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {115--122} } |
|||||

Hirschberg, D. S. | Serial computations of Levenshtein distances [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@incollection{Hirschberg1997, author = {D. S. Hirschberg}, title = {Serial computations of {Levenshtein} distances}, booktitle = {Pattern matching algorithms}, publisher = {Oxford University Press}, year = {1997}, pages = {123--141} } |
|||||

Hirschberg, D. S. | Recent results on the complexity of common subsequence problems [BibTeX] |
1983 | Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison | incollection | |

BibTeX:
@incollection{Hirschberg1983, author = {D. S. Hirschberg}, title = {Recent results on the complexity of common subsequence problems}, booktitle = {Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison}, publisher = {Addison-Wesley}, year = {1983}, pages = {325--330} } |
|||||

Hirschberg, D. S. | An information-theoretic lower bound for the longest common subsequence problem [BibTeX] |
1978 | Inf. Process. Lett. | article | |

BibTeX:
@article{Hirschberg1978, author = {D. S. Hirschberg}, title = {An information-theoretic lower bound for the longest common subsequence problem}, journal = {Inf. Process. Lett.}, year = {1978}, volume = {7}, number = {1}, pages = {40--41} } |
|||||

Hirschberg, D. S. | Algorithms for the longest common subsequence problem [BibTeX] |
1977 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Hirschberg1977, author = {D. S. Hirschberg}, title = {Algorithms for the longest common subsequence problem}, journal = {J. Assoc. Comput. Mach.}, year = {1977}, volume = {24}, number = {4}, pages = {664--675} } |
|||||

Hirschberg, D. S. | The longest common subsequence problem [BibTeX] |
1975 | School: Princeton University |
phdthesis | |

BibTeX:
@phdthesis{Hirschberg1975, author = {D. S. Hirschberg}, title = {The longest common subsequence problem}, school = {Princeton University}, year = {1975} } |
|||||

Hirschberg, D. S. | A linear space algorithm for computing maximal common subsequences [BibTeX] |
1975 | Commun. ACM | article | |

BibTeX:
@article{Hirschberg1975a, author = {D. S. Hirschberg}, title = {A linear space algorithm for computing maximal common subsequences}, journal = {Commun. ACM}, year = {1975}, volume = {18}, number = {6}, pages = {341--343} } |
|||||

Hirschberg, D. S. & Larmore, L. L. | The set-set LCS problem [BibTeX] |
1989 | Algorithmica | article | |

BibTeX:
@article{Hirschberg1989, author = {D. S. Hirschberg and L. L. Larmore}, title = {The set-set {LCS} problem}, journal = {Algorithmica}, year = {1989}, volume = {4}, pages = {503--510} } |
|||||

Hirschberg, D. S. & Larmore, L. L. | The least weight subsequence problem [BibTeX] |
1987 | SIAM J. Comput. | article | |

BibTeX:
@article{Hirschberg1987, author = {D. S. Hirschberg and L. L. Larmore}, title = {The least weight subsequence problem}, journal = {SIAM J. Comput.}, year = {1987}, volume = {16}, number = {4}, pages = {628--638} } |
|||||

Hirschberg, D. S. & Larmore, L. L. | The set LCS problem [BibTeX] |
1987 | Algorithmica | article | |

BibTeX:
@article{Hirschberg1987a, author = {D. S. Hirschberg and L. L. Larmore}, title = {The set {LCS} problem}, journal = {Algorithmica}, year = {1987}, volume = {2}, pages = {91--95} } |
|||||

Hirschberg, D. S. & Larmore, L. L. | New applications of failure functions [BibTeX] |
1987 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Hirschberg1987b, author = {D. S. Hirschberg and L. L. Larmore}, title = {New applications of failure functions}, journal = {J. Assoc. Comput. Mach.}, year = {1987}, volume = {24}, number = {3}, pages = {616--625} } |
|||||

Hirschberg, D. S. & Régnier, M. | Tight Bounds on the Number of String Subsequences [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@article{Hirschberg2000, author = {D. S. Hirschberg and M. R\'egnier}, title = {Tight Bounds on the Number of String Subsequences}, journal = {J. Discret. Algorithms}, year = {2000}, volume = {1}, number = {1}, pages = {123--132} } |
|||||

Hoang, D. T. | A systolic array for the sequence alignment problem [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Hoang1992, author = {D. T. Hoang}, title = {A systolic array for the sequence alignment problem}, year = {1992}, number = {CS-92-22} } |
|||||

Hoffman, C. M. & O'Donnell, M. J. | Pattern matching in trees [BibTeX] |
1982 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Hoffman1982, author = {C. M. Hoffman and M. J. O'Donnell}, title = {Pattern matching in trees}, journal = {J. Assoc. Comput. Mach.}, year = {1982}, volume = {29}, number = {1}, pages = {68--95} } |
|||||

Hollaar, L. A. | Text retrievals computers [BibTeX] |
1979 | IEEE Trans. Comput. | article | |

BibTeX:
@article{Hollaar1979, author = {L. A. Hollaar}, title = {Text retrievals computers}, journal = {IEEE Trans. Comput.}, year = {1979}, volume = {12}, pages = {40--50} } |
|||||

Hollaar, L. A. & Roberts, D. C. | Current research into specialized processors for text information retrieval [BibTeX] |
1978 | Proceedings of the 4th International Conference on Very Large Data Bases | inproceedings | |

BibTeX:
@inproceedings{Hollaar1978, author = {L. A. Hollaar and D. C. Roberts}, title = {Current research into specialized processors for text information retrieval}, booktitle = {Proceedings of the 4th International Conference on Very Large Data Bases}, year = {1978}, pages = {270--279} } |
|||||

Holmes, I. & Durbin, R. | Dynamic Programmig Alignment Accuracy [BibTeX] |
1998 | Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@inproceedings{Holmes1998, author = {I. Holmes and R. Durbin}, title = {Dynamic Programmig Alignment Accuracy}, booktitle = {Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB)}, publisher = {ACM Press}, year = {1998}, pages = {102--108} } |
|||||

Holsti, N. & Sutinen, E. | Approximate string matching using q-gram places [BibTeX] |
1994 | Proceedings of the 7th Finnish Symposium on Computer Science | inproceedings | |

BibTeX:
@inproceedings{Holsti1994, author = {N. Holsti and E. Sutinen}, title = {Approximate string matching using \emph{q}-gram places}, booktitle = {Proceedings of the 7th Finnish Symposium on Computer Science}, year = {1994}, pages = {23--32} } |
|||||

Holub, J. | Dynamic programming for reduced NFAs for approximate string and sequence matching [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@inproceedings{Holub1998, author = {J. Holub}, title = {Dynamic programming for reduced {NFAs} for approximate string and sequence matching}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'98}, year = {1998}, pages = {73--82}, note = {Collaborative Report DC--98--06} } |
|||||

Holub, J. | Simulation of Nondeterministic Finite Automata in Approximate String and Sequence Matching [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Holub1998a, author = {J. Holub}, title = {Simulation of Nondeterministic Finite Automata in Approximate String and Sequence Matching}, year = {1998}, number = {DC--98--04} } |
|||||

Holub, J. | Simulation of NFA in Approximate String and Sequence Matching [BibTeX] |
1997 | Proceedings of the Prague Stringology Club Workshop~'97 | inproceedings | |

BibTeX:
@inproceedings{Holub1997, author = {J. Holub}, title = {Simulation of {NFA} in Approximate String and Sequence Matching}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'97}, year = {1997}, pages = {39--46}, note = {Collaborative Report DC--97--03} } |
|||||

Holub, J. | Reduced nondeterministic finite automata for approximate string matching [BibTeX] |
1996 | Proceedings of the Prague Stringologic Club Workshop~'96 | inproceedings | |

BibTeX:
@inproceedings{Holub1996, author = {J. Holub}, title = {Reduced nondeterministic finite automata for approximate string matching}, booktitle = {Proceedings of the Prague Stringologic Club Workshop~'96}, year = {1996}, pages = {19--27}, note = {Collaborative Report DC--96--10} } |
|||||

Holub, J. | Approximate string matching in text [BibTeX] |
1996 | School: Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic |
mastersthesis | |

BibTeX:
@mastersthesis{Holub1996a, author = {J. Holub}, title = {Approximate string matching in text}, school = {Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic}, year = {1996} } |
|||||

Holub, J., Iliopoulos, C. S., Melichar, B. & Mouchard, L. | Distributed string matching using finite automata [BibTeX] |
1999 | Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Holub1999, author = {J. Holub and C. S. Iliopoulos and B. Melichar and L. Mouchard}, title = {Distributed string matching using finite automata}, booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms}, year = {1999}, pages = {114--128} } |
|||||

Holub, J. & Melichar, B. | Approximate string matching using factor automata [BibTeX] |
2000 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Holub2000, author = {J. Holub and B. Melichar}, title = {Approximate string matching using factor automata}, journal = {Theor. Comput. Sci.}, year = {2000}, volume = {249}, number = {2}, pages = {305--311} } |
|||||

Holub, J. & Melichar, B. | Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching [BibTeX] |
1999 | Proceedings of the 3rd International Workshop on Implementing Automata'98 | inproceedings | |

BibTeX:
@inproceedings{Holub1999a, author = {J. Holub and B. Melichar}, title = {Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching}, booktitle = {Proceedings of the 3rd International Workshop on Implementing Automata'98}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1660}, pages = {92--99} } |
|||||

Holub, J. & Melichar, B. | Approximate string matching using factor automata [BibTeX] |
1998 | Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Holub1998b, author = {J. Holub and B. Melichar}, title = {Approximate string matching using factor automata}, booktitle = {Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms}, year = {1998}, pages = {28--39} } |
|||||

Hopcroft, J. E. & Ullman, J. D. | Introduction to automata, languages and computations [BibTeX] |
1979 | book | ||

BibTeX:
@book{Hopcroft1979, author = {J. E. Hopcroft and J. D. Ullman}, title = {Introduction to automata, languages and computations}, publisher = {Addison-Wesley}, year = {1979} } |
|||||

Horspool, R. N. | Practical fast searching in strings [BibTeX] |
1980 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Horspool1980, author = {R. N. Horspool}, title = {Practical fast searching in strings}, journal = {Softw. Pract. Exp.}, year = {1980}, volume = {10}, number = {6}, pages = {501--506} } |
|||||

Horton, P. & Sukuba, T. | BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Horton2000, author = {P. Horton and T. Sukuba}, title = {{BB}: A Branch and Bound Algorithm for Local Multiple Sequence Alignment}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {84--98} } |
|||||

Howard, P. G. | Lossless and Lossy Compression of Text Images by Soft Pattern Matching [BibTeX] |
1996 | Proceedings of the 6th Data Compression Conference | inproceedings | |

BibTeX:
@inproceedings{Howard1996, author = {P. G. Howard}, title = {Lossless and Lossy Compression of Text Images by Soft Pattern Matching}, booktitle = {Proceedings of the 6th Data Compression Conference}, publisher = {IEEE Computer Society Press}, year = {1996}, pages = {210--219} } |
|||||

Hsu, W. J. & Du, M. W. | New algorithms for the LCS problem [BibTeX] |
1984 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Hsu1984, author = {W. J. Hsu and M. W. Du}, title = {New algorithms for the {LCS} problem}, journal = {J. Comput. Syst. Sci.}, year = {1984}, volume = {29}, number = {2}, pages = {133--152} } |
|||||

Hsu, W. J. & Du, M. W. | Computing a longest common subsequence for a set of strings [BibTeX] |
1984 | BIT | article | |

BibTeX:
@article{Hsu1984a, author = {W. J. Hsu and M. W. Du}, title = {Computing a longest common subsequence for a set of strings}, journal = {BIT}, year = {1984}, volume = {24}, pages = {45--59} } |
|||||

Hu, Y., Sandmeyer, S., McLaughlin, C. & Kibler, D. | Combinatorial motif analysis and hypothesis generation on a genomic scale [BibTeX] |
2000 | Bioinformatics | article | |

BibTeX:
@article{Hu2000, author = {Y.-J. Hu and S. Sandmeyer and C. McLaughlin and D. Kibler}, title = {Combinatorial motif analysis and hypothesis generation on a genomic scale}, journal = {Bioinformatics}, year = {2000}, volume = {16}, number = {3}, pages = {222--232} } |
|||||

Hua, Y., Jiang, T. & Wu, B. | Aligning DNA Sequences to Minimized the Change in Protein [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hua1998, author = {Y. Hua and T. Jiang and B. Wu}, title = {Aligning {DNA} Sequences to Minimized the Change in Protein}, booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1448}, pages = {221--234} } |
|||||

Huang, S. S. & Asuri, H. S. | Algorithms for the set LCS and the set-set LCS problems [BibTeX] |
1989 | Computing and Information | incollection | |

BibTeX:
@incollection{Huang1989, author = {S. S. Huang and H. S. Asuri}, title = {Algorithms for the set {LCS} and the set-set {LCS} problems}, booktitle = {Computing and Information}, publisher = {Elsevier}, year = {1989}, pages = {81--87} } |
|||||

Huang, X. | A Context Dependent Method for Comparing Sequences [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Huang1994, author = {X. Huang}, title = {A Context Dependent Method for Comparing Sequences}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {54--63} } |
|||||

Huang, X. | On global sequence alignement [BibTeX] |
1994 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Huang1994a, author = {X. Huang}, title = {On global sequence alignement}, journal = {Comput. Appl. Biosci.}, year = {1994}, volume = {10}, pages = {227--235} } |
|||||

Huang, X. | A contig assembly program based on sensitive detection of fragment overlaps [BibTeX] |
1992 | Gene | article | |

BibTeX:
@article{Huang1992, author = {X. Huang}, title = {A contig assembly program based on sensitive detection of fragment overlaps}, journal = {Gene}, year = {1992}, volume = {14}, pages = {18--25} } |
|||||

Huang, X. | A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor [BibTeX] |
1989 | Int. J. Parallel Program. | article | |

BibTeX:
@article{Huang1989a, author = {X. Huang}, title = {A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor}, journal = {Int. J. Parallel Program.}, year = {1989}, volume = {18}, number = {3}, pages = {223--239} } |
|||||

Huang, X. | A lower bound for the edit-distance problem under an arbitrary cost function [BibTeX] |
1988 | Inf. Process. Lett. | article | |

BibTeX:
@article{Huang1988, author = {X. Huang}, title = {A lower bound for the edit-distance problem under an arbitrary cost function}, journal = {Inf. Process. Lett.}, year = {1988}, volume = {27}, number = {6}, pages = {319--321} } |
|||||

Huang, X., Hardison, R. C. & Miller, W. | A space-efficient algorithm for local similarities [BibTeX] |
1990 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Huang1990, author = {X. Huang and R. C. Hardison and W. Miller}, title = {A space-efficient algorithm for local similarities}, journal = {Comput. Appl. Biosci.}, year = {1990}, volume = {6}, number = {4}, pages = {373--381} } |
|||||

Huang, X. & Miller, W. | A time-efficient, linear-space local similarity algorithm [BibTeX] |
1991 | Adv. Appl. Math. | article | |

BibTeX:
@article{Huang1991, author = {X. Huang and W. Miller}, title = {A time-efficient, linear-space local similarity algorithm}, journal = {Adv. Appl. Math.}, year = {1991}, volume = {12}, pages = {337--357} } |
|||||

Huang, X., Pevzner, P. A. & Miller, W. | Parametric Recomputing in Alignment Graphs [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Huang1994b, author = {X. Huang and P. A. Pevzner and W. Miller}, title = {Parametric Recomputing in Alignment Graphs}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {87--101} } |
|||||

Huffman, D. A. | A method for the construction of minimum redundancy codes [BibTeX] |
1951 | Proc. I.R.E. | article | |

BibTeX:
@article{Huffman1951, author = {D. A. Huffman}, title = {A method for the construction of minimum redundancy codes}, journal = {Proc. I.R.E.}, year = {1951}, volume = {40}, pages = {1098--1101} } |
|||||

Hui, L. C. K. | Color set size problem with applications to string matching [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Hui1992, author = {L. C. K. Hui}, title = {Color set size problem with applications to string matching}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {644}, pages = {230--243} } |
|||||

Hume, A. | Keyword matching [BibTeX] |
1990 | techreport | ||

BibTeX:
@techreport{Hume1990, author = {A. Hume}, title = {Keyword matching}, year = {1990} } |
|||||

Hume, A. | A tale of two greps [BibTeX] |
1988 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Hume1988, author = {A. Hume}, title = {A tale of two greps}, journal = {Softw. Pract. Exp.}, year = {1988}, volume = {18}, number = {11}, pages = {1063--1072} } |
|||||

Hume, A. & Sunday, D. M. | Fast string searching [BibTeX] |
1991 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Hume1991, author = {A. Hume and D. M. Sunday}, title = {Fast string searching}, journal = {Softw. Pract. Exp.}, year = {1991}, volume = {21}, number = {11}, pages = {1221--1248} } |
|||||

Hume, A. & Sunday, D. M. | Fast String Searching [BibTeX] |
1991 | Proceedings Summer USENIX Conference | inproceedings | |

BibTeX:
@inproceedings{Hume1991a, author = {A. Hume and D. M. Sunday}, title = {Fast String Searching}, booktitle = {Proceedings Summer USENIX Conference}, year = {1991}, pages = {221--233} } |
|||||

Hunt, J. W. & McIlroy, M. D. | An algorithm for differential file comparison [BibTeX] |
1975 | techreport | ||

BibTeX:
@techreport{Hunt1975, author = {J. W. Hunt and M. D. McIlroy}, title = {An algorithm for differential file comparison}, year = {1975}, number = {41} } |
|||||

Hunt, J. W. & Szymanski, T. G. | A fast algorithm for computing longest common subsequences [BibTeX] |
1977 | Commun. ACM | article | |

BibTeX:
@article{Hunt1977, author = {J. W. Hunt and T. G. Szymanski}, title = {A fast algorithm for computing longest common subsequences}, journal = {Commun. ACM}, year = {1977}, volume = {20}, number = {5}, pages = {350--353} } |
|||||

Hwa, T. & Lässig, M. | Optimal Detection of Sequence Similarity by Local Alignment [BibTeX] |
1998 | Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@inproceedings{Hwa1998, author = {T. Hwa and M. L{\"a}ssig}, title = {Optimal Detection of Sequence Similarity by Local Alignment}, booktitle = {Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB)}, publisher = {ACM Press}, year = {1998}, pages = {109--116} } |
|||||

Hyyrö, H. | A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@inproceedings{Hyyro2002, author = {H. Hyyr{\"o}}, title = {A Bit-Vector Algorithm for Computing Levenshtein and {D}amerau Edit Distances}, booktitle = {Proceedings of the Prague Stringology Conference~'02}, year = {2002}, pages = {44--54}, note = {Research Report DC--2002--03} } |
|||||

Hyyrö, H., Fredriksson, K. & Navarro, G. | Increased Bit-Parallelism for Approximate and Multiple String Matching [BibTeX] |
2006 | ACM Journal of Experimental Algorithmics (JEA) | article | |

BibTeX:
@article{Hyyro2006a, author = {H. Hyyr{\"o} and K. Fredriksson and G. Navarro}, title = {Increased Bit-Parallelism for Approximate and Multiple String Matching}, journal = {ACM Journal of Experimental Algorithmics (JEA)}, year = {2006}, volume = {10}, number = {2.06}, note = {Special issue for best papers of {\em WEA'04}} } |
|||||

Hyyrö, H. & Navarro, G. | Bit-Parallel Computation of Local Similarity Score Matrices with Unitary Weights [BibTeX] |
2006 | International Journal of Foundations of Computer Science (IJFCS) | article | |

BibTeX:
@article{Hyyro2006, author = {H. Hyyr{\"o} and G. Navarro}, title = {Bit-Parallel Computation of Local Similarity Score Matrices with Unitary Weights}, journal = {International Journal of Foundations of Computer Science (IJFCS)}, year = {2006}, volume = {17}, number = {6}, pages = {1325--1344} } |
|||||

Hyyrö, H. & Navarro, G. | Bit-parallel Witnesses and their Applications to Approximate String Matching [BibTeX] |
2005 | Algorithmica | article | |

BibTeX:
@article{Hyyro2005, author = {H. Hyyr{\"o} and G. Navarro}, title = {Bit-parallel Witnesses and their Applications to Approximate String Matching}, journal = {Algorithmica}, publisher = {Springer}, year = {2005}, volume = {41}, number = {3}, pages = {203--231} } |
|||||

Hyyrö, H. & Navarro, G. | Bit-Parallel Computation of Local Similarity Score Matrices with Unitary Weights [BibTeX] |
2005 | Proceedings of the 10th Prague Stringology Conference (PSC'05) | inproceedings | |

BibTeX:
@inproceedings{Hyyro2005a, author = {H. Hyyr{\"o} and G. Navarro}, title = {Bit-Parallel Computation of Local Similarity Score Matrices with Unitary Weights}, booktitle = {Proceedings of the 10th Prague Stringology Conference (PSC'05)}, year = {2005}, pages = {95--108} } |
|||||

Hyyrö, H., Pinzon, Y. & Shinohara, A. | New Bit-Parallel Indel-Distance Algorithm [BibTeX] |
2005 | Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA'05) | inproceedings | |

BibTeX:
@inproceedings{Hyyroe2005, author = {Heikki Hyyrö and Yoan Pinzon and Ayumi Shinohara}, title = {New Bit-Parallel Indel-Distance Algorithm}, booktitle = {Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA'05)}, publisher = {Springer-Verlag, Berlin}, year = {2005}, volume = {3503}, pages = {380-390} } |
|||||

Hyyrö, H., Pinzon, Y. & Shinohara, A. | Fast Bit-Vector Algorithms for Approximate String Matching under Indel-Distance [BibTeX] |
2005 | roceedings of the 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05) | inproceedings | |

BibTeX:
@inproceedings{Hyyroe2005a, author = {Heikki Hyyrö and Yoan Pinzon and Ayumi Shinohara}, title = {Fast Bit-Vector Algorithms for Approximate String Matching under Indel-Distance}, booktitle = {roceedings of the 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05)}, publisher = {Springer-Verlag}, year = {2005}, volume = {3381}, pages = {380-384} } |
|||||

Hébrard, J. | An algorithm for distinguishing efficiently bit-strings by their subsequences [BibTeX] |
1991 | Theor. Comput. Sci. | article | |

BibTeX:
@article{H'ebrard1991, author = {J.-J. H{\'e}brard}, title = {An algorithm for distinguishing efficiently bit-strings by their subsequences}, journal = {Theor. Comput. Sci.}, year = {1991}, volume = {82}, number = {1}, pages = {35--49} } |
|||||

Hébrard, J. | Distances sur les mots. Application à la recherche de motifs [BibTeX] |
1984 | School: Université de Rouen |
phdthesis | |

BibTeX:
@phdthesis{H'ebrard1984, author = {J.-J. H{\'e}brard}, title = {Distances sur les mots. Application {\`a} la recherche de motifs}, school = {Universit{\'e} de Rouen}, year = {1984} } |
|||||

Hébrard, J. & Crochemore, M. | Calcul de la distance par les sous-mots [BibTeX] |
1986 | RAIRO Inform. Théor. Appl. | article | |

BibTeX:
@article{H'ebrard1986, author = {J.-J. H{\'e}brard and M. Crochemore}, title = {Calcul de la distance par les sous-mots}, journal = {RAIRO Inform. Th{\'e}or. Appl.}, year = {1986}, volume = {20}, number = {4}, pages = {441--456} } |
|||||

Ibarra, O. H., Jiang, T. & Wang, H. | String editing on a one--way linear array of finite state machines [BibTeX] |
1992 | IEEE Trans. Comput. | article | |

BibTeX:
@article{Ibarra1992, author = {O. H. Ibarra and T. Jiang and H. Wang}, title = {String editing on a one--way linear array of finite state machines}, journal = {IEEE Trans. Comput.}, year = {1992}, volume = {41}, number = {1}, pages = {112--118} } |
|||||

Ibarra, O. H., Pong, T. & Sohn, S. M. | Hypercube algorithms for some string comparison problems [BibTeX] |
1988 | Proceedings of the International Conference on Parallel Processing | inproceedings | |

BibTeX:
@inproceedings{Ibarra1988, author = {O. H. Ibarra and T. Pong and S. M. Sohn}, title = {Hypercube algorithms for some string comparison problems}, booktitle = {Proceedings of the International Conference on Parallel Processing}, year = {1988}, volume = {3}, pages = {190--193} } |
|||||

Ibarra, O. H., Pong, T. C. & Sohn, S. M. | String processing on the hypercube [BibTeX] |
1990 | IEEE Trans. Acoust. Speech Signal Process. | article | |

BibTeX:
@article{Ibarra1990, author = {O. H. Ibarra and T. C. Pong and S. M. Sohn}, title = {String processing on the hypercube}, journal = {IEEE Trans. Acoust. Speech Signal Process.}, year = {1990}, volume = {38}, number = {1}, pages = {160--164} } |
|||||

Idury, R. | Dynamic Multiple Pattern Matching [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Idury1998, author = {R. Idury}, title = {Dynamic Multiple Pattern Matching}, year = {1998}, number = {TR93-207} } |
|||||

Idury, R. M. & Schäffer, A. A. | Multiple matching of parameterized patterns [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Idury1996, author = {R. M. Idury and A. A. Sch{\"a}ffer}, title = {Multiple matching of parameterized patterns}, journal = {Theor. Comput. Sci.}, year = {1996}, volume = {154}, number = {2}, pages = {203--224} } |
|||||

Idury, R. M. & Schäffer, A. A. | Multiple matching of rectangular patterns [BibTeX] |
1995 | Inf. Comput. | article | |

BibTeX:
@article{Idury1995, author = {R. M. Idury and A. A. Sch{\"a}ffer}, title = {Multiple matching of rectangular patterns}, journal = {Inf. Comput.}, year = {1995}, volume = {117}, number = {1}, pages = {78--90} } |
|||||

Idury, R. M. & Schäffer, A. A. | Multiple matching of parameterized patterns [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Idury1994, author = {R. M. Idury and A. A. Sch{\"a}ffer}, title = {Multiple matching of parameterized patterns}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {226--239} } |
|||||

Idury, R. M. & Schäffer, A. A. | Dynamic dictionary matching with failure functions [BibTeX] |
1994 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Idury1994a, author = {R. M. Idury and A. A. Sch{\"a}ffer}, title = {Dynamic dictionary matching with failure functions}, journal = {Theor. Comput. Sci.}, year = {1994}, volume = {131}, number = {2}, pages = {295--310} } |
|||||

Idury, R. M. & Schäffer, A. A. | Multiple matching of rectangular patterns [BibTeX] |
1993 | Proceedings of the 25th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Idury1993, author = {R. M. Idury and A. A. Sch{\"a}ffer}, title = {Multiple matching of rectangular patterns}, booktitle = {Proceedings of the 25th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1993}, pages = {81--90} } |
|||||

Idury, R. M. & Schäffer, A. A. | Dynamic dictionary matching with failure functions [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Idury1992, author = {R. M. Idury and A. A. Sch{\"a}ffer}, title = {Dynamic dictionary matching with failure functions}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {276--287} } |
|||||

Iliopoulos, C., Jayasekera, I. & Mouchard, L. | Fast practical exact and approximate pattern matching in protein sequences [BibTeX] |
2006 | Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2006, author = {C. Iliopoulos and I. Jayasekera and L. Mouchard}, title = {Fast practical exact and approximate pattern matching in protein sequences}, booktitle = {Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms}, year = {2006} } |
|||||

Iliopoulos, C. S., Kumar, M., Mouchard, L. & Venkatesh, S. | Motif evolution in polyphonic musical sequences [BibTeX] |
2000 | Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2000, author = {C. S. Iliopoulos and M. Kumar and L. Mouchard and S. Venkatesh}, title = {Motif evolution in polyphonic musical sequences}, booktitle = {Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms}, year = {2000}, pages = {53--66} } |
|||||

Iliopoulos, C. S., Kumar, M., Mouchard, L. & Venkatesh, S. | Computing all motif occurrences in polyphonic musical sequences [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Iliopoulos1998, author = {C. S. Iliopoulos and M. Kumar and L. Mouchard and S. Venkatesh}, title = {Computing all motif occurrences in polyphonic musical sequences}, year = {1998}, number = {9-98} } |
|||||

Iliopoulos, C. S. & Kurokawa, M. | String Matching with Gaps for Musical Melodic Recognition [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2002, author = {C. S. Iliopoulos and M. Kurokawa}, title = {String Matching with Gaps for Musical Melodic Recognition}, booktitle = {Proceedings of the Prague Stringology Conference~'02}, year = {2002}, pages = {55--64}, note = {Research Report DC--2002--03} } |
|||||

Iliopoulos, C. S., Lecroq, T., Mouchard, L. & Pinzon, Y. J. | Computing Repetitions in Musical Sequences [BibTeX] |
2000 | Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2000a, author = {C. S. Iliopoulos and T. Lecroq and L. Mouchard and Y. J. Pinzon}, title = {Computing Repetitions in Musical Sequences}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia}, year = {2000}, pages = {49--59}, note = {Collaborative Report DC--2000--03} } |
|||||

Iliopoulos, C. S., Lee, I., Mohamed, M., Rahman, M. S. & Smyth, W. F. | Finding Patterns with Variable Length Gaps or Don't Cares [BibTeX] |
2006 | Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2006c, author = {C. S. Iliopoulos and I. Lee and M. Mohamed and M. S. Rahman and W. F. Smyth}, title = {Finding Patterns with Variable Length Gaps or Don't Cares}, booktitle = {Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06)}, year = {2006} } |
|||||

Iliopoulos, C. S., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E. & Tsakalidis, A. | The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications [BibTeX] |
2006 | Fundamenta Informaticae | article | |

BibTeX:
@article{Iliopoulos2006a, author = {C. S. Iliopoulos and C. Makris and Y. Panagis and K. Perdikuri and E. Theodoridis and A. Tsakalidis}, title = {The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications}, journal = {Fundamenta Informaticae}, year = {2006}, volume = {71}, number = {2-3}, pages = {259-277} } |
|||||

Iliopoulos, C. S., Makris, C., Panagis, Y., Theodoridis, E. & Tsakalidis, A. | Efficient Algorithms for Handling Molecular Weighted Sequences [BibTeX] |
2004 | Theoretical Computer Science | article | |

BibTeX:
@article{Iliopoulos2004, author = {C. S. Iliopoulos and C. Makris and Y. Panagis and E. Theodoridis and A. Tsakalidis}, title = {Efficient Algorithms for Handling Molecular Weighted Sequences}, journal = {Theoretical Computer Science}, year = {2004} } |
|||||

Iliopoulos, C. S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W. & Sagot, M. | A First Approach to Finding Common Motifs with Gaps [BibTeX] |
2004 | International Journal of Foundations of Computer Science | article | |

BibTeX:
@article{Iliopoulos2004a, author = {C. S. Iliopoulos and J. McHugh and P. Peterlongo and N. Pisanti and W. Rytter and M. Sagot}, title = {A First Approach to Finding Common Motifs with Gaps}, journal = {International Journal of Foundations of Computer Science}, year = {2004} } |
|||||

Iliopoulos, C. S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W. & Sagot, M. F. | A First Approach to Finding Common Motifs with Gaps [BibTeX] |
2004 | Proceedings of the 2004 Prague Stringology Conference (PSC'04) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2004d, author = {C. S. Iliopoulos and J. McHugh and P. Peterlongo and N. Pisanti and W. Rytter and M. F. Sagot}, title = {A First Approach to Finding Common Motifs with Gaps}, booktitle = {Proceedings of the 2004 Prague Stringology Conference (PSC'04)}, year = {2004} } |
|||||

Iliopoulos, C. S., Mohamed, M., Mouchard, L., Perdikuri, K. G., Smyth, W. F. & Tsakalidis, A. K. | String Regularities with Don't Cares [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2002a, author = {C. S. Iliopoulos and M. Mohamed and L. Mouchard and K. G. Perdikuri and W. F. Smyth and A. K. Tsakalidis}, title = {String Regularities with Don't Cares}, booktitle = {Proceedings of the Prague Stringology Conference~'02}, year = {2002}, pages = {65--74}, note = {Research Report DC--2002--03} } |
|||||

Iliopoulos, C. S., Mohamed, M. & Smyth, W. F. | New Complexity Results for the k-Covers Problem [BibTeX] |
2004 | Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2004e, author = {Costas S. Iliopoulos and Manal Mohamed and W. F. Smyth}, title = {New Complexity Results for the k-Covers Problem}, booktitle = {Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04)}, year = {2004} } |
|||||

Iliopoulos, C. S., Moore, D. & Smyth, W. F. | A characterization of the squares in a Fibonacci string [BibTeX] |
1997 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Iliopoulos1997, author = {C. S. Iliopoulos and D. Moore and W. F. Smyth}, title = {A characterization of the squares in a {Fibonacci} string}, journal = {Theor. Comput. Sci.}, year = {1997}, volume = {172}, number = {1--2}, pages = {281--291} } |
|||||

Iliopoulos, C. S., Moore, D. W. G. & Park, K. | Covering a string [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1993, author = {C. S. Iliopoulos and D. W. G. Moore and K. Park}, title = {Covering a string}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {54--62} } |
|||||

Iliopoulos, C. S., Moore, D. W. G. & Smyth, W. F. | A linear algorithm for computing the squares of a fibonacci string [BibTeX] |
1996 | Proceedings of the Computing: Australian Theory Symposium | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1996, author = {C. S. Iliopoulos and D. W. G. Moore and W. F. Smyth}, title = {A linear algorithm for computing the squares of a {fibonacci} string}, booktitle = {Proceedings of the Computing: Australian Theory Symposium}, year = {1996}, pages = {55--63} } |
|||||

Iliopoulos, C. S. & Mouchard, L. | An O(nlog n) Algorithm for Computing all Maximal Quasiperiodicities in Strings [BibTeX] |
1999 | Combinatorics, Computation and Logic. Proceedings of DMTCS'99 and CATS'99 | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1999, author = {C. S. Iliopoulos and L. Mouchard}, title = {An \emph{O(n\log n)} Algorithm for Computing all Maximal Quasiperiodicities in Strings}, booktitle = {Combinatorics, Computation and Logic. Proceedings of DMTCS'99 and CATS'99}, publisher = {Springer-Verlag, Singapore}, year = {1999}, pages = {262--272} } |
|||||

Iliopoulos, C. S. & Mouchard, L. | Quasiperiodicity and string covering [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Iliopoulos1999a, author = {C. S. Iliopoulos and L. Mouchard}, title = {Quasiperiodicity and string covering}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {218}, number = {1}, pages = {205--216} } |
|||||

Iliopoulos, C. S. & Mouchard, L. | Quasiperiodicity: From detection to normal forms [BibTeX] |
1999 | J. Autom. Lang. Comb. | article | |

BibTeX:
@article{Iliopoulos1999b, author = {C. S. Iliopoulos and L. Mouchard}, title = {Quasiperiodicity: From detection to normal forms}, journal = {J. Autom. Lang. Comb.}, year = {1999}, volume = {4}, number = {3}, pages = {213--228} } |
|||||

Iliopoulos, C. S., Mouchard, L. & Venkatesh, S. | Optimal computation of all the repetitions in a string [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Iliopoulos1998a, author = {C. S. Iliopoulos and L. Mouchard and S. Venkatesh}, title = {Optimal computation of all the repetitions in a string}, year = {1998}, number = {8-98} } |
|||||

Iliopoulos, C. S. & Park, K. | A work-time optimal algorithm for computing all string covers [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Iliopoulos1996a, author = {C. S. Iliopoulos and K. Park}, title = {A work-time optimal algorithm for computing all string covers}, journal = {Theor. Comput. Sci.}, year = {1996}, volume = {164}, number = {1--2}, pages = {299--310} } |
|||||

Iliopoulos, C. S. & Park, K. | An optimal O(loglog n)-time algorithm for parallel superprimitivity testing [BibTeX] |
1994 | J. Korea Information Science Society | article | |

BibTeX:
@article{Iliopoulos1994, author = {C. S. Iliopoulos and K. Park}, title = { An optimal \emph{O(\log\log n)}-time algorithm for parallel superprimitivity testing}, journal = {J. Korea Information Science Society}, year = {1994}, volume = {21}, number = {8}, pages = {1400--1404} } |
|||||

Iliopoulos, C. S., Pedikuri, K. & Tsihlas, K. | The Pattern Matching Problem in Biological Weighted Sequences [BibTeX] |
2004 | Proc. of Third International Conference on FUN WITH ALGORITHMS (FUN 2004) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2004b, author = {C. S. Iliopoulos and K. Pedikuri and K. Tsihlas}, title = {The Pattern Matching Problem in Biological Weighted Sequences}, booktitle = {Proc. of Third International Conference on FUN WITH ALGORITHMS (FUN 2004)}, year = {2004} } |
|||||

Iliopoulos, C. S., Perdikuri, K., Theodoridis, E., Tsakalidis, A. & Tsichlas, K. | Motif Extraction from Weighted Sequences [BibTeX] |
2004 | Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2004f, author = {C. S. Iliopoulos and K. Perdikuri and E. Theodoridis and A. Tsakalidis and K. Tsichlas}, title = {Motif Extraction from Weighted Sequences}, booktitle = {Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04)}, publisher = {Springer-Verlag Heidelberg}, year = {2004}, volume = {3246}, pages = {286-297} } |
|||||

Iliopoulos, C. S., Perdikuri, K., Tsakalidis, A. & Tsichlas, K. | Algorithms for extracting structured motifs from biologically weighted sequences [BibTeX] |
2005 | Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2005, author = {C. S. Iliopoulos and K. Perdikuri and A. Tsakalidis and K. Tsichlas}, title = {Algorithms for extracting structured motifs from biologically weighted sequences}, booktitle = {Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)}, year = {2005}, pages = {125-136} } |
|||||

Iliopoulos, C. S. & Pinzon, Y. J. | Recovering an LCS in O(n^2/w) time and space [BibTeX] |
2001 | Proceedings of the 12th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2001, author = {C. S. Iliopoulos and Y. J. Pinzon}, title = {Recovering an {LCS} in \emph{O(n^2/w)} time and space}, booktitle = {Proceedings of the 12th Australasian Workshop On Combinatorial Algorithms}, year = {2001}, pages = {80--87} } |
|||||

Iliopoulos, C. S. & Rahman, M. S. | Indexing Factors with Gaps [BibTeX] |
2007 | Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2007, author = {C. S. Iliopoulos and M. S. Rahman}, title = {Indexing Factors with Gaps}, booktitle = {Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science}, year = {2007} } |
|||||

Iliopoulos, C. S. & Rahman, M. S. | Pattern Matching Algorithms with Don't Cares [BibTeX] |
2007 | Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM07) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2007a, author = {C. S. Iliopoulos and M. S. Rahman}, title = {Pattern Matching Algorithms with Don't Cares}, booktitle = {Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM07)}, year = {2007}, note = {(Poster Paper)} } |
|||||

Iliopoulos, C. S. & Rahman, M. S. | Algorithms for Computing Variants of the Longest Common Subsequence Problem [BibTeX] |
2006 | Proceedings of the 17th International Symposium on Algorithms and Computation | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2006b, author = {C. S. Iliopoulos and M. S. Rahman}, title = {Algorithms for Computing Variants of the Longest Common Subsequence Problem}, booktitle = {Proceedings of the 17th International Symposium on Algorithms and Computation}, year = {2006} } |
|||||

Iliopoulos, C. S. & Reid, J. F. | Validating and decomposing partially occluded two-dimensional images [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1998b, author = {C. S. Iliopoulos and J. F. Reid}, title = {Validating and decomposing partially occluded two-dimensional images}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'98}, year = {1998}, pages = {83--94}, note = {Collaborative Report DC--98--06} } |
|||||

Iliopoulos, C. S. & Reid, J. F. | An optimal parallel algorithm for analysing occluded images [BibTeX] |
1997 | Proceedings of the 4th Annual Australian Conference on Parallel and Real-Time Systems | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1997a, author = {C. S. Iliopoulos and J. F. Reid}, title = {An optimal parallel algorithm for analysing occluded images}, booktitle = {Proceedings of the 4th Annual Australian Conference on Parallel and Real-Time Systems}, publisher = {Springer-Verlag, Berlin}, year = {1997}, pages = {104--113} } |
|||||

Iliopoulos, C. S. & Rytter, W. | Two Parallel Transformations of Suffix Arrays into Suffix Trees [BibTeX] |
2004 | Theoretical Computer Science | article | |

BibTeX:
@article{Iliopoulos2004c, author = {C. S. Iliopoulos and W. Rytter}, title = {Two Parallel Transformations of Suffix Arrays into Suffix Trees}, journal = {Theoretical Computer Science}, year = {2004} } |
|||||

Iliopoulos, C. S. & Rytter, W. | On Parallel Transformations of Suffix Arrays into Suffix Trees [BibTeX] |
2004 | Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04) | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos2004g, author = {Costas S. Iliopoulos and Wojciech Rytter}, title = {On Parallel Transformations of Suffix Arrays into Suffix Trees}, booktitle = {Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04)}, year = {2004} } |
|||||

Iliopoulos, C. S. & Simpson, J. | On-line validation and analysis of occluded images [BibTeX] |
1997 | Proceedings of the 8th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1997b, author = {C. S. Iliopoulos and J. Simpson}, title = {On-line validation and analysis of occluded images}, booktitle = {Proceedings of the 8th Australasian Workshop On Combinatorial Algorithms}, year = {1997}, pages = {25--36} } |
|||||

Iliopoulos, C. S. & Smyth, W. F. | On-line algorithms for k-covering [BibTeX] |
1998 | Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Iliopoulos1998c, author = {C. S. Iliopoulos and W. F. Smyth}, title = {On-line algorithms for \emph{k}-covering}, booktitle = {Proceedings of the 9th Australasian Workshop On Combinatorial Algorithms}, year = {1998}, pages = {97--106} } |
|||||

Iliopoulos, C. S. & Smyth, W. F. | A characterization of the squares in a Fibonacci string [BibTeX] |
1997 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Iliopoulos1997c, author = {C. S. Iliopoulos and W. F. Smyth}, title = {A characterization of the squares in a {Fibonacci} string}, journal = {Theor. Comput. Sci.}, year = {1997}, volume = {172}, number = {1--2}, pages = {281--291} } |
|||||

Iliopoulos, C. S. & Smyth, W. F. | Optimal algorithms for computing the canonical form of a circular string [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Iliopoulos1992, author = {C. S. Iliopoulos and W. F. Smyth}, title = {Optimal algorithms for computing the canonical form of a circular string}, journal = {Theor. Comput. Sci.}, year = {1992}, volume = {92}, number = {1}, pages = {87--105} } |
|||||

Indyk, P. | Faster algorithms for string matching problems: matching the convolution bound [BibTeX] |
1998 | Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Indyk1998, author = {P. Indyk}, title = {Faster algorithms for string matching problems: matching the convolution bound}, booktitle = {Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1998}, pages = {166--173} } |
|||||

Indyk, P. | Deterministic superimposed coding with applications to pattern matching [BibTeX] |
1997 | Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Indyk1997, author = {P. Indyk}, title = {Deterministic superimposed coding with applications to pattern matching}, booktitle = {Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1997}, pages = {127--136} } |
|||||

Inenaga, S. | Bidirectional Construction of Suffix Trees [BibTeX] |
2002 | Proceedings of the Prague Stringology Conference~'02 | inproceedings | |

BibTeX:
@inproceedings{Inenaga2002, author = {S. Inenaga}, title = {Bidirectional Construction of Suffix Trees}, booktitle = {Proceedings of the Prague Stringology Conference~'02}, year = {2002}, pages = {75--87}, note = {Research Report DC--2002--03} } |
|||||

Inoue, K. & Takanami, I. | A characterization of recognizable picture languages [BibTeX] |
1992 | Proceedings of the 2nd International Colloquium on Parallel Image Analysis | inproceedings | |

BibTeX:
@inproceedings{Inoue1992, author = {K. Inoue and I. Takanami}, title = {A characterization of recognizable picture languages}, booktitle = {Proceedings of the 2nd International Colloquium on Parallel Image Analysis}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {654}, pages = {133--143} } |
|||||

Irving, R. W. | Suffix binary search trees [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Irving1996, author = {R. W. Irving}, title = {Suffix binary search trees}, year = {1996} } |
|||||

Irving, R. W. & Fraser, C. B. | Maximal Common Subsequences and Minimal Common Supersequences [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Irving1994, author = {R. W. Irving and C. B. Fraser}, title = {Maximal Common Subsequences and Minimal Common Supersequences}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {173--183} } |
|||||

Irving, R. W. & Fraser, C. B. | On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Irving1993, author = {R. W. Irving and C. B. Fraser}, title = {On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of {\emph{k}} strings}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {63--73} } |
|||||

Irving, R. W. & Fraser, C. B. | Two algorithms for the longest common subsequence of three (or more) strings [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Irving1992, author = {R. W. Irving and C. B. Fraser}, title = {Two algorithms for the longest common subsequence of three (or more) strings}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {214--229} } |
|||||

Isenman, M. E. & Shasha, D. E. | Performance and Architectural Issues for String Matching [BibTeX] |
1990 | IEEE Trans. Comput. | article | |

BibTeX:
@article{Isenman1990, author = {M. E. Isenman and D. E. Shasha}, title = {Performance and Architectural Issues for String Matching}, journal = {IEEE Trans. Comput.}, year = {1990}, volume = {39}, number = {2}, pages = {238--250} } |
|||||

Itai, A. | Optimal alphabetic trees [BibTeX] |
1976 | SIAM J. Comput. | article | |

BibTeX:
@article{Itai1976, author = {A. Itai}, title = {Optimal alphabetic trees}, journal = {SIAM J. Comput.}, year = {1976}, volume = {5}, number = {1}, pages = {9--18} } |
|||||

Itano, K., Sato, Y., Hirai, H. & Yamagata, T. | An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner [BibTeX] |
1988 | Inf. Process. Lett. | article | |

BibTeX:
@article{Itano1988, author = {K. Itano and Y. Sato and H. Hirai and T. Yamagata}, title = {An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner}, journal = {Inf. Process. Lett.}, year = {1988}, volume = {27}, number = {5}, pages = {253--258} } |
|||||

Ito & Shizuya | On the Difficulty of Searching for a String without Decryption [BibTeX] |
1999 | TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems | article | |

BibTeX:
@article{Ito1999, author = {Ito and Shizuya}, title = {On the Difficulty of Searching for a String without Decryption}, journal = {TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems}, year = {1999}, pages = {?--?} } |
|||||

Ito, M., Katsura, M., Shyr, H. J. & Yu, S. S. | Automata accepting primitive words [BibTeX] |
1988 | Semigroup Forum | article | |

BibTeX:
@article{Ito1988, author = {M. Ito and M. Katsura and H. J. Shyr and S. S. Yu}, title = {Automata accepting primitive words}, journal = {Semigroup Forum}, year = {1988}, volume = {37}, pages = {45--50} } |
|||||

Ito, M., Shimizu, K., Nakanishi, M. & Hashimoto, A. | Polynomial-Time Algorithms for Computing Characteristic Strings [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Ito1994, author = {M. Ito and K. Shimizu and M. Nakanishi and A. Hashimoto}, title = {Polynomial-Time Algorithms for Computing Characteristic Strings}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {274--288} } |
|||||

Ito, T. & Kizawa, M. | Hierarchical File Organization and Its Application to Similar-String Matching [BibTeX] |
1983 | ACM Trans. Database Syst. | article | |

BibTeX:
@article{Ito1983, author = {T. Ito and M. Kizawa}, title = {Hierarchical File Organization and Its Application to Similar-String Matching}, journal = {ACM Trans. Database Syst.}, year = {1983}, volume = {8}, number = {3}, pages = {410--433} } |
|||||

Itoga, S. Y. | The string merging problem [BibTeX] |
1981 | BIT | article | |

BibTeX:
@article{Itoga1981, author = {S. Y. Itoga}, title = {The string merging problem}, journal = {BIT}, year = {1981}, volume = {21}, pages = {20--30} } |
|||||

Ivanov, A. G. | Distinguishing an approximate word's inclusion on Turing machine in real time [BibTeX] |
1984 | Izv. Akad. Nauk SSSR Ser. Mat. | article | |

BibTeX:
@article{Ivanov1984, author = {A. G. Ivanov}, title = {Distinguishing an approximate word's inclusion on Turing machine in real time}, journal = {Izv. Akad. Nauk SSSR Ser. Mat.}, year = {1984}, volume = {48}, pages = {520--568} } |
|||||

Iyenger, S. & Alia, V. | A string search algorithm [BibTeX] |
1980 | Appl. Math. Comput. | article | |

BibTeX:
@article{Iyenger1980, author = {S. Iyenger and V. Alia}, title = {A string search algorithm}, journal = {Appl. Math. Comput.}, year = {1980}, volume = {6}, pages = {123--131} } |
|||||

Jacobson, G. & Vo, K. | Heaviest increasing/common subsequence [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Jacobson1992, author = {G. Jacobson and K.-P. Vo}, title = {Heaviest increasing/common subsequence}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {52--66} } |
|||||

Jacquet, P., Rais, B. & Szpankowski, W. | Compact suffix trees ressemble PATRICIA trees: limiting distribution of depth [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Jacquet1992, author = {P. Jacquet and B. Rais and W. Szpankowski}, title = {Compact suffix trees ressemble PATRICIA trees: limiting distribution of depth}, year = {1992}, number = {CSD-TR-92-048} } |
|||||

Jacquet, P. & Szpankowski, W. | What can we learn about suffix trees from independent tries ? [BibTeX] |
1991 | Proceedings of the 2nd Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@inproceedings{Jacquet1991, author = {P. Jacquet and W. Szpankowski}, title = {What can we learn about suffix trees from independent tries ?}, booktitle = {Proceedings of the 2nd Workshop on Algorithms and Data Structures}, publisher = {Springer-Verlag, Berlin}, year = {1991}, number = {519}, pages = {228--239} } |
|||||

Jacquet, P. & Szpankowski, W. | Autocorrelation on words and its applications. Analysis of suffix tree by string-ruler approach [BibTeX] |
1989 | techreport | ||

BibTeX:
@techreport{Jacquet1989, author = {P. Jacquet and W. Szpankowski}, title = {Autocorrelation on words and its applications. Analysis of suffix tree by string-ruler approach}, year = {1989}, number = {TR-1106} } |
|||||

Jantke, K. | Polynomial time inference of general pattern languages [BibTeX] |
1984 | Proceedings of the 1st Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Jantke1984, author = {K. Jantke}, title = {Polynomial time inference of general pattern languages}, booktitle = {Proceedings of the 1st Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1984}, number = {166}, pages = {314--325} } |
|||||

Jiang, T., Jiang, Z. & Breslauer, D. | Rotation of periodic strings and short superstrings [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Jiang1996, author = {T. Jiang and Z. Jiang and D. Breslauer}, title = {Rotation of periodic strings and short superstrings}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {115--125} } |
|||||

Jiang, T., Lawler, E. L. & Wang, L. | Aligning Sequences via an Evolutionary Tree: complexity and Approximation [BibTeX] |
1994 | Proceedings of the 26th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Jiang1994, author = {T. Jiang and E. L. Lawler and L. Wang}, title = {Aligning Sequences via an Evolutionary Tree: complexity and Approximation}, booktitle = {Proceedings of the 26th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1994}, pages = {760--769} } |
|||||

Jiang, T. & Li, M. | Approximating shortest superstrings with constraints [BibTeX] |
1995 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Jiang1995, author = {T. Jiang and M. Li}, title = {Approximating shortest superstrings with constraints}, journal = {Theor. Comput. Sci.}, year = {1995}, volume = {134}, number = {2}, pages = {473--491} } |
|||||

Jiang, T. & Li, M. | On the approximation of shortest common supersequences and longest common subsequences [BibTeX] |
1995 | SIAM J. Comput. | article | |

BibTeX:
@article{Jiang1995a, author = {T. Jiang and M. Li}, title = {On the approximation of shortest common supersequences and longest common subsequences}, journal = {SIAM J. Comput.}, year = {1995}, volume = {24}, number = {5}, pages = {1122--1139} } |
|||||

Jiang, T. & Li, M. | On the approximation of shortest common supersequences and longest common subsequences [BibTeX] |
1994 | Proceedings of the 21st International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Jiang1994a, author = {T. Jiang and M. Li}, title = {On the approximation of shortest common supersequences and longest common subsequences}, booktitle = {Proceedings of the 21st International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {820}, pages = {191--202} } |
|||||

Jiang, T. & Li, M. | Approximating Shortest Superstrings with Constraints [BibTeX] |
1993 | Proceedings of the 3rd Workshop on Algorithms and Data Structures | inproceedings | |

BibTeX:
@inproceedings{Jiang1993, author = {T. Jiang and M. Li}, title = {Approximating Shortest Superstrings with Constraints}, booktitle = {Proceedings of the 3rd Workshop on Algorithms and Data Structures}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {709}, pages = {385--396} } |
|||||

Jiang, T. & Li, M. | On the complexity of learning strings and sequences [BibTeX] |
1993 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Jiang1993a, author = {T. Jiang and M. Li}, title = {On the complexity of learning strings and sequences}, journal = {Theor. Comput. Sci.}, year = {1993}, volume = {119}, number = {2}, pages = {363--373} } |
|||||

Jiang, T. & Li, M. | k One-way Heads Cannot Do String Matching [BibTeX] |
1993 | Proceedings of the 25th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Jiang1993b, author = {T. Jiang and M. Li}, title = {{\emph{k}} One-way Heads Cannot Do String Matching}, booktitle = {Proceedings of the 25th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1993}, pages = {62--70} } |
|||||

Jiang, T. & Li, M. | Towards a DNA sequencing theory (learning a string) [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Jiang1991, author = {T. Jiang and M. Li}, title = {Towards a {DNA} sequencing theory (learning a string)}, year = {1991}, number = {91-08} } |
|||||

Jiang, T., Li, M. & Du, D. | A note on shortest superstrings with flipping [BibTeX] |
1992 | Inf. Process. Lett. | article | |

BibTeX:
@article{Jiang1992, author = {T. Jiang and M. Li and D. Du}, title = {A note on shortest superstrings with flipping}, journal = {Inf. Process. Lett.}, year = {1992}, volume = {44}, number = {4}, pages = {195--199} } |
|||||

Jiang, T., Lin, G., Ma, B. & Zhang, K. | The Longest Common Subsequence Problem for Arc-Annotated Sequences [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Jiang2000, author = {T. Jiang and G.-H. Lin and B. Ma and K. Zhang}, title = {The Longest Common Subsequence Problem for Arc-Annotated Sequences}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {154--165} } |
|||||

Jiang, T., Salomaa, A., Salomaa, K. & Sheng, Y. | Inclusion is undecidable for pattern languages [BibTeX] |
1993 | Proceedings of the 20th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Jiang1993c, author = {T. Jiang and A. Salomaa and K. Salomaa and Y. Sheng}, title = {Inclusion is undecidable for pattern languages}, booktitle = {Proceedings of the 20th International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {700}, pages = {301--312} } |
|||||

Jiang, T., Wang, L. & Zhang, K. | Alignment of Trees: an Alternative to Tree Edit [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Jiang1994b, author = {T. Jiang and L. Wang and K. Zhang}, title = {Alignment of Trees: an Alternative to Tree Edit}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {75--86} } |
|||||

Johansen, P. | On-line string matching with feedback [BibTeX] |
1995 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Johansen1995, author = {P. Johansen}, title = {On-line string matching with feedback}, journal = {Theor. Comput. Sci.}, year = {1995}, volume = {141}, number = {1--2}, pages = {53--67} } |
|||||

Johansen, P. | Combinatorial pattern matching, the method and the program package [BibTeX] |
1994 | techreport | ||

BibTeX:
@techreport{Johansen1994, author = {P. Johansen}, title = {Combinatorial pattern matching, the method and the program package}, year = {1994}, number = {10} } |
|||||

Johansen, P. | Inductive inference of ultimately periodic sequences [BibTeX] |
1988 | BIT | article | |

BibTeX:
@article{Johansen1988, author = {P. Johansen}, title = {Inductive inference of ultimately periodic sequences}, journal = {BIT}, year = {1988}, volume = {1}, pages = {573--580} } |
|||||

Johnson, M. S. & Doolittle, R. F. | A method for the simultaneous alignment of three or more amino acid sequences [BibTeX] |
1986 | J. Mol. Evol. | article | |

BibTeX:
@article{Johnson1986, author = {M. S. Johnson and R. F. Doolittle}, title = {A method for the simultaneous alignment of three or more amino acid sequences}, journal = {J. Mol. Evol.}, year = {1986}, volume = {23}, pages = {267--278} } |
|||||

Johtela, T., Smed, J., Hakonen, H. & Raita, T. | An efficient heuristic for the lcs problem [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Johtela1996, author = {T. Johtela and J. Smed and H. Hakonen and T. Raita}, title = {An efficient heuristic for the lcs problem}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {126--140} } |
|||||

Jokinen, P., Tarhio, J. & Ukkonen, E. | A comparison of approximate string matching algorithms [BibTeX] |
1996 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Jokinen1996, author = {P. Jokinen and J. Tarhio and E. Ukkonen}, title = {A comparison of approximate string matching algorithms}, journal = {Softw. Pract. Exp.}, year = {1996}, volume = {26}, number = {12}, pages = {1439--1458} } |
|||||

Jokinen, P., Tarhio, J. & Ukkonen, E. | A comparison of approximate string matching algorithms [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Jokinen1991, author = {P. Jokinen and J. Tarhio and E. Ukkonen}, title = {A comparison of approximate string matching algorithms}, year = {1991}, number = {A-1991-7} } |
|||||

Jokinen, P. & Ukkonen, E. | Two algorithms for approximate string matching in static texts [BibTeX] |
1991 | Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Jokinen1991a, author = {P. Jokinen and E. Ukkonen}, title = {Two algorithms for approximate string matching in static texts}, booktitle = {Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1991}, number = {520}, pages = {240--248} } |
|||||

Jones, L. P., Gassie, E. W. & Radhakrishnan, S. | PORTREP: a portable repeated string finder [BibTeX] |
1989 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Jones1989, author = {L. P. Jones and E. W. Gassie and S. Radhakrishnan}, title = {{PORTREP}: a portable repeated string finder}, journal = {Softw. Pract. Exp.}, year = {1989}, volume = {19}, number = {1}, pages = {63--77} } |
|||||

Jones, N. D. | A note on linear time simulation of deterministic two-way pushdown automata [BibTeX] |
1977 | Inf. Process. Lett. | article | |

BibTeX:
@article{Jones1977, author = {N. D. Jones}, title = {A note on linear time simulation of deterministic two-way pushdown automata}, journal = {Inf. Process. Lett.}, year = {1977}, volume = {6}, number = {4}, pages = {110--112} } |
|||||

Joseph, D., Meidanis, J. & Tiwari, P. | Determining DNA sequences similarity using maximum independant set algorithms for interval graphs [BibTeX] |
1992 | Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory | inproceedings | |

BibTeX:
@inproceedings{Joseph1992, author = {D. Joseph and J. Meidanis and P. Tiwari}, title = {Determining {DNA} sequences similarity using maximum independant set algorithms for interval graphs}, booktitle = {Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {621}, pages = {326--337} } |
|||||

Julian, D. & Davies, M. | String matching in text editors [BibTeX] |
1982 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Julian1982, author = {D. Julian and M. Davies}, title = {String matching in text editors}, journal = {Softw. Pract. Exp.}, year = {1982}, volume = {12}, number = {8}, pages = {709--717} } |
|||||

Julich, A. | Implementations of BLAST for parallel computers [BibTeX] |
1995 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Julich1995, author = {A. Julich}, title = {Implementations of {BLAST} for parallel computers}, journal = {Comput. Appl. Biosci.}, year = {1995}, volume = {11}, number = {1}, pages = {3--6} } |
|||||

Just, W. & Vedova, G. D. | Multiple sequence alignment as a facility location problem [BibTeX] |
2000 | Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia | inproceedings | |

BibTeX:
@inproceedings{Just2000, author = {W. Just and G. Della Vedova}, title = {Multiple sequence alignment as a facility location problem}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia}, year = {2000}, pages = {60--70}, note = {Collaborative Report DC--2000--03} } |
|||||

Justin, J. & Pirillo, G. | On a combinatorial property of Sturmian words [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Justin1996, author = {J. Justin and G. Pirillo}, title = {On a combinatorial property of {Sturmian} words}, journal = {Theor. Comput. Sci.}, year = {1996}, volume = {154}, number = {2}, pages = {387--394} } |
|||||

Jájá, J. | An introduction to parallel algorithms [BibTeX] |
1992 | book | ||

BibTeX:
@book{J'aj'a1992, author = {J. J{\'a}j{\'a}}, title = {An introduction to parallel algorithms}, publisher = {Addison-Wesley}, year = {1992} } |
|||||

Jájá, J., Ryu, K. & Vishkin, U. | Sorting strings and constructing digital search trees in parallel [BibTeX] |
1996 | Theor. Comput. Sci. | article | |

BibTeX:
@article{J'aj'a1996, author = {J. J{\'a}j{\'a} and K.W. Ryu and U. Vishkin}, title = {Sorting strings and constructing digital search trees in parallel}, journal = {Theor. Comput. Sci.}, year = {1996}, volume = {154}, number = {2}, pages = {225--245} } |
|||||

Kandel, D., Matias, Y., Unger, R. & Winkler, P. | Shuffling Biological Sequences [BibTeX] |
1996 | Discret. Appl. Math. | article | |

BibTeX:
@article{Kandel1996, author = {D. Kandel and Y. Matias and R. Unger and P. Winkler}, title = {Shuffling Biological Sequences}, journal = {Discret. Appl. Math.}, year = {1996}, volume = {71}, number = {1--3}, pages = {171--185} } |
|||||

Kannan, S. K. & Myers, E. W. | An algorithm for locating non-overlapping regions of maximum alignment score [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kannan1993, author = {S. K. Kannan and E. W. Myers}, title = {An algorithm for locating non-overlapping regions of maximum alignment score}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {74--86} } |
|||||

Kao, M. | Tree Contractions and Evolutionary Trees [BibTeX] |
1998 | SIAM J. Comput. | article | |

BibTeX:
@article{Kao1998, author = {M.-Y. Kao}, title = {Tree Contractions and Evolutionary Trees}, journal = {SIAM J. Comput.}, year = {1998}, volume = {27}, number = {6}, pages = {1592--1616} } |
|||||

Kao, M., Lam, T. W., Sung, W. & Ting, H. | A Faster and Unifying Algorithm for Comparing Trees [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kao2000, author = {M.-Y. Kao and T. W. Lam and W.-K. Sung and H.-F. Ting}, title = {A Faster and Unifying Algorithm for Comparing Trees}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {129--142} } |
|||||

Kao, M. & Tate, S. R. | Online matching with blocked input [BibTeX] |
1991 | Inf. Process. Lett. | article | |

BibTeX:
@article{Kao1991, author = {M.-Y. Kao and S. R. Tate}, title = {Online matching with blocked input}, journal = {Inf. Process. Lett.}, year = {1991}, volume = {38}, number = {3}, pages = {113--116} } |
|||||

Karhumäki, J. | On cube-free omega-words generated by binary morphisms [BibTeX] |
1983 | Discret. Appl. Math. | article | |

BibTeX:
@article{Karhumaki1983, author = {J. Karhum{\"a}ki}, title = {On cube-free \emph{\omega}-words generated by binary morphisms}, journal = {Discret. Appl. Math.}, year = {1983}, volume = {5}, pages = {279--297} } |
|||||

Karhumäki, J., Manuch, J. & Plandowski, W. | On Defect Effect of Bi-Infinite Words [BibTeX] |
1998 | Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Karhumaki1998, author = {J. Karhum{\"a}ki and J. Manuch and W. Plandowski}, title = {On Defect Effect of Bi-Infinite Words}, booktitle = {Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1450}, pages = {674--682} } |
|||||

Karhumäki, J., Plandowski, W. & Rytter, W. | Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata [BibTeX] |
2000 | Nordic J. Comput. | article | |

BibTeX:
@article{Karhumaki2000, author = {J. Karhum{\"a}ki and W. Plandowski and W. Rytter}, title = {Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata}, journal = {Nordic J. Comput.}, year = {2000}, volume = {7}, number = {1}, pages = {1--13} } |
|||||

Karhumäki, J., Plandowski, W. & Rytter, W. | The Compression of Subsegments of Images Described by Finite Automata [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Karhumaki1999, author = {J. Karhum{\"a}ki and W. Plandowski and W. Rytter}, title = {The Compression of Subsegments of Images Described by Finite Automata}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {186--195} } |
|||||

Karhumäki, J., Plandowski, W. & Rytter, W. | Generalized factorizations of words and their algorithmic properties [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Karhumaki1999a, author = {J. Karhum{\"a}ki and W. Plandowski and W. Rytter}, title = {Generalized factorizations of words and their algorithmic properties}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {218}, number = {1}, pages = {123--133} } |
|||||

Karhumäki, J., Plandowski, W. & Rytter, W. | On the Complexity of Computing the Order of Repetition of a String [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Karhumaki1998a, author = {J. Karhum{\"a}ki and W. Plandowski and W. Rytter}, title = {On the Complexity of Computing the Order of Repetition of a String}, year = {1998}, number = {TUCS-TR-226} } |
|||||

Kari, L., Mateescu, A., Paun, G. & Salomaa, A. | On parallel deletions applied to aword [BibTeX] |
1995 | RAIRO Inform. Théor. Appl. | article | |

BibTeX:
@article{Kari1995, author = {L. Kari and A. Mateescu and G. Paun and A. Salomaa}, title = {On parallel deletions applied to aword}, journal = {RAIRO Inform. Th{\'e}or. Appl.}, year = {1995}, volume = {29}, number = {2}, pages = {129--144} } |
|||||

Karlin, S., Ghandour, G., Ost, F., Tavare, S. & Korn, J. L. | New approaches for computer analysis of nucleic acid sequences [BibTeX] |
1983 | Proc. Natl. Acad. Sci. U.S.A. | article | |

BibTeX:
@article{Karlin1983, author = {S. Karlin and G. Ghandour and F. Ost and S. Tavare and J. L. Korn}, title = {New approaches for computer analysis of nucleic acid sequences}, journal = {Proc. Natl. Acad. Sci. U.S.A.}, year = {1983}, volume = {80}, pages = {5660--5664} } |
|||||

Karlin, S., Morris, M., Ghandour, G. & Leung, M. | Efficient algorithms for molecular sequence analysis [BibTeX] |
1988 | Proc. Natl. Acad. Sci. U.S.A. | article | |

BibTeX:
@article{Karlin1988, author = {S. Karlin and M. Morris and G. Ghandour and M.-Y. Leung}, title = {Efficient algorithms for molecular sequence analysis}, journal = {Proc. Natl. Acad. Sci. U.S.A.}, year = {1988}, volume = {85}, pages = {841--845} } |
|||||

Karlin, S. & Ost, F. | Maximum length of common words among random letter sequences [BibTeX] |
1988 | Ann. Appl. Probab. | article | |

BibTeX:
@article{Karlin1988a, author = {S. Karlin and F. Ost}, title = {Maximum length of common words among random letter sequences}, journal = {Ann. Appl. Probab.}, year = {1988}, volume = {16}, pages = {535--563} } |
|||||

Karlin, S. & Ost, F. | Counts of long aligned matches among random letter sequences [BibTeX] |
1987 | Ann. Appl. Probab. | article | |

BibTeX:
@article{Karlin1987, author = {S. Karlin and F. Ost}, title = {Counts of long aligned matches among random letter sequences}, journal = {Ann. Appl. Probab.}, year = {1987}, volume = {19}, pages = {239--351} } |
|||||

Karlin, S., Trickey, H. W. & Ullman, J. D. | Algorithms for the compilation of regular expressions into PLAs [BibTeX] |
1987 | Algorithmica | article | |

BibTeX:
@article{Karlin1987a, author = {S. Karlin and H. W. Trickey and J. D. Ullman}, title = {Algorithms for the compilation of regular expressions into {PLAs}}, journal = {Algorithmica}, year = {1987}, volume = {2}, pages = {283--314} } |
|||||

Karloff, H. | Fast algorithms for approximately counting mismatches [BibTeX] |
1993 | Inf. Process. Lett. | article | |

BibTeX:
@article{Karloff1993, author = {H. Karloff}, title = {Fast algorithms for approximately counting mismatches}, journal = {Inf. Process. Lett.}, year = {1993}, volume = {48}, number = {2}, pages = {53--60} } |
|||||

Karp, R. M. | On-line Algorithms Versus Off-line Algorithms: How much is it Worth to Know the future [BibTeX] |
1992 | Algorithms, Software, Architecture | incollection | |

BibTeX:
@incollection{Karp1992, author = {R. M. Karp}, title = {On-line Algorithms Versus Off-line Algorithms: How much is it Worth to Know the future}, booktitle = {Algorithms, Software, Architecture}, publisher = {Elsevier Science Publishers B.V.}, year = {1992}, volume = {Information Processing 92, Volume I}, pages = {416--429} } |
|||||

Karp, R. M., Miller, R. E. & Rosenberg, A. L. | Rapid identification of repeated patterns in strings, trees and arrays [BibTeX] |
1972 | Proceedings of the 4th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Karp1972, author = {R. M. Karp and R. E. Miller and A. L. Rosenberg}, title = {Rapid identification of repeated patterns in strings, trees and arrays}, booktitle = {Proceedings of the 4th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1972}, pages = {125--136} } |
|||||

Karp, R. M. & Rabin, M. O. | Efficient randomized pattern-matching algorithms [BibTeX] |
1987 | IBM J. Res. Dev. | article | |

BibTeX:
@article{Karp1987, author = {R. M. Karp and M. O. Rabin}, title = {Efficient randomized pattern-matching algorithms}, journal = {IBM J. Res. Dev.}, year = {1987}, volume = {31}, number = {2}, pages = {249--260} } |
|||||

Karpinski, M. | Alphabet-independent optimal parallel search for three-dimensional patterns [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Karpinski1998, author = {M. Karpinski}, title = {Alphabet-independent optimal parallel search for three-dimensional patterns}, journal = {Theor. Comput. Sci.}, year = {1998}, volume = {205}, number = {1/2}, pages = {243--260} } |
|||||

Karpinski, M. & Rytter, W. | Alphabet-independent optimal parallel search for three-dimensional patterns [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Karpinski1998a, author = {M. Karpinski and W. Rytter}, title = {Alphabet-independent optimal parallel search for three-dimensional patterns}, journal = {Theor. Comput. Sci.}, year = {1998}, volume = {205}, number = {1--2}, pages = {243--260} } |
|||||

Karpinski, M. & Rytter, W. | An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns. [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Karpinski1994, author = {M. Karpinski and W. Rytter}, title = {An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns. }, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {125--135} } |
|||||

Karpinski, M. & Rytter, W. | An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns. [BibTeX] |
1993 | techreport | ||

BibTeX:
@techreport{Karpinski1993, author = {M. Karpinski and W. Rytter}, title = {An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns. }, year = {1993}, number = {070} } |
|||||

Karpinski, M., Rytter, W. & Shinohara, A. | An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions [BibTeX] |
1997 | Nordic J. Comput. | article | |

BibTeX:
@article{Karpinski1997, author = {M. Karpinski and W. Rytter and A. Shinohara}, title = {An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions}, journal = {Nordic J. Comput.}, year = {1997}, volume = {4}, number = {2}, pages = {172--186} } |
|||||

Karpinski, M., Rytter, W. & Shinohara, A. | Pattern-matching for strings with short descriptions [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Karpinski1995, author = {M. Karpinski and W. Rytter and A. Shinohara}, title = {Pattern-matching for strings with short descriptions}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {205--214} } |
|||||

Kasami, T. | An efficient recognition and syntax analysis algorithm for context-free languages [BibTeX] |
1963 | techreport | ||

BibTeX:
@techreport{Kasami1963, author = {T. Kasami}, title = {An efficient recognition and syntax analysis algorithm for context-free languages}, year = {1963}, number = {AFCRL-65-758} } |
|||||

Kasaraju, S. R. | Efficient tree pattern matching [BibTeX] |
1989 | Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Kasaraju1989, author = {S. R. Kasaraju}, title = {Efficient tree pattern matching}, booktitle = {Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1989}, pages = {178--183} } |
|||||

Kasaraju, S. R. | Efficient string matching [BibTeX] |
1988 | unpublished | ||

BibTeX:
@unpublished{Kasaraju1988, author = {S. R. Kasaraju}, title = {Efficient string matching}, year = {1988}, note = {Extended abstract, Department of Computer Science, John Hopkins University} } |
|||||

Kashyap, R. L. & Oommen, B. J. | String correction using probabilistic methods [BibTeX] |
1984 | Pattern Recognit. Lett. | article | |

BibTeX:
@article{Kashyap1984, author = {R. L. Kashyap and B. J. Oommen}, title = {String correction using probabilistic methods}, journal = {Pattern Recognit. Lett.}, year = {1984}, pages = {147--154} } |
|||||

Kashyap, R. L. & Oommen, B. J. | A common basis for similarity and dissimilarity measures involving two strings [BibTeX] |
1983 | Int. J. Comput. Math. | article | |

BibTeX:
@article{Kashyap1983, author = {R. L. Kashyap and B. J. Oommen}, title = {A common basis for similarity and dissimilarity measures involving two strings}, journal = {Int. J. Comput. Math.}, year = {1983}, volume = {13}, pages = {17--40} } |
|||||

Kashyap, R. L. & Oommen, B. J. | Similarity measures for set of strings [BibTeX] |
1983 | Int. J. Comput. Math. | article | |

BibTeX:
@article{Kashyap1983a, author = {R. L. Kashyap and B. J. Oommen}, title = {Similarity measures for set of strings}, journal = {Int. J. Comput. Math.}, year = {1983}, volume = {13}, pages = {95--104} } |
|||||

Kashyap, R. L. & Oommen, B. J. | The noisy substring matching problem [BibTeX] |
1983 | IEEE Trans. Softw. Eng. | article | |

BibTeX:
@article{Kashyap1983b, author = {R. L. Kashyap and B. J. Oommen}, title = {The noisy substring matching problem}, journal = {IEEE Trans. Softw. Eng.}, year = {1983}, volume = {9}, number = {3}, pages = {365--370} } |
|||||

Kashyap, R. L. & Oommen, B. J. | An effective algorithm for string correction using generalized edit distances I: description of the algorithm and its optimality [BibTeX] |
1981 | Inf. Sci. | article | |

BibTeX:
@article{Kashyap1981, author = {R. L. Kashyap and B. J. Oommen}, title = {An effective algorithm for string correction using generalized edit distances {I}: description of the algorithm and its optimality}, journal = {Inf. Sci.}, year = {1981}, volume = {23}, number = {2}, pages = {123--142} } |
|||||

Katajainen, J. & Raita, T. | An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding [BibTeX] |
1992 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Katajainen1992, author = {J. Katajainen and T. Raita}, title = {An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding}, journal = {J. Assoc. Comput. Mach.}, year = {1992}, volume = {39}, number = {2}, pages = {281--294} } |
|||||

Katajainen, J. & Raita, T. | An approximation algorithm for space-optimal encoding [BibTeX] |
1989 | Comput. J. | article | |

BibTeX:
@article{Katajainen1989, author = {J. Katajainen and T. Raita}, title = {An approximation algorithm for space-optimal encoding}, journal = {Comput. J.}, year = {1989}, volume = {32}, pages = {228--237} } |
|||||

Kececioglu, J. | The maximum weight trace problem in multiple sequence alignment [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kececioglu1993, author = {J. Kececioglu}, title = {The maximum weight trace problem in multiple sequence alignment}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {106--119} } |
|||||

Kececioglu, J. | Exact and approximation algorithms for DNA sequence reconstruction [BibTeX] |
1991 | School: Department of Computer Science, University of Arizona, Tucson |
phdthesis | |

BibTeX:
@phdthesis{Kececioglu1991, author = {J. Kececioglu}, title = {Exact and approximation algorithms for {DNA} sequence reconstruction}, school = {Department of Computer Science, University of Arizona, Tucson}, year = {1991} } |
|||||

Kececioglu, J., Li, M. & Tromp, J. | Inferring a DNA sequence from erroneous copies [BibTeX] |
1997 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Kececioglu1997, author = {J. Kececioglu and M. Li and J. Tromp}, title = {Inferring a {DNA} sequence from erroneous copies}, journal = {Theor. Comput. Sci.}, year = {1997}, volume = {185}, number = {1}, pages = {3--113} } |
|||||

Kececioglu, J. & Myers, E. W. | Combinatorial algorithms for DNA sequence assembly [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@article{Kececioglu1995, author = {J. Kececioglu and E. W. Myers}, title = {Combinatorial algorithms for {DNA} sequence assembly}, journal = {Algorithmica}, year = {1995}, volume = {13}, number = {1/2}, pages = {7--51} } |
|||||

Kececioglu, J. & Myers, E. W. | Combinatorial algorithms for DNA sequence assembly [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Kececioglu1992, author = {J. Kececioglu and E. W. Myers}, title = {Combinatorial algorithms for {DNA} sequence assembly}, year = {1992}, number = {TR92-37} } |
|||||

Kececioglu, J. & Ravi, R. | Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation [BibTeX] |
1995 | Proceedings of the 6th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Kececioglu1995a, author = {J. Kececioglu and R. Ravi}, title = {Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation}, booktitle = {Proceedings of the 6th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1995}, pages = {604--613} } |
|||||

Kececioglu, J. & Sankoff, D. | Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@article{Kececioglu1995b, author = {J. Kececioglu and D. Sankoff}, title = {Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement}, journal = {Algorithmica}, year = {1995}, volume = {13}, number = {1/2}, pages = {180--210} } |
|||||

Kececioglu, J. & Sankoff, D. | Efficient Bounds for Oriented Chromosome Inversion Distance [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kececioglu1994, author = {J. Kececioglu and D. Sankoff}, title = {Efficient Bounds for Oriented Chromosome Inversion Distance}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {307--325} } |
|||||

Kececioglu, J. & Sankoff, D. | Exact and approximation algorithms for the inversion distance between two chromosomes [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kececioglu1993a, author = {J. Kececioglu and D. Sankoff}, title = {Exact and approximation algorithms for the inversion distance between two chromosomes}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {87--105} } |
|||||

Kececioglu, J. & Zhang, W. | Aligning alignments [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kececioglu1998, author = {J. Kececioglu and W. Zhang}, title = {Aligning alignments}, booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1448}, pages = {189--208} } |
|||||

Kedem, Z. M., Landau, G. M. & Palem, K. V. | Parallel suffix-prefix-matching algorithms and applications [BibTeX] |
1996 | SIAM J. Comput. | article | |

BibTeX:
@article{Kedem1996, author = {Z. M. Kedem and G. M. Landau and K. V. Palem}, title = {Parallel suffix-prefix-matching algorithms and applications}, journal = {SIAM J. Comput.}, year = {1996}, volume = {25}, number = {5}, pages = {998--1023} } |
|||||

Kedem, Z. M., Landau, G. M. & Palem, K. V. | Optimal parallel suffix-prefix matching algorithms and applications [BibTeX] |
1989 | Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures | inproceedings | |

BibTeX:
@inproceedings{Kedem1989, author = {Z. M. Kedem and G. M. Landau and K. V. Palem}, title = {Optimal parallel suffix-prefix matching algorithms and applications}, booktitle = {Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures}, year = {1989}, pages = {388--398} } |
|||||

Kedem, Z. M. & Palem, K. V. | Optimal parallel algorithms for forest and term matching [BibTeX] |
1989 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Kedem1989a, author = {Z. M. Kedem and K. V. Palem}, title = {Optimal parallel algorithms for forest and term matching}, journal = {Theor. Comput. Sci.}, year = {1989}, volume = {93}, number = {2}, pages = {245--264} } |
|||||

Kemp, R. | Generating Words Lexicographically: An Average-Case Analysis [BibTeX] |
1998 | Acta Inform. | article | |

BibTeX:
@article{Kemp1998, author = {R. Kemp}, title = {Generating Words Lexicographically: An Average-Case Analysis}, journal = {Acta Inform.}, year = {1998}, volume = {35}, number = {1}, pages = {17--89} } |
|||||

Kempf, M., Bayer, R. & Güntzer, U. | Time optimal left to right construction of position trees [BibTeX] |
1987 | Acta Inform. | article | |

BibTeX:
@article{Kempf1987, author = {M. Kempf and R. Bayer and U. G{\"u}ntzer}, title = {Time optimal left to right construction of position trees}, journal = {Acta Inform.}, year = {1987}, volume = {24}, number = {4}, pages = {461--474} } |
|||||

Kesner, D. | Pattern matching in order-sorted languages [BibTeX] |
1991 | Proceedings 16th Symposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Kesner1991, author = {D. Kesner}, title = {Pattern matching in order-sorted languages}, booktitle = {Proceedings 16th Symposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1991}, number = {520}, pages = {267--276} } |
|||||

Kfoury, A. J. | A Linear-time Algorithm to Decide whether a Binary Word Contains an Overlap [BibTeX] |
1988 | RAIRO Inform. Théor. Appl. | article | |

BibTeX:
@article{Kfoury1988, author = {A. J. Kfoury}, title = {A Linear-time Algorithm to Decide whether a Binary Word Contains an Overlap}, journal = {RAIRO Inform. Th{\'e}or. Appl.}, year = {1988}, volume = {22}, pages = {135--145} } |
|||||

Kfoury, A. J. | A Linear-time Algorithm to Decide whether a Binary Word Contains an Overlap [BibTeX] |
1986 | Bulletin of the European Association for Theoretical Computer Science | article | |

BibTeX:
@article{Kfoury1986, author = {A. J. Kfoury}, title = {A Linear-time Algorithm to Decide whether a Binary Word Contains an Overlap}, journal = {Bulletin of the European Association for Theoretical Computer Science}, year = {1986}, volume = {30}, pages = {74--80} } |
|||||

Kida, T., Takeda, M., Shinohara, A. & Arikawa, S. | Shift-And Approach to Pattern Matching in LZW Compressed Text [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kida1999, author = {T. Kida and M. Takeda and A. Shinohara and S. Arikawa}, title = {{Shift-And} Approach to Pattern Matching in {LZW} Compressed Text}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {1--13} } |
|||||

Kida, T., Takeda, M., Shinohara, A., Niyazaki, M. & Arikawa, S. | Multiple Pattern Matching in LZW Compressed Text [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@article{Kida2000, author = {T. Kida and M. Takeda and A. Shinohara and M. Niyazaki and S. Arikawa}, title = {Multiple Pattern Matching in {LZW} Compressed Text}, journal = {J. Discret. Algorithms}, year = {2000}, volume = {1}, number = {1}, pages = {133--158} } |
|||||

Kilpeläinen, P. | Tree Matching Problems with Applications to Structured Text Databases [BibTeX] |
1992 | School: University of Helsinki, Finland |
phdthesis | |

BibTeX:
@phdthesis{Kilpelainen1992, author = {P. Kilpel{\"a}inen}, title = {Tree Matching Problems with Applications to Structured Text Databases}, school = {University of Helsinki, Finland}, year = {1992} } |
|||||

Kilpeläinen, P. & Mannila, H. | Query Primitive for Tree-Structured Data [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kilpelainen1994, author = {P. Kilpel{\"a}inen and H. Mannila}, title = {Query Primitive for Tree-Structured Data}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {213--225} } |
|||||

Kilpeläinen, P. & Mannila, H. | Grammatical tree matching [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kilpelainen1992a, author = {P. Kilpel{\"a}inen and H. Mannila}, title = {Grammatical tree matching}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {644}, pages = {162--174} } |
|||||

Kilpeläinen, P. & Mannila, H. | The tree inclusion problem [BibTeX] |
1991 | Proceedings of the International Joint Conference on Theory and Practice of Software Development | inproceedings | |

BibTeX:
@inproceedings{Kilpelainen1991, author = {P. Kilpel{\"a}inen and H. Mannila}, title = {The tree inclusion problem}, booktitle = {Proceedings of the International Joint Conference on Theory and Practice of Software Development}, publisher = {Springer-Verlag, Berlin}, year = {1991}, number = {493}, pages = {202--214} } |
|||||

Kim, D. K., Kim, Y. A. & Park, K. | Constructing Suffix Arrays for Multi-Dimensional Matrices [BibTeX] |
1998 | Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kim1998, author = {D. K. Kim and Y. A. Kim and K. Park}, title = {Constructing Suffix Arrays for Multi-Dimensional Matrices}, booktitle = {Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1448}, pages = {126--139} } |
|||||

Kim, D. K., Lee, J. S., Park, K. & Cho, Y. | Efficient Algorithms for Approximate String Matching with Swaps [BibTeX] |
1999 | J. Complexity | article | |

BibTeX:
@article{Kim1999, author = {D. K. Kim and J. S. Lee and K. Park and Y. Cho}, title = {Efficient Algorithms for Approximate String Matching with Swaps}, journal = {J. Complexity}, year = {1999}, volume = {15}, pages = {128--147} } |
|||||

Kim, J. & Shawe-Taylor, J. | Fast string matching using n-gram [BibTeX] |
1994 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Kim1994, author = {J.-Y. Kim and J. Shawe-Taylor}, title = {Fast string matching using {\emph{n}}-gram}, journal = {Softw. Pract. Exp.}, year = {1994}, volume = {24}, number = {1}, pages = {79--88} } |
|||||

Kim, J. & Shawe-Taylor, J. | Fast expected two dimensional pattern matching [BibTeX] |
1993 | Proceedings of the 1st South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Kim1993, author = {J.-Y. Kim and J. Shawe-Taylor}, title = {Fast expected two dimensional pattern matching}, booktitle = {Proceedings of the 1st South American Workshop on String Processing}, year = {1993}, pages = {77--92} } |
|||||

Kim, J. & Shawe-Taylor, J. | Fast multiple keyword searching [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kim1992, author = {J.-Y. Kim and J. Shawe-Taylor}, title = {Fast multiple keyword searching}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {41--51} } |
|||||

Kim, J. & Shawe-Taylor, J. | An approximate string-matching algorithm [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Kim1992a, author = {J.-Y. Kim and J. Shawe-Taylor}, title = {An approximate string-matching algorithm}, journal = {Theor. Comput. Sci.}, year = {1992}, volume = {92}, number = {1}, pages = {107--117} } |
|||||

Kim, J. & Shawe-Taylor, J. | Fast expected string matching using an n-gram algorithm [BibTeX] |
1991 | techreport | ||

BibTeX:
@techreport{Kim1991, author = {J.-Y. Kim and J. Shawe-Taylor}, title = {Fast expected string matching using an {\emph{n}}-gram algorithm}, year = {1991}, number = {CSD-TR-91-16} } |
|||||

Kim, S. & Park, K. | A Dynamic Edit Distance Table [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kim2000, author = {S.-R. Kim and K. Park}, title = {A Dynamic Edit Distance Table}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {60--68} } |
|||||

Kimbrell, R. E. | Searching for text? Send an N-gram! [BibTeX] |
1988 | Byte | article | |

BibTeX:
@article{Kimbrell1988, author = {R. E. Kimbrell}, title = {Searching for text? Send an {\emph{N}}-gram!}, journal = {Byte}, year = {1988}, volume = {13}, number = {5}, pages = {297--312} } |
|||||

Kitajima, J., Navarro, G., Ribeiro-Neto, B. & Ziviani, N. | Distributed Generation of Suffix Arrays: A Quicksort Based Approach [BibTeX] |
1997 | Proceedings of the 4th South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Kitajima1997, author = {J.P. Kitajima and G. Navarro and B. Ribeiro-Neto and N. Ziviani}, title = {Distributed Generation of Suffix Arrays: A Quicksort Based Approach}, booktitle = {Proceedings of the 4th South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1997}, pages = {53--69} } |
|||||

Kitazume, Y., Ohira, E. & Endo, T. | LSI Implementation of a Pattern Matching Algorithm for Speech Recognition [BibTeX] |
1985 | IEEE Trans. Acoust. Speech Signal Process. | article | |

BibTeX:
@article{Kitazume1985, author = {Y. Kitazume and E. Ohira and T. Endo}, title = {{LSI} Implementation of a Pattern Matching Algorithm for Speech Recognition}, journal = {IEEE Trans. Acoust. Speech Signal Process.}, year = {1985}, volume = {33}, number = {1}, pages = {1} } |
|||||

Klawe, M. M. & Kleitman, D. J. | An almost linear time algorithm for generalized matrix searching [BibTeX] |
1988 | techreport | ||

BibTeX:
@techreport{Klawe1988, author = {M. M. Klawe and D. J. Kleitman}, title = {An almost linear time algorithm for generalized matrix searching}, year = {1988} } |
|||||

Klein, P. | Computing the Edit-Distance between Unrooted Ordered Trees [BibTeX] |
1998 | Proceedings of the 6th Annual European Symposium | inproceedings | |

BibTeX:
@inproceedings{Klein1998, author = {P. Klein}, title = {Computing the Edit-Distance between Unrooted Ordered Trees}, booktitle = {Proceedings of the 6th Annual European Symposium}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1461}, pages = {91--102} } |
|||||

Klein, S. T. | Improving Static Compression Schemes by Alphabet Extension [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Klein2000, author = {S. T. Klein}, title = {Improving Static Compression Schemes by Alphabet Extension}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {210--221} } |
|||||

Klein, S. T. | Space- and time-efficient decoding with canonical Huffman trees [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Klein1997, author = {S. T. Klein}, title = {Space- and time-efficient decoding with canonical {Huffman} trees}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {65--75} } |
|||||

Knecht, L. | Pairwise alignment with scoring on tuples [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Knecht1995, author = {L. Knecht}, title = {Pairwise alignment with scoring on tuples}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {215--229} } |
|||||

Knight, J. R. & Myers, E. W. | Super-pattern Matching [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@article{Knight1995, author = {J. R. Knight and E. W. Myers}, title = {Super-pattern Matching}, journal = {Algorithmica}, year = {1995}, volume = {13}, number = {1/2}, pages = {211--243} } |
|||||

Knight, J. R. & Myers, E. W. | Approximate regular expression pattern matching with concave gap penalties [BibTeX] |
1995 | Algorithmica | article | |

BibTeX:
@article{Knight1995a, author = {J. R. Knight and E. W. Myers}, title = {Approximate regular expression pattern matching with concave gap penalties}, journal = {Algorithmica}, year = {1995}, volume = {14}, number = {1}, pages = {85--121} } |
|||||

Knight, J. R. & Myers, E. W. | Approximate regular expression pattern matching with concave gap penalties [BibTeX] |
1992 | Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Knight1992, author = {J. R. Knight and E. W. Myers}, title = {Approximate regular expression pattern matching with concave gap penalties}, booktitle = {Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {664}, pages = {67--78} } |
|||||

Knight, J. R. & Myers, E. W. | Approximate regular expression pattern matching with concave gap penalties [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Knight1992a, author = {J. R. Knight and E. W. Myers}, title = {Approximate regular expression pattern matching with concave gap penalties}, year = {1992}, number = {92-12} } |
|||||

Knight, J. R. & Myers, E. W. | Super-pattern Matching [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Knight1992b, author = {J. R. Knight and E. W. Myers}, title = {Super-pattern Matching}, year = {1992}, number = {29} } |
|||||

Knuth, D. E. | Dynamic Huffman coding [BibTeX] |
1985 | J. Algorithms | article | |

BibTeX:
@article{Knuth1985, author = {D. E. Knuth}, title = {Dynamic Huffman coding}, journal = {J. Algorithms}, year = {1985}, volume = {6}, number = {2}, pages = {163--180} } |
|||||

Knuth, D. E. | The art of computer programming: fundamental algorithms [BibTeX] |
1973 | book | ||

BibTeX:
@book{Knuth1973, author = {D. E. Knuth}, title = {The art of computer programming: fundamental algorithms}, publisher = {Addison-Wesley}, year = {1973}, volume = {1} } |
|||||

Knuth, D. E. | The art of computer programming: seminumerical algorithms [BibTeX] |
1973 | book | ||

BibTeX:
@book{Knuth1973a, author = {D. E. Knuth}, title = {The art of computer programming: seminumerical algorithms}, publisher = {Addison-Wesley}, year = {1973}, volume = {2} } |
|||||

Knuth, D. E. | The art of computer programming: Sorting and searching [BibTeX] |
1973 | book | ||

BibTeX:
@book{Knuth1973b, author = {D. E. Knuth}, title = {The art of computer programming: Sorting and searching}, publisher = {Addison-Wesley}, year = {1973}, volume = {3} } |
|||||

Knuth, D. E., Morris, J. H. & Pratt, V. R. | Fast pattern matching in strings [BibTeX] |
1977 | SIAM J. Comput. | article | |

BibTeX:
@article{Knuth1977, author = {D. E. Knuth and Morris, Jr, J. H. and V. R. Pratt}, title = {Fast pattern matching in strings}, journal = {SIAM J. Comput.}, year = {1977}, volume = {6}, number = {1}, pages = {323--350} } |
|||||

Knuth, D. E. & Plass, M. F. | Breaking paragraphs into lines [BibTeX] |
1981 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Knuth1981, author = {D. E. Knuth and M. F. Plass}, title = {Breaking paragraphs into lines}, journal = {Softw. Pract. Exp.}, year = {1981}, volume = {11}, number = {11}, pages = {1119-1184} } |
|||||

Knuth, D. E. & Pratt, V. R. | Automata theory can be useful [BibTeX] |
1971 | techreport | ||

BibTeX:
@techreport{Knuth1971, author = {D. E. Knuth and V. R. Pratt}, title = {Automata theory can be useful}, year = {1971} } |
|||||

Ko, K. I. & Hua, C. M. | A note on the two variable pattern finding problem [BibTeX] |
1987 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Ko1987, author = {K. I. Ko and C. M. Hua}, title = {A note on the two variable pattern finding problem}, journal = {J. Comput. Syst. Sci.}, year = {1987}, volume = {34}, number = {1}, pages = {75--86} } |
|||||

Kohonen, T. & Reuhkala, E. | A very fast associative method for the recognition and correction of misspelt words, based on redundant hash-addressing [BibTeX] |
1978 | Proceedings of the 4th Joint Conference on Pattern Recognition | inproceedings | |

BibTeX:
@inproceedings{Kohonen1978, author = {T. Kohonen and E. Reuhkala}, title = {A very fast associative method for the recognition and correction of misspelt words, based on redundant hash-addressing}, booktitle = {Proceedings of the 4th Joint Conference on Pattern Recognition}, year = {1978}, pages = {807--809} } |
|||||

Kolpakov, R. & Kucherov, G. | On Maximal Repetitions in Words [BibTeX] |
2000 | J. Discret. Algorithms | article | |

BibTeX:
@article{Kolpakov2000, author = {R. Kolpakov and G. Kucherov}, title = {On Maximal Repetitions in Words}, journal = {J. Discret. Algorithms}, year = {2000}, volume = {1}, number = {1}, pages = {159--186} } |
|||||

Kolpakov, R. & Kucherov, G. | On Maximal Repetitions in Words [BibTeX] |
1999 | Proceedings of the 12th International Symposium on Fundamentals of Computation Theory | inproceedings | |

BibTeX:
@inproceedings{Kolpakov1999, author = {R. Kolpakov and G. Kucherov}, title = {On Maximal Repetitions in Words}, booktitle = {Proceedings of the 12th International Symposium on Fundamentals of Computation Theory}, publisher = {Springer-Verlag, Berlin}, year = {1999}, volume = {1684}, pages = {374--385} } |
|||||

Kolpakov, R. & Kucherov, G. | On the sum of exponents of maximal repetitions in a word [BibTeX] |
1999 | techreport | ||

BibTeX:
@techreport{Kolpakov1999a, author = {R. Kolpakov and G. Kucherov}, title = {On the sum of exponents of maximal repetitions in a word}, year = {1999}, number = {LORIA 99-R-034} } |
|||||

Kolpakov, R. & Kucherov, G. | Finding Maximal Repetitions in a Word in Linear Time [BibTeX] |
1999 | Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Kolpakov1999b, author = {R. Kolpakov and G. Kucherov}, title = {Finding Maximal Repetitions in a Word in Linear Time}, booktitle = {Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1999}, pages = {596--604} } |
|||||

Kolpakov, R. & Kucherov, G. | Maximal Repetitions in Words or How to Find all Squares in Linear Time [BibTeX] |
1998 | techreport | ||

BibTeX:
@techreport{Kolpakov1998, author = {R. Kolpakov and G. Kucherov}, title = {Maximal Repetitions in Words or How to Find all Squares in Linear Time}, year = {1998}, number = {LORIA 98-R-227} } |
|||||

Kolpakov, R., Kucherov, G. & Tarannikov, Y. | On repetition-free binary words of minimal density [BibTeX] |
1999 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Kolpakov1999c, author = {R. Kolpakov and G. Kucherov and Y. Tarannikov}, title = {On repetition-free binary words of minimal density}, journal = {Theor. Comput. Sci.}, year = {1999}, volume = {218}, number = {1}, pages = {161--175} } |
|||||

Kolpakov, R., Kucherov, G. & Tarannikov, Y. | On Repetition-Free Binary Words of Minimal Density [BibTeX] |
1998 | Proceedings of the 23rdSymposium on Mathematical Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Kolpakov1998a, author = {R. Kolpakov and G. Kucherov and Y. Tarannikov}, title = {On Repetition-Free Binary Words of Minimal Density}, booktitle = {Proceedings of the 23rdSymposium on Mathematical Foundations of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1998}, number = {1450}, pages = {683--692} } |
|||||

Komatsoulis, G. A. & Waterman, M. S. | Chimeric Alignment by Dynamic Programming: Algorithm and Biological Uses [BibTeX] |
1997 | Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB) | inproceedings | |

BibTeX:
@inproceedings{Komatsoulis1997, author = {G. A. Komatsoulis and M. S. Waterman}, title = {Chimeric Alignment by Dynamic Programming: Algorithm and Biological Uses}, booktitle = {Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB)}, publisher = {ACM Press}, year = {1997}, pages = {174--180} } |
|||||

Kontoyiannis, I. & Suhov, Y. M. | Stationary Entrophy Estimation via String Matching [BibTeX] |
1996 | Proceedings of the 6th Data Compression Conference | inproceedings | |

BibTeX:
@inproceedings{Kontoyiannis1996, author = {I. Kontoyiannis and Y. M. Suhov}, title = {Stationary Entrophy Estimation via String Matching}, booktitle = {Proceedings of the 6th Data Compression Conference}, publisher = {IEEE Computer Society Press}, year = {1996}, pages = {444} } |
|||||

Korn, D. G. & Vo, K. | SFIO: Safe/Fast String/File IO [BibTeX] |
1991 | Proceedings Summer USENIX Conference | inproceedings | |

BibTeX:
@inproceedings{Korn1991, author = {D. G. Korn and K.-P. Vo}, title = {{SFIO}: Safe/Fast String/File {IO}}, booktitle = {Proceedings Summer USENIX Conference}, year = {1991}, pages = {235--256} } |
|||||

Kosaraju, S. R. | Computation of Squares in String [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kosaraju1994, author = {S. R. Kosaraju}, title = {Computation of Squares in String}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {146--150} } |
|||||

Kosaraju, S. R. | Real-Time Pattern Matching and Quasi-Real-Time Construction of Suffix Tree [BibTeX] |
1994 | Proceedings of the 26th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Kosaraju1994a, author = {S. R. Kosaraju}, title = {Real-Time Pattern Matching and Quasi-Real-Time Construction of Suffix Tree}, booktitle = {Proceedings of the 26th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1994}, pages = {310--316} } |
|||||

Kosaraju, S. R. | Localized Search in Sorted Lists [BibTeX] |
1981 | Proceedings of the 13th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Kosaraju1981, author = {S. R. Kosaraju}, title = {Localized Search in Sorted Lists}, booktitle = {Proceedings of the 13th ACM Symposium on the Theory of Computing}, year = {1981}, pages = {62--69} } |
|||||

Kosaraju, S. R. & Delcher, A. L. | Correction: Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees [BibTeX] |
1996 | Proceedings of the 28th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Kosaraju1996, author = {S. R. Kosaraju and A. L. Delcher}, title = {Correction: {L}arge-Scale Assembly of {DNA} Strings and Space-Efficient Construction of Suffix Trees}, booktitle = {Proceedings of the 28th ACM Symposium on the Theory of Computing}, year = {1996}, pages = {659} } |
|||||

Kosaraju, S. R. & Delcher, A. L. | Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees [BibTeX] |
1995 | Proceedings of the 27th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Kosaraju1995, author = {S. R. Kosaraju and A. L. Delcher}, title = {Large-Scale Assembly of {DNA} Strings and Space-Efficient Construction of Suffix Trees}, booktitle = {Proceedings of the 27th ACM Symposium on the Theory of Computing}, year = {1995}, pages = {169--177} } |
|||||

Kosaraju, S. R., Park, J. & Stein, C. | Long Tours and Short Superstrings [BibTeX] |
1994 | Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Kosaraju1994b, author = {S. R. Kosaraju and J.K. Park and C. Stein}, title = {Long Tours and Short Superstrings}, booktitle = {Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {ACM Press}, year = {1994}, pages = {166--177} } |
|||||

Kowalski, G. & Meltzer, A. | New multi-term high speed text search algorithms [BibTeX] |
1984 | Proceedings of the 1st IEEE Conference on Computer Applications | inproceedings | |

BibTeX:
@inproceedings{Kowalski1984, author = {G. Kowalski and A. Meltzer}, title = {New multi-term high speed text search algorithms}, booktitle = {Proceedings of the 1st IEEE Conference on Computer Applications}, year = {1984}, pages = {514--522} } |
|||||

Krichevsky, R. E. | Occam's Razor, Partially Specified Boolean Functions, String Matching, and Independent Sets [BibTeX] |
1994 | Inf. Comput. | article | |

BibTeX:
@article{Krichevsky1994, author = {R. E. Krichevsky}, title = {Occam's Razor, Partially Specified {Boolean} Functions, String Matching, and Independent Sets}, journal = {Inf. Comput.}, year = {1994}, volume = {108}, number = {1}, pages = {158--174} } |
|||||

Krithivasan, K. & Sitalakshmi, R. | Efficient two-dimensional pattern matching in the presence of errors [BibTeX] |
1987 | Inf. Sci. | article | |

BibTeX:
@article{Krithivasan1987, author = {K. Krithivasan and R. Sitalakshmi}, title = {Efficient two-dimensional pattern matching in the presence of errors}, journal = {Inf. Sci.}, year = {1987}, volume = {43}, pages = {169--184} } |
|||||

Krogh, F. | Notes on a Very Fast Substring Search Algorithm [BibTeX] |
1992 | Commun. ACM | article | |

BibTeX:
@article{Krogh1992, author = {F.T. Krogh}, title = {Notes on a Very Fast Substring Search Algorithm}, journal = {Commun. ACM}, year = {1992}, volume = {35}, number = {4}, pages = {132} } |
|||||

Kruskal, J. B. | An overview of sequence comparison: time warps, string edits, and macromolecules [BibTeX] |
1983 | SIAM Rev. | article | |

BibTeX:
@article{Kruskal1983, author = {J. B. Kruskal}, title = {An overview of sequence comparison: time warps, string edits, and macromolecules}, journal = {SIAM Rev.}, year = {1983}, volume = {25}, pages = {201--237} } |
|||||

Kucherov, G. & Rusinowitch, M. | Matching a set of strings with variable length don't cares [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kucherov1995, author = {G. Kucherov and M. Rusinowitch}, title = {Matching a set of strings with variable length don't cares}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {230--247} } |
|||||

Kukich, K. | Techniques for automatically correcting words in text [BibTeX] |
1992 | ACM Comp. Surv. | article | |

BibTeX:
@article{Kukich1992, author = {K. Kukich}, title = {Techniques for automatically correcting words in text}, journal = {ACM Comp. Surv.}, year = {1992}, volume = {24}, number = {4}, pages = {377--439} } |
|||||

Kulkarni, R., Date, S. & Kulkarni, B. | PRAS: Parallel Alignment of Sequences Algorithm [BibTeX] |
1993 | Parallel Process. Lett. | article | |

BibTeX:
@article{Kulkarni1993, author = {R. Kulkarni and S. Date and B. Kulkarni}, title = {{PRAS: Parallel Alignment of Sequences Algorithm}}, journal = {Parallel Process. Lett.}, year = {1993}, volume = {3}, number = {3}, pages = {243--252} } |
|||||

Kulp, D. C. | Very fast pattern matching for highly repetitive text [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Kulp1992, author = {D. C. Kulp}, title = {Very fast pattern matching for highly repetitive text}, year = {1992} } |
|||||

Kumar, S. & Spafford, E. | A pattern-matching model for intrusion detection [BibTeX] |
1994 | Proceedings National Computer Security Conference | inproceedings | |

BibTeX:
@inproceedings{Kumar1994, author = {S. Kumar and E. Spafford}, title = {A pattern-matching model for intrusion detection}, booktitle = {Proceedings National Computer Security Conference}, year = {1994}, pages = {11--21} } |
|||||

Kumar, S. K. & Rangan, C. P. | A linear-space algorithm for the LCS problem [BibTeX] |
1987 | Acta Inform. | article | |

BibTeX:
@article{Kumar1987, author = {S. K. Kumar and C. P. Rangan}, title = {A linear-space algorithm for the {LCS} problem}, journal = {Acta Inform.}, year = {1987}, volume = {24}, number = {3}, pages = {353--362} } |
|||||

Kuo, S. & Cross, G. R. | A two--step string--matching procedure [BibTeX] |
1991 | Pattern Recognit. | article | |

BibTeX:
@article{Kuo1991, author = {S. Kuo and G. R. Cross}, title = {A two--step string--matching procedure}, journal = {Pattern Recognit.}, year = {1991}, volume = {24}, pages = {711--716} } |
|||||

Kuo, S. & Cross, G. R. | An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings [BibTeX] |
1989 | SIGIR Forum | article | |

BibTeX:
@article{Kuo1989, author = {S. Kuo and G. R. Cross}, title = {An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings}, journal = {SIGIR Forum}, year = {1989}, volume = {23} } |
|||||

Kurtz, S. | Reducing the Space Requirements of Suffix Trees [BibTeX] |
1999 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Kurtz1999, author = {S. Kurtz}, title = {Reducing the Space Requirements of Suffix Trees}, journal = {Softw. Pract. Exp.}, year = {1999}, volume = {29}, number = {13}, pages = {1149--1171} } |
|||||

Kurtz, S. | Approximate string searching under weighted edit distance [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Kurtz1996, author = {S. Kurtz}, title = {Approximate string searching under weighted edit distance}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {156--170} } |
|||||

Kurtz, S. & Myers, G. | Estimating the probability of approximate matches [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Kurtz1997, author = {S. Kurtz and G. Myers}, title = {Estimating the probability of approximate matches}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {52--64} } |
|||||

Kärkkäinen, J. | Suffix cactus: a cross between suffix tree and suffix array [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Karkkainen1995, author = {J. K{\"a}rkk{\"a}inen}, title = {Suffix cactus: a cross between suffix tree and suffix array}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {191--204} } |
|||||

Kärkkäinen, J., Navarro, G. & Ukkonen, E. | Approximate String Matching over Ziv-Lempel Compressed Text [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Karkkainen2000, author = {J. K{\"a}rkk{\"a}inen and G. Navarro and E. Ukkonen}, title = {Approximate String Matching over Ziv-Lempel Compressed Text}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {195--209} } |
|||||

Kärkkäinen, J. & Ukkonen, E. | Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time [BibTeX] |
2000 | SIAM J. Comput. | article | |

BibTeX:
@article{Karkkainen2000a, author = {J. K{\"a}rkk{\"a}inen and E. Ukkonen}, title = {Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time}, journal = {SIAM J. Comput.}, year = {2000}, volume = {29}, number = {2}, pages = {571--589} } |
|||||

Kärkkäinen, J. & Ukkonen, E. | Sparse Suffix Trees [BibTeX] |
1996 | Lecture Notes in Computer ScienceProceedings of the 2ndAnnual International Conference on Computing and Combinatorics | inproceedings | |

BibTeX:
@inproceedings{Karkkainen1996, author = {J. K{\"a}rkk{\"a}inen and E. Ukkonen}, title = {Sparse Suffix Trees}, booktitle = {Proceedings of the 2ndAnnual International Conference on Computing and Combinatorics}, journal = {Lecture Notes in Computer Science}, year = {1996}, volume = {1090}, pages = {219--230} } |
|||||

Kärkkäinen, J. & Ukkonen, E. | Lempel-Ziv parsing and sublinear-size index structures for string matching [BibTeX] |
1996 | Proceedings of the 3rd South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Karkkainen1996a, author = {J. K{\"a}rkk{\"a}inen and E. Ukkonen}, title = {Lempel-Ziv parsing and sublinear-size index structures for string matching}, booktitle = {Proceedings of the 3rd South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1996}, pages = {141--155} } |
|||||

Kärkkäinen, J. & Ukkonen, E. | Two and higher dimensional pattern matching in optimal expected time [BibTeX] |
1994 | Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Karkkainen1994, author = {J. K{\"a}rkk{\"a}inen and E. Ukkonen}, title = {Two and higher dimensional pattern matching in optimal expected time}, booktitle = {Proceedings of the 5th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1994}, pages = {715--723} } |
|||||

Ladner, R. E. & Fisher, M. J. | Parallel prefix computation [BibTeX] |
1980 | J. Assoc. Comput. Mach. | article | |

BibTeX:
@article{Ladner1980, author = {R. E. Ladner and M. J. Fisher}, title = {Parallel prefix computation}, journal = {J. Assoc. Comput. Mach.}, year = {1980}, volume = {27}, number = {4}, pages = {831--838} } |
|||||

Lakshmanan, K. B. | On universal codeword sets [BibTeX] |
1981 | IEEE Trans. Inf. Theory | article | |

BibTeX:
@article{Lakshmanan1981, author = {K. B. Lakshmanan}, title = {On universal codeword sets}, journal = {IEEE Trans. Inf. Theory}, year = {1981}, volume = {27}, pages = {659--662} } |
|||||

Lancia, G. & Ravi, R. | GESTALT: Genomic Steiner Alignments [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Lancia1999, author = {G. Lancia and R. Ravi}, title = {{GESTALT}: Genomic Steiner Alignments}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {101--114} } |
|||||

Lanctot, J. K., Li, M. & Yang, E. | Estimating DNA Sequence Entropy [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Lanctot2000, author = {J. K. Lanctot and M. Li and E. Yang}, title = {Estimating {DNA} Sequence Entropy}, booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {2000} } |
|||||

Landau, G. M. | String matching in erroneus input [BibTeX] |
1986 | School: Department of Computer Science, Tel-Aviv University |
phdthesis | |

BibTeX:
@phdthesis{Landau1986, author = {G. M. Landau}, title = {String matching in erroneus input}, school = {Department of Computer Science, Tel-Aviv University}, year = {1986} } |
|||||

Landau, G. M., Myers, E. W. & Schmidt, J. P. | Incremental string comparison [BibTeX] |
1998 | SIAM J. Comput. | article | |

BibTeX:
@article{Landau1998, author = {G. M. Landau and E. W. Myers and J. P. Schmidt}, title = {Incremental string comparison}, journal = {SIAM J. Comput.}, year = {1998}, volume = {27}, number = {2}, pages = {557--582} } |
|||||

Landau, G. M., Schieber, B. & Vishkin, U. | Parallel construction of a suffix tree [BibTeX] |
1987 | Proceedings of the 14th International Colloquium on Automata, Languages and Programming | inproceedings | |

BibTeX:
@inproceedings{Landau1987, author = {G. M. Landau and B. Schieber and U. Vishkin}, title = {Parallel construction of a suffix tree}, booktitle = {Proceedings of the 14th International Colloquium on Automata, Languages and Programming}, publisher = {Springer-Verlag, Berlin}, year = {1987}, number = {267}, pages = {314--325} } |
|||||

Landau, G. M. & Schmidt, J. P. | An algorithm for approximate tandem repeats [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Landau1993, author = {G. M. Landau and J. P. Schmidt}, title = {An algorithm for approximate tandem repeats}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {120--133} } |
|||||

Landau, G. M. & Vishkin, U. | Approximate string searching [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@incollection{Landau1997, author = {G. M. Landau and U. Vishkin}, title = {Approximate string searching}, booktitle = {Pattern matching algorithms}, publisher = {Oxford University Press}, year = {1997}, pages = {185--199} } |
|||||

Landau, G. M. & Vishkin, U. | Pattern Matching in Digitalized Image [BibTeX] |
1994 | Algorithmica | article | |

BibTeX:
@article{Landau1994, author = {G. M. Landau and U. Vishkin}, title = {Pattern Matching in Digitalized Image}, journal = {Algorithmica}, year = {1994}, volume = {12}, number = {4/5}, pages = {375--408} } |
|||||

Landau, G. M. & Vishkin, U. | Two dimensional pattern matching in digitized image [BibTeX] |
1993 | Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Landau1993a, author = {G. M. Landau and U. Vishkin}, title = {Two dimensional pattern matching in digitized image}, booktitle = {Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1993}, number = {684}, pages = {134--151} } |
|||||

Landau, G. M. & Vishkin, U. | Fast parallel and serial approximate string matching [BibTeX] |
1989 | J. Algorithms | article | |

BibTeX:
@article{Landau1989, author = {G. M. Landau and U. Vishkin}, title = {Fast parallel and serial approximate string matching}, journal = {J. Algorithms}, year = {1989}, volume = {10}, number = {2}, pages = {157--169} } |
|||||

Landau, G. M. & Vishkin, U. | Fast string matching with k differences [BibTeX] |
1988 | J. Comput. Syst. Sci. | article | |

BibTeX:
@article{Landau1988, author = {G. M. Landau and U. Vishkin}, title = {Fast string matching with {\emph{k}} differences}, journal = {J. Comput. Syst. Sci.}, year = {1988}, volume = {37}, number = {1}, pages = {63--78} } |
|||||

Landau, G. M. & Vishkin, U. | Efficient string matching with k mismatches [BibTeX] |
1986 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Landau1986a, author = {G. M. Landau and U. Vishkin}, title = {Efficient string matching with {\emph{k}} mismatches}, journal = {Theor. Comput. Sci.}, year = {1986}, volume = {43}, number = {2--3}, pages = {239--249} } |
|||||

Landau, G. M. & Vishkin, U. | Efficient parallel and serial approximate string matching [BibTeX] |
1986 | techreport | ||

BibTeX:
@techreport{Landau1986b, author = {G. M. Landau and U. Vishkin}, title = {Efficient parallel and serial approximate string matching}, year = {1986}, number = {TR-221-U101} } |
|||||

Landau, G. M. & Vishkin, U. | Introducing efficient parallelism into approximate string matching and a new serial algorithm [BibTeX] |
1986 | Proceedings of the 18th ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Landau1986c, author = {G. M. Landau and U. Vishkin}, title = {Introducing efficient parallelism into approximate string matching and a new serial algorithm}, booktitle = {Proceedings of the 18th ACM Symposium on the Theory of Computing}, publisher = {ACM Press}, year = {1986}, pages = {220--230} } |
|||||

Landau, G. M. & Vishkin, U. | Efficient string matching in the presence of errors [BibTeX] |
1985 | Proceedings of the 26th IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Landau1985, author = {G. M. Landau and U. Vishkin}, title = {Efficient string matching in the presence of errors}, booktitle = {Proceedings of the 26th IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1985}, pages = {126--136} } |
|||||

Landau, G. M., Vishkin, U. & Nussinov, R. | Locating alignments with k differences for nucleotide and amino acid sequences [BibTeX] |
1988 | Comput. Appl. Biosci. | article | |

BibTeX:
@article{Landau1988a, author = {G. M. Landau and U. Vishkin and R. Nussinov}, title = {Locating alignments with {\emph{k}} differences for nucleotide and amino acid sequences}, journal = {Comput. Appl. Biosci.}, year = {1988}, volume = {4}, number = {1}, pages = {19--24} } |
|||||

Landau, G. M., Vishkin, U. & Nussinov, R. | An efficient string matching algorithm with k differences for nucleotide and amino acid sequences [BibTeX] |
1985 | techreport | ||

BibTeX:
@techreport{Landau1985a, author = {G. M. Landau and U. Vishkin and R. Nussinov}, title = {An efficient string matching algorithm with {\emph{k}} differences for nucleotide and amino acid sequences}, year = {1985}, number = {TR-37/85} } |
|||||

Landau, G. M. & Ziv-Ukelson, M. | On the Shared Substring Alignment Problem [BibTeX] |
2000 | Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Landau2000, author = {G. M. Landau and M. Ziv-Ukelson}, title = {On the Shared Substring Alignment Problem}, booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {2000}, pages = {804--814} } |
|||||

Lander, E., Mesirov, J. P. & Taylor, W. | Study of protein sequence comparison metrics on the Connection Machine CM-2 [BibTeX] |
1988 | Proceedings Supercomputing '88 | inproceedings | |

BibTeX:
@inproceedings{Lander1988, author = {E. Lander and J. P. Mesirov and W. {Taylor, IV}}, title = {Study of protein sequence comparison metrics on the {Connection Machine} {{CM-2}}}, booktitle = {Proceedings Supercomputing '88}, publisher = {IEEE Computer Society Press}, year = {1988}, volume = {2}, pages = {2--12} } |
|||||

Lander, E., Mesirov, J. P. & Taylor, W. | Protein sequence comparison on a data parallel computer [BibTeX] |
1988 | Proceedings of the 1988 International Conference on Parallel Processing, (Algorithms and Applications) | inproceedings | |

BibTeX:
@inproceedings{Lander1988a, author = {E. Lander and J. P. Mesirov and W. Taylor}, title = {Protein sequence comparison on a data parallel computer}, booktitle = {Proceedings of the 1988 International Conference on Parallel Processing, (Algorithms and Applications)}, year = {1988}, volume = {3}, pages = {257--263} } |
|||||

Lander, E., Mesirov, J. P. & W.Taylor, I. | Study of Protein Sequence Comparison Metrics on the Connection Machine CM-2 [BibTeX] |
1989 | J. Supercomputing | article | |

BibTeX:
@article{Lander1989, author = {E. Lander and J. P. Mesirov and W.{Taylor, IV}}, title = {Study of Protein Sequence Comparison Metrics on the {Connection Machine CM-2}}, journal = {J. Supercomputing}, year = {1989}, volume = {3}, number = {4}, pages = {255--269} } |
|||||

Lange, S. & Wiehagen, R. | Polynomial-time inference of arbitrary pattern languages [BibTeX] |
1991 | New Gener. Comput. | article | |

BibTeX:
@article{Lange1991, author = {S. Lange and R. Wiehagen}, title = {Polynomial-time inference of arbitrary pattern languages}, journal = {New Gener. Comput.}, year = {1991}, volume = {8}, number = {4}, pages = {361--370} } |
|||||

Larmore, L. L. | An optimal algorithm with unknown time complexity for convex matrix searching [BibTeX] |
1990 | Inf. Process. Lett. | article | |

BibTeX:
@article{Larmore1990, author = {L. L. Larmore}, title = {An optimal algorithm with unknown time complexity for convex matrix searching}, journal = {Inf. Process. Lett.}, year = {1990}, volume = {6}, number = {3}, pages = {147--151} } |
|||||

Larmore, L. L. & Rytter, W. | Almost optimal sublinear time parallel recpgnition algorithms for three subclasses of context free languages [BibTeX] |
1998 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Larmore1998, author = {L. L. Larmore and W. Rytter}, title = {Almost optimal sublinear time parallel recpgnition algorithms for three subclasses of context free languages}, journal = {Theor. Comput. Sci.}, year = {1998}, volume = {197}, number = {1--2}, pages = {189--201} } |
|||||

Larmore, L. L. & Rytter, W. | Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition [BibTeX] |
1992 | Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Larmore1992, author = {L. L. Larmore and W. Rytter}, title = {Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition}, booktitle = {Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer-Verlag, Berlin}, year = {1992}, number = {577}, pages = {121--132} } |
|||||

Larmore, L. L. & Schieber, B. | On-line dynamic programming with applications to the prediction of RNA secondary structure [BibTeX] |
1990 | Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms | inproceedings | |

BibTeX:
@inproceedings{Larmore1990a, author = {L. L. Larmore and B. Schieber}, title = {On-line dynamic programming with applications to the prediction of {RNA} secondary structure}, booktitle = {Proceedings of the 1st ACM-SIAM Annual Symposium on Discrete Algorithms}, year = {1990}, pages = {503--512} } |
|||||

Larsson, N. J. | Extended Application of Suffix Trees to Data Compression [BibTeX] |
1996 | Proceedings Data Compression Conference | inproceedings | |

BibTeX:
@inproceedings{Larsson1996, author = {N. J. Larsson}, title = {Extended Application of Suffix Trees to Data Compression}, booktitle = {Proceedings Data Compression Conference}, publisher = {IEEE Computer Society Press}, year = {1996}, pages = {190--199} } |
|||||

Lathrop, R. H., Webster, T. A. & Smith, T. F. | ARIADNE: pattern-directed inference and hierarchical abstraction in protein structure recognition [BibTeX] |
1987 | Commun. ACM | article | |

BibTeX:
@article{Lathrop1987, author = {R. H. Lathrop and T. A. Webster and T. F. Smith}, title = {{ARIADNE}: pattern-directed inference and hierarchical abstraction in protein structure recognition}, journal = {Commun. ACM}, year = {1987}, volume = {30}, number = {11}, pages = {909--921} } |
|||||

Lavenier, D. | Dedicated Hardware for Biological Sequence Comparison [BibTeX] |
1996 | J. Univ. Comp. Sci. | article | |

BibTeX:
@article{Lavenier1996, author = {D. Lavenier}, title = {{Dedicated Hardware for Biological Sequence Comparison}}, journal = {J. Univ. Comp. Sci.}, year = {1996}, volume = {2}, number = {2} } |
|||||

Lavenier, D. | SAMBA: Systolic Accelerator for Molecular Biological Applications [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Lavenier1996a, author = {D. Lavenier}, title = {{SAMBA: Systolic Accelerator for Molecular Biological Applications}}, year = {1996}, number = {IRISA 2845} } |
|||||

Lavenier, D. | An Integrated 2D Systolic Array for Spelling Correction [BibTeX] |
1993 | Integr., The VLSI J. | article | |

BibTeX:
@article{Lavenier1993, author = {D. Lavenier}, title = {{An Integrated 2D Systolic Array for Spelling Correction}}, journal = {Integr., The VLSI J.}, year = {1993}, volume = {15} } |
|||||

Lavenier, D. | MicMacs : un Réseau Systolique pour le Traitement de Chaines de Caractères [BibTeX] |
1989 | School: Univ. Rennes 1, France |
phdthesis | |

BibTeX:
@phdthesis{Lavenier1989, author = {D. Lavenier}, title = {{MicMacs : un R\'eseau Systolique pour le Traitement de Cha{\^\i}nes de Caract\`eres}}, school = {Univ. Rennes 1, France}, year = {1989} } |
|||||

Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F. & Wootton, J. C. | Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. [BibTeX] |
1993 | Science | article | |

BibTeX:
@article{Lawrence1993, author = {C. E. Lawrence and S. F. Altschul and M. S. Boguski and J. S. Liu and A. F. Neuwald and J. C. Wootton}, title = {Detecting subtle sequence signals: a {G}ibbs sampling strategy for multiple alignment.}, journal = {Science}, year = {1993}, volume = {262}, pages = {208--214} } |
|||||

Lecroq, T. | Une introduction à la recherche de mot [BibTeX] |
2000 | misc | ||

BibTeX:
@misc{Lecroq2000, author = {T. Lecroq}, title = {Une introduction \`a la recherche de mot}, year = {2000} } |
|||||

Lecroq, T. | New experimental results on exact string-matching [BibTeX] |
2000 | techreport | ||

BibTeX:
@techreport{Lecroq2000a, author = {T. Lecroq}, title = {New experimental results on exact string-matching}, year = {2000}, number = {LIFAR 2000.03} } |
|||||

Lecroq, T. | Quelques aspects de l'algorithmique du texte [BibTeX] |
2000 | School: Université de Rouen, France |
phdthesis | |

BibTeX:
@phdthesis{Lecroq2000b, author = {T. Lecroq}, title = {Quelques aspects de l'algorithmique du texte}, school = {Universit{\'e} de Rouen, France}, year = {2000} } |
|||||

Lecroq, T. | Theoretical and practical string matching [BibTeX] |
1999 | Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Lecroq1999, author = {T. Lecroq}, title = {Theoretical and practical string matching}, booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms}, year = {1999}, pages = {2} } |
|||||

Lecroq, T. | Experiments on string matching in memory structures [BibTeX] |
1998 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Lecroq1998, author = {T. Lecroq}, title = {Experiments on string matching in memory structures}, journal = {Softw. Pract. Exp.}, year = {1998}, volume = {28}, number = {5}, pages = {561--568} } |
|||||

Lecroq, T. | Theoretical and practical aspects of string matching [BibTeX] |
1998 | Abstracts of invited lectures and short communcations deliverered at the 7th International Colloquium on Numerical Analysis and Computer Science with Applications | inproceedings | |

BibTeX:
@inproceedings{Lecroq1998a, author = {T. Lecroq}, title = {Theoretical and practical aspects of string matching}, booktitle = {Abstracts of invited lectures and short communcations deliverered at the 7th International Colloquium on Numerical Analysis and Computer Science with Applications}, year = {1998}, pages = {75} } |
|||||

Lecroq, T. | Experimental results on string matching over infinite alphabets [BibTeX] |
1997 | techreport | ||

BibTeX:
@techreport{Lecroq1997, author = {T. Lecroq}, title = {Experimental results on string matching over infinite alphabets}, year = {1997}, number = {LIR 97.01} } |
|||||

Lecroq, T. | Experimental results on string matching algorithms [BibTeX] |
1995 | Softw. Pract. Exp. | article | |

BibTeX:
@article{Lecroq1995, author = {T. Lecroq}, title = {Experimental results on string matching algorithms}, journal = {Softw. Pract. Exp.}, year = {1995}, volume = {25}, number = {7}, pages = {727--765} } |
|||||

Lecroq, T. | Experimental results on string matching algorithms [BibTeX] |
1994 | techreport | ||

BibTeX:
@techreport{Lecroq1994, author = {T. Lecroq}, title = {Experimental results on string matching algorithms}, year = {1994}, number = {LITP 94.12} } |
|||||

Lecroq, T. | A variation on the Boyer-Moore algorithm [BibTeX] |
1992 | Theor. Comput. Sci. | article | |

BibTeX:
@article{Lecroq1992, author = {T. Lecroq}, title = {A variation on the {Boyer-Moore} algorithm}, journal = {Theor. Comput. Sci.}, year = {1992}, volume = {92}, number = {1}, pages = {119--144} } |
|||||

Lecroq, T. | Recherches de mot [BibTeX] |
1992 | School: Université d'Orléans, France |
phdthesis | |

BibTeX:
@phdthesis{Lecroq1992a, author = {T. Lecroq}, title = {Recherches de mot}, school = {Universit{\'e} d'Orl{\'e}ans, France}, year = {1992} } |
|||||

Lecroq, T. | Recherches de mot [BibTeX] |
1992 | techreport | ||

BibTeX:
@techreport{Lecroq1992b, author = {T. Lecroq}, title = {Recherches de mot}, year = {1992}, number = {LITP 92.15} } |
|||||

Lecroq, T., Luce, G. & Myoupo, J. | A faster linear systolic algorithm for recovering a longest common subsequence [BibTeX] |
1997 | Inf. Process. Lett. | article | |

BibTeX:
@article{Lecroq1997a, author = {T. Lecroq and G. Luce and J.-F. Myoupo}, title = {A faster linear systolic algorithm for recovering a longest common subsequence}, journal = {Inf. Process. Lett.}, year = {1997}, volume = {61}, number = {3}, pages = {129--136} } |
|||||

Lecroq, T., Luce, G. & Myoupo, J. | A faster linear systolic algorithm for recovering a longest common subsequence [BibTeX] |
1996 | techreport | ||

BibTeX:
@techreport{Lecroq1996, author = {T. Lecroq and G. Luce and J.-F. Myoupo}, title = {A faster linear systolic algorithm for recovering a longest common subsequence}, year = {1996}, number = {LaRIA 96--07} } |
|||||

Lecroq, T. & Myoupo, J. | Détermination d'un plus long sous-mot commun à deux mots sur un réseau linéaire [BibTeX] |
1995 | techreport | ||

BibTeX:
@techreport{Lecroq1995a, author = {T. Lecroq and J.-F. Myoupo}, title = {D{\'e}termination d'un plus long sous-mot commun {\`a} deux mots sur un r{\'e}seau lin{\'e}aire}, year = {1995}, number = {LIR95.08 Informatique Fondamentale} } |
|||||

Lecroq, T. & Myoupo, J. | Détermination d'un plus long sous-mot commun à deux mots sur un réseau linéaire [BibTeX] |
1994 | Proceedings of the 6th Rencontres Francophones du Parallélisme | inproceedings | |

BibTeX:
@inproceedings{Lecroq1994a, author = {T. Lecroq and J.-F. Myoupo}, title = {D{\'e}termination d'un plus long sous-mot commun {\`a} deux mots sur un r{\'e}seau lin{\'e}aire}, booktitle = {Proceedings of the 6th Rencontres Francophones du Parall{\'e}lisme}, year = {1994}, pages = {301} } |
|||||

Lecroq, T., Myoupo, J. & Semé, D. | A one-phase parallel algorithm for the sequence alignment problem [BibTeX] |
1998 | Parallel Process. Lett. | article | |

BibTeX:
@article{Lecroq1998b, author = {T. Lecroq and J.-F. Myoupo and D. Sem\'e}, title = {A one-phase parallel algorithm for the sequence alignment problem}, journal = {Parallel Process. Lett.}, year = {1998}, volume = {8}, number = {4}, pages = {515--526} } |
|||||

Lecroq, T., Myoupo, J. & Semé, D. | A one-phase parallel algorithm for the sequence alignment problem [BibTeX] |
1997 | techreport | ||

BibTeX:
@techreport{Lecroq1997b, author = {T. Lecroq and J.-F. Myoupo and D. Sem\'e}, title = {A one-phase parallel algorithm for the sequence alignment problem}, year = {1997}, number = {LaRIA 97--16} } |
|||||

Lee, D. & Lochovsky, F. | Text retrieval machine [BibTeX] |
1985 | book | ||

BibTeX:
@book{Lee1985, author = {D. Lee and F. Lochovsky}, title = {Text retrieval machine}, publisher = {Springer-Verlag, Berlin}, year = {1985} } |
|||||

Lee, I. & Iliopoulos, C. S. | Two simple heuristics for the pattern matching on weighted sequences [BibTeX] |
2005 | Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA) | inproceedings | |

BibTeX:
@inproceedings{Lee2005, author = {I. Lee and C. S. Iliopoulos}, title = {Two simple heuristics for the pattern matching on weighted sequences}, booktitle = {Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)}, year = {2005}, pages = {409-414} } |
|||||

Lee, I. & Iliopoulos, C. S. | Two simple heuristics for the pattern matching on weighted sequences [BibTeX] |
2005 | Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA) | inproceedings | |

BibTeX:
@inproceedings{Lee2005, author = {I. Lee and C. S. Iliopoulos}, title = {Two simple heuristics for the pattern matching on weighted sequences}, booktitle = {Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)}, year = {2005}, pages = {409-414} } |
|||||

Lee, I., Iliopoulos, C. S. & Park, K. | Linear time algorithm for the longest common repeat problem [BibTeX] |
2005 | Journal of Discrete Algorithms | article | |

BibTeX:
@article{Lee2005a, author = {I. Lee and C. S. Iliopoulos and K. Park}, title = {Linear time algorithm for the longest common repeat problem}, journal = {Journal of Discrete Algorithms}, year = {2005} } |
|||||

Lee, I., Iliopoulos, C. S. & Park, K. | Linear time algorithm for the longest common repeat problem [BibTeX] |
2005 | Journal of Discrete Algorithms | article | |

BibTeX:
@article{Lee2005a, author = {I. Lee and C. S. Iliopoulos and K. Park}, title = {Linear time algorithm for the longest common repeat problem}, journal = {Journal of Discrete Algorithms}, year = {2005} } |
|||||

Lee, I., Iliopoulos, C. S. & Park, K. | Linear time algorithm for the longest common repeat problem [BibTeX] |
2004 | Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04) | inproceedings | |

BibTeX:
@inproceedings{Lee2004, author = {I. Lee and Costas S. Iliopoulos and Kunsoo Park}, title = {Linear time algorithm for the longest common repeat problem}, booktitle = {Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04)}, publisher = {Springer-Verlag Heidelberg}, year = {2004}, volume = {3246}, pages = {10-17} } |
|||||

Lee, I., Iliopoulos, C. S. & Park, K. | Linear time algorithm for the longest common repeat problem [BibTeX] |
2004 | Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04) | inproceedings | |

BibTeX:
@inproceedings{Lee2004, author = {I. Lee and Costas S. Iliopoulos and Kunsoo Park}, title = {Linear time algorithm for the longest common repeat problem}, booktitle = {Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04)}, publisher = {Springer-Verlag Heidelberg}, year = {2004}, volume = {3246}, pages = {10-17} } |
|||||

Lee, I. & Pinzón, Y. J. | Linear Time Algorithm for the Generalised Longest Common Repeat Problem [BibTeX] |
2005 | Proceedings of the 12th International Symposium on String Processing and Information Retrieval (SPIRE'05) | inproceedings | |

BibTeX:
@inproceedings{Lee2005, author = {Inbok Lee and Yoan José Pinzón}, title = {Linear Time Algorithm for the Generalised Longest Common Repeat Problem}, booktitle = {Proceedings of the 12th International Symposium on String Processing and Information Retrieval (SPIRE'05)}, publisher = {Springer-Verlag, Berlin}, year = {2005}, volume = {3772}, pages = {191-201} } |
|||||

Lee, J., Kim, D. K., Park, K. & Cho, Y. | Efficient algorithms for approximate string matching with swaps [BibTeX] |
1997 | Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Lee1997, author = {J.-S. Lee and D. K. Kim and K. Park and Y. Cho}, title = {Efficient algorithms for approximate string matching with swaps}, booktitle = {Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1997}, number = {1264}, pages = {28--39} } |
|||||

Lee, K. | Automatic Speech Recognition [BibTeX] |
1989 | book | ||

BibTeX:
@book{Lee1989, author = {K.-F. Lee}, title = {Automatic Speech Recognition}, publisher = {Kluwer}, year = {1989} } |
|||||

Lee, K. C. & Mak, V. W. | Design and analysis of a parallel VLSI string search algorithm [BibTeX] |
1989 | Proceedings of the 6th International Workshop on Database Machines | inproceedings | |

BibTeX:
@inproceedings{Lee1989a, author = {K. C. Lee and V. W. Mak}, title = {Design and analysis of a parallel {VLSI} string search algorithm}, booktitle = {Proceedings of the 6th International Workshop on Database Machines}, publisher = {Springer-Verlag, Berlin}, year = {1989}, number = {368}, pages = {215--229} } |
|||||

van Leeuwen, J. & Tsakalidis, A. K. | An optimal pointer machine algorithm for finding nearest common ancestors [BibTeX] |
1988 | techreport | ||

BibTeX:
@techreport{Leeuwen1988, author = {J. van Leeuwen and A. K. Tsakalidis}, title = {An optimal pointer machine algorithm for finding nearest common ancestors}, year = {1988}, number = {RUU-CS-88-17} } |
|||||

Lefebvre, A. & Lecroq, T. | Compror: on-line lossless data compression with a factor oracle [BibTeX] |
2002 | Inf. Process. Lett. | article | |

BibTeX:
@article{Lefebvre2002, author = {A. Lefebvre and T. Lecroq}, title = {Compror: on-line lossless data compression with a factor oracle}, journal = {Inf. Process. Lett.}, year = {2002}, volume = {83}, number = {1}, pages = {1--6} } |
|||||

Lefebvre, A. & Lecroq, T. | A heuristic for computing repeats with a factor oracle: Applications to biological sequences [BibTeX] |
2002 | Int. J. Comput. Math. | article | |

BibTeX:
@article{Lefebvre2002a, author = {A. Lefebvre and T. Lecroq}, title = {A heuristic for computing repeats with a factor oracle: Applications to biological sequences}, journal = {Int. J. Comput. Math.}, year = {2002}, volume = {79}, number = {12}, pages = {1303--1315} } |
|||||

Lefebvre, A. & Lecroq, T. | Estimating topological entropy of biological sequences using a factor oracle [BibTeX] |
2001 | Proccedings of the 5th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2001) | inproceedings | |

BibTeX:
@inproceedings{Lefebvre2001, author = {A. Lefebvre and T. Lecroq}, title = {Estimating topological entropy of biological sequences using a factor oracle}, booktitle = {Proccedings of the 5th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2001)}, year = {2001} } |
|||||

Lefebvre, A. & Lecroq, T. | Computing repeated factors with a factor oracle [BibTeX] |
2000 | Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Lefebvre2000, author = {A. Lefebvre and T. Lecroq}, title = {Computing repeated factors with a factor oracle}, booktitle = {Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms}, year = {2000}, pages = {145--158} } |
|||||

Lefebvre, A., Lecroq, T. & Alexandre, J. | Drastic improvements over repeats found with a factor oracle [BibTeX] |
2002 | Proceedings of the 13th Australasian Workshop On Combinatorial Algorithms | inproceedings | |

BibTeX:
@inproceedings{Lefebvre2002b, author = {A. Lefebvre and T. Lecroq and J. Alexandre}, title = {Drastic improvements over repeats found with a factor oracle}, booktitle = {Proceedings of the 13th Australasian Workshop On Combinatorial Algorithms}, year = {2002}, pages = {253--265} } |
|||||

Lefebvre, A., Lecroq, T. & Alexandre, J. | Utilisations de l'oracle des facteurs [BibTeX] |
2001 | Actes des Journées Ouvertes Biologie Informatique Mathématiques | inproceedings | |

BibTeX:
@inproceedings{Lefebvre2001a, author = {A. Lefebvre and T. Lecroq and J. Alexandre}, title = {Utilisations de l'oracle des facteurs}, booktitle = {Actes des Journ\'ees Ouvertes Biologie Informatique Math\'ematiques}, year = {2001}, pages = {153--157} } |
|||||

Lefebvre, A., Lecroq, T., Dauchel, H. & Alexandre, J. | FORRepeats: detects repeats on entire chromosomes and between genomes [BibTeX] |
2003 | Bioinformatics | article | |

BibTeX:
@article{Lefebvre2003, author = {A. Lefebvre and T. Lecroq and H. Dauchel and J. Alexandre}, title = {{FORRepeats}: detects repeats on entire chromosomes and between genomes}, journal = {Bioinformatics}, year = {2003}, volume = {19}, number = {3}, pages = {319--326} } |
|||||

Lempel, A., Even, S. & Cohn, M. | An algorithm for optimal prefix parsing of a noiseless and memoryless channel [BibTeX] |
1973 | IEEE Trans. Inf. Theory | article | |

BibTeX:
@article{Lempel1973, author = {A. Lempel and S. Even and M. Cohn}, title = {An algorithm for optimal prefix parsing of a noiseless and memoryless channel}, journal = {IEEE Trans. Inf. Theory}, year = {1973}, volume = {19}, pages = {208--214} } |
|||||

Lempel, A. & Ziv, J. | On the complexity of finite sequences [BibTeX] |
1976 | IEEE Trans. Inf. Theory | article | |

BibTeX:
@article{Lempel1976, author = {A. Lempel and J. Ziv}, title = {On the complexity of finite sequences}, journal = {IEEE Trans. Inf. Theory}, year = {1976}, volume = {22}, pages = {75--81} } |
|||||

Lempel, A. & Ziv, J. | On the complexity of finite sequences [BibTeX] |
1976 | IEEE Trans. Inf. Theory | article | |

BibTeX:
@article{Lempel1976a, author = {A. Lempel and J. Ziv}, title = {On the complexity of finite sequences}, journal = {IEEE Trans. Inf. Theory}, year = {1976}, volume = {22}, number = {1}, pages = {75--81} } |
|||||

Lemström, K., Navarro, G. & Pinzon, Y. | Practical Algorithms for Transposition-Invariant String-Matching [BibTeX] |
2005 | Journal of Discrete Algorithms (JDA) | article | |

BibTeX:
@article{Lemstrom2005, author = {K. Lemstr{\"{o}}m and G. Navarro and Y. Pinzon}, title = {Practical Algorithms for Transposition-Invariant String-Matching}, journal = {Journal of Discrete Algorithms (JDA)}, publisher = {Elsevier Science}, year = {2005}, volume = {3}, number = {2--4}, pages = {267--292} } |
|||||

Lesk, A. | Computational molecular biology, sources and methods for sequence analysis [BibTeX] |
1988 | book | ||

BibTeX:
@book{Lesk1988, author = {A. Lesk}, title = {Computational molecular biology, sources and methods for sequence analysis}, publisher = {Oxford University Press}, year = {1988} } |
|||||

Lesk, A. M. | Application of sequence alignment methods to multiple structural alignment [BibTeX] |
1998 | Proceedings of the Prague Stringology Club Workshop~'98 | inproceedings | |

BibTeX:
@inproceedings{Lesk1998, author = {A. M. Lesk}, title = {Application of sequence alignment methods to multiple structural alignment}, booktitle = {Proceedings of the Prague Stringology Club Workshop~'98}, year = {1998}, pages = {95--100}, note = {Collaborative Report DC--98--06} } |
|||||

Lesk, A. M. | Three-dimensional pattern matching in protein structure analysis [BibTeX] |
1995 | Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Lesk1995, author = {A. M. Lesk}, title = {Three-dimensional pattern matching in protein structure analysis}, booktitle = {Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1995}, number = {937}, pages = {248--260} } |
|||||

Lesk, A. M., Levitt, M. & Chothia, C. | Alignment of amino acid sequences of distantly related proteins using variable gap penalties [BibTeX] |
1986 | Protein Engineering | article | |

BibTeX:
@article{Lesk1986, author = {A. M. Lesk and M. Levitt and C. Chothia}, title = {Alignment of amino acid sequences of distantly related proteins using variable gap penalties}, journal = {Protein Engineering}, year = {1986}, volume = {1}, pages = {77--78} } |
|||||

Lestrée, L. | Unit Route Upper Bound for String-Matching on Hypercube [BibTeX] |
1994 | Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Lestr'ee1994, author = {L. Lestr{\'e}e}, title = {Unit Route Upper Bound for String-Matching on Hypercube}, booktitle = {Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1994}, number = {807}, pages = {136--145} } |
|||||

Lestrée, L. | Recherche de mots et d'arbres en parallèle [BibTeX] |
1993 | School: Université Paris 7 |
phdthesis | |

BibTeX:
@phdthesis{Lestr'ee1993, author = {L. Lestr{\'e}e}, title = {Recherche de mots et d'arbres en parall{\`e}le}, school = {Universit{\'e} Paris 7}, year = {1993} } |
|||||

Levenshtein, V. I. | Binary codes capable of correcting deletions, insertions and reversals [BibTeX] |
1966 | Sov. Phys. Dokl. | article | |

BibTeX:
@article{Levenshtein1966, author = {V. I. Levenshtein}, title = {Binary codes capable of correcting deletions, insertions and reversals}, journal = {Sov. Phys. Dokl.}, year = {1966}, volume = {6}, pages = {707--710} } |
|||||

Levenshtein, V. I. | Binary codes capable of correcting spurious insertions and deletions of ones [BibTeX] |
1965 | Problems of Information Transmission | article | |

BibTeX:
@article{Levenshtein1965, author = {V. I. Levenshtein}, title = {Binary codes capable of correcting spurious insertions and deletions of ones}, journal = {Problems of Information Transmission}, year = {1965}, volume = {1}, pages = {8--17} } |
|||||

Li, H., Lu, M. & Fang, J. | An optimal algorithm for the longest common subsequence problem [BibTeX] |
1991 | Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing | inproceedings | |

BibTeX:
@inproceedings{Li1991, author = {H. Li and M. Lu and J. Fang}, title = {An optimal algorithm for the longest common subsequence problem}, booktitle = {Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing}, publisher = {IEEE Computer Society Press}, year = {1991}, pages = {630--639} } |
|||||

Li, M. | Towards a DNA sequencing theory [BibTeX] |
1990 | Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science | inproceedings | |

BibTeX:
@inproceedings{Li1990, author = {M. Li}, title = {Towards a {DNA} sequencing theory}, booktitle = {Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science}, publisher = {IEEE Computer Society Press}, year = {1990}, pages = {125--134} } |
|||||

Li, M. | Lower bounds on string matching [BibTeX] |
1984 | techreport | ||

BibTeX:
@techreport{Li1984, author = {M. Li}, title = {Lower bounds on string matching}, year = {1984}, number = {TR-84-636} } |
|||||

Li, M. & Jiang, T. | Shortest common superstrings [BibTeX] |
1997 | Pattern matching algorithms | incollection | |

BibTeX:
@incollection{Li1997, author = {M. Li and T. Jiang}, title = {Shortest common superstrings}, booktitle = {Pattern matching algorithms}, publisher = {Oxford University Press}, year = {1997}, pages = {238--265} } |
|||||

Li, M., Ma, B. & Wang, L. | Finding similar regions in many strings [BibTeX] |
1999 | Proceedings of the 31st ACM Symposium on the Theory of Computing | inproceedings | |

BibTeX:
@inproceedings{Li1999, author = {M. Li and B. Ma and L. Wang}, title = {Finding similar regions in many strings}, booktitle = {Proceedings of the 31st ACM Symposium on the Theory of Computing}, year = {1999}, pages = {473--482} } |
|||||

Li, M. & Yesha, Y. | String matching cannot be done by a two-head one way deterministic finite automaton [BibTeX] |
1986 | Inf. Process. Lett. | article | |

BibTeX:
@article{Li1986, author = {M. Li and Y. Yesha}, title = {String matching cannot be done by a two-head one way deterministic finite automaton}, journal = {Inf. Process. Lett.}, year = {1986}, volume = {22}, number = {5}, pages = {231--235} } |
|||||

Liang, F. M. | Word hy-phen-a-tion by com-pu-ter [BibTeX] |
1983 | School: Computer Science Department, Stanford University |
phdthesis | |

BibTeX:
@phdthesis{Liang1983, author = {F. M. Liang}, title = {Word hy-phen-a-tion by com-pu-ter}, school = {Computer Science Department, Stanford University}, year = {1983} } |
|||||

Liben-Nowell, D. | On the Structure of Syntenic Distance [BibTeX] |
1999 | Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Liben-Nowell1999, author = {D. Liben-Nowell}, title = {On the Structure of Syntenic Distance}, booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1999}, number = {1645}, pages = {50--65} } |
|||||

Liben-Nowell, D. & Kleinberg, J. M. | Structural Properties and Tractability Results for Linear Synteny [BibTeX] |
2000 | Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Liben-Nowell2000, author = {D. Liben-Nowell and J. M. Kleinberg}, title = {Structural Properties and Tractability Results for Linear Synteny}, booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {2000}, number = {1848}, pages = {248--263} } |
|||||

de Lima, V. S., Abrahao, P. & Paraboni, I. | Approaching the dictionary in the implementation of a natural language processing system: toward a distributed structure [BibTeX] |
1997 | Proceedings of the 4th South American Workshop on String Processing | inproceedings | |

BibTeX:
@inproceedings{Lima1997, author = {V.L. Strube de Lima and P.C. Abrahao and I. Paraboni}, title = {Approaching the dictionary in the implementation of a natural language processing system: toward a distributed structure }, booktitle = {Proceedings of the 4th South American Workshop on String Processing}, publisher = {Carleton University Press}, year = {1997}, pages = {166-178} } |
|||||

Lin, Y. C. | New systolic arrays for the longest subsequence problem [BibTeX] |
1994 | Parallel Comput. | article | |

BibTeX:
@article{Lin1994, author = {Y. C. Lin}, title = {New systolic arrays for the longest subsequence problem}, journal = {Parallel Comput.}, year = {1994}, volume = {20}, pages = {1323--1334} } |
|||||

Lindsay, D. C. | A file difference program [BibTeX] |
1989 | Commun. ACM | article | |

BibTeX:
@article{Lindsay1989, author = {D. C. Lindsay}, title = {A file difference program}, journal = {Commun. ACM}, year = {1989}, volume = {32}, number = {6}, pages = {740--755} } |
|||||

Lipman, D. J. | Computing Discoveries in Molecular Biology (Abstract) [BibTeX] |
1996 | Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching | inproceedings | |

BibTeX:
@inproceedings{Lipman1996, author = {D. J. Lipman}, title = {Computing Discoveries in Molecular Biology (Abstract)}, booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching}, publisher = {Springer-Verlag, Berlin}, year = {1996}, number = {1075}, pages = {64} } |
|||||

Lipman, D. J., Altschul, S. F. & Kececioglu, J. D. | A tool for multiple sequence alignment [BibTeX] |
1989 | Proc. Natl. Acad. Sci. U.S.A. | article | |

BibTeX:
@article{Lipman1989, author = {D. J. Lipman and S. F. Altschul and J. D. Kececioglu}, title = {A tool for multiple sequence alignment}, journal = {Proc. Natl. Acad. Sci. U.S.A.}, year = {1989}, volume = {86}, pages = {4412--4415} } |
|||||

Lipman, D. J. & Pearson, W. R. | Rapid and sensitive protein similarity searches [BibTeX] |
1985 | Sci. | article | |

BibTeX:
@article{Lipman1985, author = {D. J. Lipman and W. R. Pearson}, title = {Rapid and sensitive protein similarity searches}, journal = {Sci.}, year = {1985}, volume = {227}, pages = {1435--1441} } |
|||||

Lipton, R. S. & Lopresti, D. P. | Comparing long strings on a short systolic array [BibTeX] |
1987 | Proceedings of the 1st International Workshop on Systolic Arrays | inproceedings | |

BibTeX:
@inproceedings{Lipton1987, author = {R. S. Lipton and D. P. Lopresti}, title = {Comparing long strings on a short systolic array}, booktitle = {Proceedings of the 1st International Workshop on Systolic Arrays}, year = {1987}, pages = {181--190} } |
|||||

Lipton, R. S. & Lopresti, D. P. | Comparing Long Strings on a Short Systolic Array [BibTeX] |
1986 | Systolic Arrays | incollection | |

BibTeX:
@incollection{Lipton1986, author = {R. S. Lipton and D. P. Lopresti}, title = {Comparing Long Strings on a Short Systolic Array}, booktitle = {Systolic Arrays}, publisher = {Computer Science Press}, year = {1986} } |
|||||

Lipton, R. S. & Lopresti, D. P. | Comparing long strings on a short systolic array [BibTeX] |
1986 | techreport | ||

BibTeX:
@techreport{Lipton1986a, author = {R. S. Lipton and D. P. Lopresti}, title = {Comparing long strings on a short systolic array}, year = {1986}, number = {CS-TR-026-86} } |
|||||

Lipton, R. S. & Lopresti, D. P. | A systolic array for rapid string comparison [BibTeX] |
1985 | Proceedings of the 1985 Chapel Hill Conference on Very Large Scale Integration | inproceedings | |

BibTeX:
@inproceedings{Lipton1985, author = {R. S. Lipton and D. P. Lopresti}, title = {A systolic array for rapid string comparison}, booktitle = {Proceedings of the 1985 Chapel Hill Conference on Very Large Scale Integration}, publisher = {Computer Science Press}, year = {1985}, pages = {363--376} } |
|||||

Liu, H. H. & Fu, K. S. | VLSI arrays for minimum-distance classifications [BibTeX] |
1984 | VLSI for Pattern Recognition and Image Processing | incollection | |

BibTeX:
@incollection{Liu1984, author = {H. H. Liu and K. S. Fu}, title = {{VLSI} arrays for minimum-distance classifications}, booktitle = {VLSI for Pattern Recognition and Image Processing}, publisher = {Springer-Verlag, Berlin}, year = {1984}, number = {13}, pages = {?--?} } |