QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
Abdeddaïm, S. Algorithms and experiments on transitive closure, path cover, and multiple sequence alignment 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}
}
Akutsu, T., Kanaya, K., Ohyama, A. & Fujiyama, A. Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions 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}
}
Allauzen, C., Crochemore, M. & Raffinot, M. Factor oracle: a new structure for pattern matching 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 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}
}
Allison, L., Powell, D. & Dix, T. I. Compression and approximate matching. 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}
}
Alstrup, A., Brodal, G. S. & Rauhe, T. Pattern Matching in Dynamic Texts 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}
}
Amir, A., Aumann, Y., G, L., Lewenstein, M. & Lewenstein, N. Pattern Matching with Swaps 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., Butman, A., Crochemore, M., Landau, G. M. & Schaps, M. Two-dimensional Pattern Matching with Rotations 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 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 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 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., Iliopoulos, C. S., Kapah, O. & Porat, E. Approximate matching in weighted sequences 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 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. M. & Sokol, D. Inplace Run-Length 2d Compressed Search 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., Lewenstein, M. & Lewenstein, N. Pattern Matching in Hypertext 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. & Porat, E. Faster Algorithms for String Matching with k Mismatches 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}
}
Andersson, A., Larsson, N. J. & Swanson, K. Suffix Trees on Words 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}
}
Andrejková, G. The Set-Set closest common subsequence problem 2000 Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia   inproceedings  
BibTeX:
@inproceedings{Andrejkova2000,
  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 1999 Proceedings of the Prague Stringology Club Workshop~'99   inproceedings  
BibTeX:
@inproceedings{Andrejkova1999,
  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}
}
Antoniou, P., Holub, J., Iliopoulos, C. S., Melichar, B. & Peterlongo, P. Finding Common Motifs with Gaps using Finite Automata 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}
}
Apostolico, A., Bock, M. E. & Lonardi, S. Linear Global Detectors of Redundant and Rare Substrings 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 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. & Brimkov, V. E. Fibonacci arrays and their two-dimensional repetitions 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., Landau, G. M. & Skiena, S. Matching for Run-Length Encoded Strings 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. & Lonardi, S. Compression of Biological Sequences by Greedy Off-Line Textual Substitution 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 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 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}
}
Arikat, F., Bakalis, A., Christodoulakis, M., Iliopoulos, C. S. & Mouchard, L. Experimental Results in Pattern Matching on Weighted Sequences 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 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 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}
}
Arroyuelo, D., Navarro, G. & Sadakane, K. Reducing the Space Requirement of LZ-index 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 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}
}
Atallah, M. J., Génin, Y. & Szpankowski, W. Structural Pattern Analysis 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}
}
Attwood, T. K. & Parry-Smith, D. J. Introduction to bioinformatics 1999   book  
BibTeX:
@book{Attwood1999,
  author = {T. K. Attwood and D. J. Parry-Smith},
  title = {Introduction to bioinformatics},
  publisher = {Addison Wesley Longman},
  year = {1999}
}
Baba, K., Shinohara, A., Takeda, M., Inenaga, S. & Arikawa, S. A Note on Randomized Algorithm for String Matching with Mismatches 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) 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}
}
Baeza-Yates, R. A., Gavaldà, R., Navarro, G. & Scheihing, R. Bounding the expected length of longest common subsequences and forests 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. & Navarro, G. Faster Approximate String Matching 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. & Navarro, G. New Models and Algorithms for Multidimensional Approximate Pattern Matching 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}
}
Bakalis, A., Iliopoulos, C. S., Sioutas, S. & Tsichlas, K. Algorithms for Bitmasking Strings 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 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}
}
Balík, M. Condensation principle 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}
}
Batzoglou, S. & Istrail, S. Physical Mapping With Repeated Probes: The Hypergraph Superstring Problem 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 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}
}
Bejerano, G. & Yona, G. Modeling protein families using probabilistic suffix trees 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}
}
Ben-Dor, A., Pe'er, I., Shamir, R. & Sharan, R. On the Complexity of Positional Sequencing by Hybridization 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}
}
Bent, K. A Recursive Function for Calculating the Number of Legal Strings of Parentheses and for Calculating Catalan Numbers 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 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}
}
Berman, P., Zhang, Z., Wolf, Y. I., Koonin, E. V. & Miller, W. Winnowing Sequences from a Database Search 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, T. & Ravindran, S. A fast string matching algorithm and experimental results 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 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. & Boasson, L. Partial words and a theorem of Fine and Wilf 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}
}
Blum, N. Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology 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}
}
Boasson, L., Cegielski, P., Guessarian, I. & Matiyasevich, Y. Window-Accumulated Subsequence Matching Problem is Linear 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}
}
Bonizzoni, P., Vedova, G. D. & Mauri, G. Approximating the Maximum Isomorphic Agreement Subtree Is Hard 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}
}
Breimer, E., Goldberg, M. & Lim, D. A learning algorithm for the longest common subsequence problem 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}
}
Brisaboa, N., na, A. F., Navarro, G. & Paramá, J. Lightweight Natural Language Text Compression 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 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}
}
Brodal, G. S., Lyngs, R. B., Pedersen, C. N. S. & Stoye, J. Finding maximal pairs with bounded gap 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 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 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 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 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}
}
Bruyère, V. & Perrin, D. Maximal bifix codes 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 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}
}
Buchsbaum, A. L. & Giancarlo, R. Algorithmic Aspects of Speech Recognition: A Synopsis 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 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}
}
Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H., Rivals, E. & Vingron, M. q-gram Based Database Searching Using a Suffix Array 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}
}
Califano, A. SPLASH: Structural Pattern Localization Analysis by Sequential Histograming 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 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}
}
Caprara, A. Formulations and Complexity of Multiple Sorting by Reversals 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 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., Lancia, G. & Ng, S. K. Fast Practical Solution of Sorting by Reversals 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}
}
Carpi, A. On Abelian squares and substitutions 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 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}
}
Castelli, G., Mignosi, F. & Restivo, A. Fine and Wilf's theorem for three periods and a generalization of Sturmian words 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) 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}
}
Chávez, E. & Navarro, G. Metric Databases 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 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}
}
Charras, C. & Lecroq, T. Java tools to help understanding pattern matching techniques 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}
}
Chen, W. Multi-subsequence searching 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}
}
Christodoulakis, M., Iliopoulos, C. S., Mouchard, L., Perdikuri, K., Tsakalidis, A. & Tsichlas, K. Computation of Repetitions and Regularities on Biological Weighted Sequences 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 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 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 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 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 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 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}
}
Chávez, E., Figueroa, K. & Navarro, G. Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order 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 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}
}
Clifford, P., R. Clifford & Iliopoulos, C. S. Faster algorithms for (δ,γ)-matching and related problems 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 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 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 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 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}
}
Cole, R. & Hariharan, R. Faster Suffix Tree Construction with Missing Suffix Links 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 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., Iliopoulos, C. S., Lecroq, T., Plandowski, W. & Rytter, W. On Special Families of Morphisms Related to delta-Matching and Don't Care Symbols 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 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 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 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}
}
Crochemore, M. Reducing Space for Index Implementation 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., Czumaj, A., Gasieniec, L., Lecroq, T., Plandowski, W. & Rytter, W. Fast practical multi-pattern matching 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 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., Gasieniec, L. & Rytter, W. Constant-space string-matching in sublinear average time 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., Hancart, C. & Lecroq, T. Algorithmique du texte 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., Lecroq, T., Pinzon, Y., Plandowski, W. & Rytter, W. Occurrence and Substring Heuristics for emph-Matching 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 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., Lecroq, T. & Pinzon, Y. J. Approximate string matching in musical sequences 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 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 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 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 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 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., Mignosi, F., Restivo, A. & Salemi, S. Text Compression Using Antidictionaries 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}
}
Czumaj, A. & Gasieniec, L. On the Complexity of Determining the Period of a String 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}
}
Dewey, T. G. A sequence alignment algorithm with an arbitrary gap penalty function 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 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}
}
Duval, J., Kolpakov, R., Kucherov, G., Lecroq, T. & Lefebvre, A. Linear-Time Computation of Local Periods 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 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 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 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 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 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}
}
Edelkamp, S. Dictionary Automaton in Optimal Space 1999   techreport  
BibTeX:
@techreport{Edelkamp1999,
  author = {S. Edelkamp},
  title = {Dictionary Automaton in Optimal Space},
  year = {1999}
}
El-Mabrouk, N. Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments 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 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. & Sankoff, D. Hybridization and genome rearrangement 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 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}
}
Evans, P. Finding Common Subsequences with Arcs and Pseudoknots 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}
}
Ferenczi, S. & Kása, Z. Complexity for finite factors of infinite sequences 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 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. & Grossi, R. Improved dynamic text indexing 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 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. & Luccio, F. String Search in Coarse-Grained Parallel Computers 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., Manzini, G., Mäkinen, V. & Navarro, G. Compressed Representations of Sequences and Full-Text Indexes 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 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}
}
Figueroa, K., Chávez, E., Navarro, G. & Paredes, R. On the Least Cost For Proximity Searching in Metric Spaces 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 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}
}
Floratos, A., Rigoutsos, I., Parida, L., Stolovitzky, G. & Gao, Y. Sequence Homology Detection Through Large-Scale Pattern Discovery 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}
}
Fraenkel, A. S. & Simpson, J. The exact number of squares in Fibonacci words 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}
}
Franv ek, F., Karaman, A. & Smyth, W. F. Repetitions in Sturmian words 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., Lu, W., Ryan, P. J., Smyth, W. F., Sun, Y. & Yang, L. Verifying a border array in linear time 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 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 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}
}
Fredriksson, K., Mäkinen, V. & Navarro, G. Rotation and Lighting Invariant Template Matching 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 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 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}
}
Gelfand, M. S., Koonin, E. V. & Mironov, A. A. Prediction of transcription regulatory sites in Archaea by a comparative genomic approach 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}
}
Giegerich, R. Explaining and Controlling Ambiguity in Dynamic Programming 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. & Stoye, J. Efficient implementation of lazy suffix trees 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}
}
Goeman, H. & Clausen, M. A new practical linear space algorithm for the longest common subsequence problem 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}
}
González, R. & Navarro, G. Statistical Encoding of Succinct Data Structures 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}
}
Gotoh, O. Homology-based Gene Structure Prediction: Simplified Matching Algorithm Using a Translated Codon (tron) and Improved Accuracy by Allowing for Long Gaps 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 = {?--?}
}
Grabowski, S., Navarro, G., Przywarski, R., Salinger, A. & Mäkinen, V. A Simple Alphabet-Independent FM-Index 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}
}
Grossi, R. & Vitter, J. S. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching 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}
}
Gua, Q., Penga, S. & Sudboroughb, H. A 2-approximation algorithm for genome rearrangements by reversals and transpositions 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}
}
Gutiérrez, G., Navarro, G., Rodríguez, A., González, A. & Orellana, J. A Spatio-Temporal Access Method based on Snapshots and Events 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}
}
Gasieniec, L. & Rytter, W. Searching patterns with short variables 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 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}
}
Hakonen, H. & Raita, T. A Family of Fast Constant-Space Substring Search Algorithms 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}
}
Hannenhalli, S. & Pevzner, P. A. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals 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}
}
Hertz, G. Z. & Stormo, G. D. Identifying DNA and protein patterns with statistically sign ificant alignments of multiple sequences 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}
}
Hirschberg, D. S. Bounds on the Number of String Subsequences 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. & Régnier, M. Tight Bounds on the Number of String Subsequences 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}
}
Holub, J., Iliopoulos, C. S., Melichar, B. & Mouchard, L. Distributed string matching using finite automata 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 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 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}
}
Horton, P. & Sukuba, T. BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment 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}
}
Hu, Y., Sandmeyer, S., McLaughlin, C. & Kibler, D. Combinatorial motif analysis and hypothesis generation on a genomic scale 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}
}
Hyyrö, H. A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances 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 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 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 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 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 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 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}
}
Iliopoulos, C., Jayasekera, I. & Mouchard, L. Fast practical exact and approximate pattern matching in protein sequences 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 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. & Kurokawa, M. String Matching with Gaps for Musical Melodic Recognition 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 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 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 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 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 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., Mohamed, M., Mouchard, L., Perdikuri, K. G., Smyth, W. F. & Tsakalidis, A. K. String Regularities with Don't Cares 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 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. & Mouchard, L. An O(nlog n) Algorithm for Computing all Maximal Quasiperiodicities in Strings 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 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 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., Pedikuri, K. & Tsihlas, K. The Pattern Matching Problem in Biological Weighted Sequences 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 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 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 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 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 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 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. & Rytter, W. Two Parallel Transformations of Suffix Arrays into Suffix Trees 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 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}
}
Inenaga, S. Bidirectional Construction of Suffix Trees 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}
}
Ito & Shizuya On the Difficulty of Searching for a String without Decryption 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 = {?--?}
}
Jiang, T., Lin, G., Ma, B. & Zhang, K. The Longest Common Subsequence Problem for Arc-Annotated Sequences 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}
}
Just, W. & Vedova, G. D. Multiple sequence alignment as a facility location problem 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}
}
Kao, M., Lam, T. W., Sung, W. & Ting, H. A Faster and Unifying Algorithm for Comparing Trees 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}
}
Karhumäki, J., Plandowski, W. & Rytter, W. Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata 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 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 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}
}
Kida, T., Takeda, M., Shinohara, A. & Arikawa, S. Shift-And Approach to Pattern Matching in LZW Compressed Text 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 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}
}
Kim, D. K., Lee, J. S., Park, K. & Cho, Y. Efficient Algorithms for Approximate String Matching with Swaps 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, S. & Park, K. A Dynamic Edit Distance Table 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}
}
Klein, S. T. Improving Static Compression Schemes by Alphabet Extension 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}
}
Kolpakov, R. & Kucherov, G. On Maximal Repetitions in Words 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 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 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 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. & Tarannikov, Y. On repetition-free binary words of minimal density 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}
}
Kurtz, S. Reducing the Space Requirements of Suffix Trees 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}
}
Kärkkäinen, J., Navarro, G. & Ukkonen, E. Approximate String Matching over Ziv-Lempel Compressed Text 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 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}
}
Lancia, G. & Ravi, R. GESTALT: Genomic Steiner Alignments 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 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. & Ziv-Ukelson, M. On the Shared Substring Alignment Problem 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}
}
Lecroq, T. Une introduction à la recherche de mot 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 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 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 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}
}
Lee, I. & Iliopoulos, C. S. Two simple heuristics for the pattern matching on weighted sequences 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 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 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. & Pinzón, Y. J. Linear Time Algorithm for the Generalised Longest Common Repeat Problem 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}
}
Lefebvre, A. & Lecroq, T. Compror: on-line lossless data compression with a factor oracle 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 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 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 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 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 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 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}
}
Lemström, K., Navarro, G. & Pinzon, Y. Practical Algorithms for Transposition-Invariant String-Matching 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}
}
Li, M., Ma, B. & Wang, L. Finding similar regions in many strings 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}
}
Liben-Nowell, D. On the Structure of Syntenic Distance 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 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}
}
Liu, J. S., Neuwald, A. F. & Lawrence, C. E. Markovian Structures in Biological Sequence Alignment 1999 J. American Statistical Association   article  
BibTeX:
@article{Liu1999,
  author = {J. S. Liu and A. F. Neuwald and C. E. Lawrence},
  title = {{Markovian} Structures in Biological Sequence Alignment},
  journal = {J. American Statistical Association},
  year = {1999},
  volume = {94},
  number = {445},
  pages = {1--??}
}
Lonardi, S. Off-Line Data Compression by Textual Substitution 1999 School: Università di Padova   phdthesis  
BibTeX:
@phdthesis{Lonardi1999,
  author = {S. Lonardi},
  title = {Off-Line Data Compression by Textual Substitution},
  school = {Universit\`a di Padova},
  year = {1999}
}
de Luca, A. On the combinatorics of finite words 1999 Theor. Comput. Sci.   article  
BibTeX:
@article{Luca1999,
  author = {A. de Luca},
  title = {On the combinatorics of finite words},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {13--39}
}
Ma, B. A Polynominal Time Approximation Scheme for the Closest Substring Problem 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Ma2000,
  author = {B. Ma},
  title = {A Polynominal Time Approximation Scheme for the Closest Substring Problem},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {99--107}
}
Maa, M. G. Linear Bidirectional On-Line Construction of Affix Trees 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Maass2000,
  author = {M. G. Maa{\ss}},
  title = {Linear Bidirectional On-Line Construction of Affix Trees},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {320--334}
}
Marsan, L. & Sagot, M. Extracting structured motifs using a suffix tree - Algorithms and application to consensus identification 2000 Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB)   inproceedings  
BibTeX:
@inproceedings{Marsan2000,
  author = {L. Marsan and M.-F. Sagot},
  title = {Extracting structured motifs using a suffix tree - {A}lgorithms and application to consensus identification},
  booktitle = {Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB)},
  publisher = {ACM Press},
  year = {2000}
}
Marsan, L. & Sagot, M. Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification 2000 J. Comput. Bio.   article  
BibTeX:
@article{Marsan2000a,
  author = {L. Marsan and M.-F. Sagot},
  title = {Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification},
  journal = {J. Comput. Bio.},
  year = {2000},
  volume = {7},
  number = {3/4},
  pages = {345--360}
}
Melancon, G. Lyndon words and singular factors of sturmian words 1999 Theor. Comput. Sci.   article  
BibTeX:
@article{Melanc1999,
  author = {G. Melan{\c con}},
  title = {Lyndon words and singular factors of sturmian words},
  journal = {Theor. Comput. Sci.},
  year = {1999},
  volume = {218},
  number = {1},
  pages = {41--59}
}
Mignosi, F. & Restivo, A. On Negative Informations in Language Theory 1999 Combinatorics, Computation and Logic. Proceedings of DMTCS'99 and CATS'99   inproceedings  
BibTeX:
@inproceedings{Mignosi1999,
  author = {F. Mignosi and A. Restivo},
  title = {On Negative Informations in Language Theory},
  booktitle = {Combinatorics, Computation and Logic. Proceedings of DMTCS'99 and CATS'99},
  publisher = {Springer-Verlag, Singapore},
  year = {1999},
  pages = {60--72}
}
Miyazaki, M., Shinohara, A. & Takeda, M. An improved pattern matching algorithm for strings in terms of straight-line programs 2000 J. Discret. Algorithms   article  
BibTeX:
@article{Miyazaki2000,
  author = {M. Miyazaki and A. Shinohara and M. Takeda},
  title = {An improved pattern matching algorithm for strings in terms of straight-line programs},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {187--204}
}
Moore, D., Smyth, W. F. & Miller, D. Counting distinct strings 1999 Algorithmica   article  
BibTeX:
@article{Moore1999,
  author = {D. Moore and W. F. Smyth and D. Miller},
  title = {Counting distinct strings},
  journal = {Algorithmica},
  year = {1999},
  volume = {23},
  number = {1},
  pages = {1--13}
}
Mouchard, L. Normal forms of quasiperiodic strings 2000 Theor. Comput. Sci.   article  
BibTeX:
@article{Mouchard2000,
  author = {L. Mouchard},
  title = {Normal forms of quasiperiodic strings},
  journal = {Theor. Comput. Sci.},
  year = {2000},
  volume = {249},
  number = {2},
  pages = {313--324}
}
Mouchard, L. Genome research from the computer scientist point of view 1999 Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms   inproceedings  
BibTeX:
@inproceedings{Mouchard1999,
  author = {L. Mouchard},
  title = {Genome research from the computer scientist point of view},
  booktitle = {Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms},
  year = {1999},
  pages = {1}
}
Muthukrishnan, S. Simple Optimal Parallel Multiple Pattern Matching 2000 J. Algorithms   article  
BibTeX:
@article{Muthukrishnan2000,
  author = {S. Muthukrishnan},
  title = {Simple Optimal Parallel Multiple Pattern Matching},
  journal = {J. Algorithms},
  year = {2000},
  volume = {34},
  number = {1},
  pages = {1--13}
}
Myers, G. A fast bit-vector algorithm for approximate string matching based on dynamic programming 1999 J. Assoc. Comput. Mach.   article  
BibTeX:
@article{Myers1999,
  author = {G. Myers},
  title = {A fast bit-vector algorithm for approximate string matching based on dynamic programming},
  journal = {J. Assoc. Comput. Mach.},
  year = {1999},
  volume = {46},
  number = {3},
  pages = {395--415}
}
Mäkinen, V. Compact Suffix Array 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Makinen2000,
  author = {V. M{\"a}kinen},
  title = {Compact Suffix Array},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {305--319}
}
Mäkinen, V. & Navarro, G. Compressed Text Indexing 2007 Encyclopedia of Algorithms   inbook  
BibTeX:
@inbook{Makinen2007,
  author = {V. M{\"a}kinen and G. Navarro},
  title = {Compressed Text Indexing},
  booktitle = {Encyclopedia of Algorithms},
  publisher = {Springer},
  year = {2007},
  note = {To appear}
}
Mäkinen, V. & Navarro, G. Rank and Select Revisited and Extended 2006 Theoretical Computer Science   article  
BibTeX:
@article{Makinen2006,
  author = {V. M{\"a}kinen and G. Navarro},
  title = {Rank and Select Revisited and Extended},
  journal = {Theoretical Computer Science},
  year = {2006},
  note = {Special issue on ``The Burrows-Wheeler Transform andits Applications''. To appear}
}
Mäkinen, V. & Navarro, G. Dynamic Entropy-Compressed Sequences and Full-Text Indexes 2006 Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006)   inproceedings  
BibTeX:
@inproceedings{Makinen2006a,
  author = {V. M{\"a}kinen and G. Navarro},
  title = {Dynamic Entropy-Compressed Sequences and Full-Text Indexes},
  booktitle = {Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 2006)},
  year = {2006},
  pages = {307--318}
}
Mäkinen, V. & Navarro, G. Position-Restricted Substring Searching 2006 Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06)   inproceedings  
BibTeX:
@inproceedings{Makinen2006b,
  author = {V. M{\"a}kinen and G. Navarro},
  title = {Position-Restricted Substring Searching},
  booktitle = {{Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06)}},
  year = {2006},
  pages = {703--714}
}
Mäkinen, V. & Navarro, G. Succinct Suffix Arrays based on Run-Length Encoding 2005 Nordic Journal of Computing   article  
BibTeX:
@article{Makinen2005,
  author = {V. M{\"a}kinen and G. Navarro},
  title = {Succinct Suffix Arrays based on Run-Length Encoding},
  journal = {Nordic Journal of Computing},
  year = {2005},
  volume = {12},
  number = {1},
  pages = {40--66}
}
Mäkinen, V., Navarro, G. & Ukkonen, E. Transposition Invariant String Matching 2005 Journal of Algorithms   article  
BibTeX:
@article{Makinen2005a,
  author = {V. M{\"a}kinen and G. Navarro and E. Ukkonen},
  title = {Transposition Invariant String Matching},
  journal = {Journal of Algorithms},
  year = {2005},
  volume = {56},
  number = {2},
  pages = {124--153}
}
Navarro Text Databases 2005 Encyclopedia of Database Technologies and Applications   inbook  
BibTeX:
@inbook{Navarro2005,
  author = {Navarro},
  title = {Text Databases},
  booktitle = {Encyclopedia of Database Technologies and Applications},
  publisher = {Idea Group Inc., Pennsylvania, USA},
  year = {2005},
  pages = {688--694}
}
Navarro, G. Sequential Approximate String Matching 2007 Encyclopedia of Algorithms   inbook  
BibTeX:
@inbook{MN07encyc,
  author = {G. Navarro},
  title = {Sequential Approximate String Matching},
  booktitle = {Encyclopedia of Algorithms},
  publisher = {Springer},
  year = {2007},
  note = {To appear}
}
Navarro, G. Approximate Regular Expression Matching 2007 Encyclopedia of Algorithms   inbook  
BibTeX:
@inbook{Navarro2007,
  author = {G. Navarro},
  title = {Approximate Regular Expression Matching},
  booktitle = {Encyclopedia of Algorithms},
  publisher = {Springer},
  year = {2007},
  note = {To appear}
}
Navarro, G. Improved Approximate Pattern Matching on Hypertext 2000 Theor. Comput. Sci.   article  
BibTeX:
@article{Navarro2000,
  author = {G. Navarro},
  title = {Improved Approximate Pattern Matching on Hypertext},
  journal = {Theor. Comput. Sci.},
  year = {2000},
  volume = {237},
  number = {1--2},
  pages = {455--463}
}
Navarro, G. Very fast and simple approximate string matching 1999 Inf. Process. Lett.   article  
BibTeX:
@article{Navarro1999,
  author = {G. Navarro},
  title = {Very fast and simple approximate string matching},
  journal = {Inf. Process. Lett.},
  year = {1999},
  volume = {72},
  number = {1--2},
  pages = {65--70}
}
Navarro, G. & Baeza-Yates, R. A Hybrid Indexing Method for Approximate String Matching 2000 J. Discret. Algorithms   article  
BibTeX:
@article{Navarro2000a,
  author = {G. Navarro and R. Baeza-Yates},
  title = {A Hybrid Indexing Method for Approximate String Matching},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {205--239}
}
Navarro, G. & Baeza-Yates, R. A New Indexing Method for Approximate String Matching 1999 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Navarro1999a,
  author = {G. Navarro and R. Baeza-Yates},
  title = {A New Indexing Method for Approximate String Matching},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {163--185}
}
Navarro, G. & Baeza-Yates, R. Fast Multi-Dimensional Approximate Pattern Matching 1999 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Navarro1999b,
  author = {G. Navarro and R. Baeza-Yates},
  title = {Fast Multi-Dimensional Approximate Pattern Matching},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {243--257}
}
Navarro, G. & Brisaboa, N. New Bounds on D-ary Optimal Codes 2005 Information Processing Letters   article  
BibTeX:
@article{Navarro2005b,
  author = {G. Navarro and N. Brisaboa},
  title = {New Bounds on {\emph{D}}-ary Optimal Codes},
  journal = {Information Processing Letters},
  year = {2005},
  volume = {96},
  number = {5},
  pages = {178--184}
}
Navarro, G. & Chávez, E. A Metric Index for Approximate String Matching 2006 Theoretical Computer Science   article  
BibTeX:
@article{Navarro2006a,
  author = {G. Navarro and E. Ch\'avez},
  title = {A Metric Index for Approximate String Matching},
  journal = {Theoretical Computer Science},
  year = {2006},
  volume = {352},
  number = {1--3},
  pages = {266--279}
}
Navarro, G. & Mäkinen, V. Compressed Full-Text Indexes 2006 ACM Computing Surveys   article  
BibTeX:
@article{Navarro2006,
  author = {G. Navarro and V. M{\"a}kinen},
  title = {Compressed Full-Text Indexes},
  journal = {ACM Computing Surveys},
  year = {2006},
  note = {To appear}
}
Navarro, G. & Raffinot, M. A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text 1999 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Navarro1999c,
  author = {G. Navarro and M. Raffinot},
  title = {A General Practical Approach to Pattern Matching over {Ziv-Lempel} Compressed Text},
  booktitle = {Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {1999},
  number = {1645},
  pages = {14--36}
}
Navarro, G., Sutinen, E., Tanninen, J. & Tarhio, J. Indexing Text with Approximate q-Grams 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Navarro2000b,
  author = {G. Navarro and E. Sutinen and J. Tanninen and J. Tarhio},
  title = {Indexing Text with Approximate q-Grams},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {350--363}
}
Navarro, G., Sutinen, E. & Tarhio, J. Indexing Text with Approximate q-grams 2005 Journal of Discrete Algorithms (JDA)   article  
BibTeX:
@article{Navarro2005c,
  author = {G. Navarro and E. Sutinen and J. Tarhio},
  title = {Indexing Text with Approximate \emph{q}-grams},
  journal = {Journal of Discrete Algorithms (JDA)},
  publisher = {Elsevier Science},
  year = {2005},
  volume = {3},
  number = {2--4},
  pages = {157--175}
}
Navarro, G. & Tarhio, J. LZgrep: A Boyer-Moore String Matching Tool for Ziv-Lempel Compressed Text 2005 Software Practice and Experience (SPE)   article  
BibTeX:
@article{Navarro2005a,
  author = {G. Navarro and J. Tarhio},
  title = {{LZgrep}: A {B}oyer-{M}oore String Matching Tool for {Z}iv-{L}empel Compressed Text},
  journal = {Software Practice and Experience (SPE)},
  year = {2005},
  volume = {35},
  number = {12},
  pages = {1107--1130}
}
Navarro, G. & Tarhio, J. Boyer-Moore String Matching over Ziv-Lempel Compressed Text 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Navarro2000c,
  author = {G. Navarro and J. Tarhio},
  title = {{Boyer-Moore} 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 = {166--180}
}
Nelson, M. R., Kardia, S. L. & Sing, C. F. The Combinatorial Partitioning Method 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Nelson2000,
  author = {M. R. Nelson and S. L. Kardia and C. F. Sing},
  title = {The Combinatorial Partitioning Method},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {293--304}
}
Paredes, R., Chávez, E., Figueroa, K. & Navarro, G. Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces 2006 Proc. 5th Workshop on Efficient and Experimental Algorithms (WEA'06)   inproceedings  
BibTeX:
@inproceedings{Paredes2006a,
  author = {Rodrigo Paredes and Edgar Ch\'avez and Karina Figueroa and Gonzalo Navarro},
  title = {Practical Construction of \emph{k}-Nearest Neighbor Graphs in Metric Spaces},
  booktitle = {Proc. 5th Workshop on Efficient and Experimental Algorithms (WEA'06)},
  year = {2006},
  pages = {85--97}
}
Paredes, R. & Navarro, G. Optimal Incremental Sorting 2006 Proc. 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06) and 3rd Workshop on Analytic Algorithmics and Combinatorics (ANALCO'06)   inproceedings  
BibTeX:
@inproceedings{Paredes2006,
  author = {R. Paredes and G. Navarro},
  title = {Optimal Incremental Sorting},
  booktitle = {Proc. 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06) and 3rd Workshop on Analytic Algorithmics and Combinatorics (ANALCO'06)},
  publisher = {SIAM Press},
  year = {2006},
  pages = {171--182}
}
Parida, L. Some Results on Flexible-Pattern Discovery 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Parida2000,
  author = {L. Parida},
  title = {Some Results on Flexible-Pattern Discovery},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {33--45}
}
Parida, L., Gao, Y., Platt, D., Floratos, A. & Rigoutsos, I. Pattern Discovery on Character Sets and Real-valued Data: Linear Bound on Irredundant Motifs and an Efficient Polynomial Time Algorithm 2000 Proceedings ACM-SIAM Annual Symposium on Discrete Algorithms   inproceedings  
BibTeX:
@inproceedings{Parida2000a,
  author = {L. Parida and Y. Gao and D. Platt and A. Floratos and I. Rigoutsos},
  title = {Pattern Discovery on Character Sets and Real-valued Data: {L}inear Bound on Irredundant Motifs and an Efficient Polynomial Time Algorithm},
  booktitle = {Proceedings ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {297--308}
}
Park, S., Chu, W. W., Yoon, J. & Hsu, C. Fast Retrieval of Similar sub-sequences under time warping 2000 16th IEEE Internationall Conference on Data Engineering (ICDE)   inproceedings  
BibTeX:
@inproceedings{Park2000,
  author = {S.-H. Park and W. W. Chu and J.-H. Yoon and C.-C. Hsu},
  title = {Fast Retrieval of Similar sub-sequences under time warping},
  booktitle = {16th IEEE Internationall Conference on Data Engineering (ICDE)},
  year = {2000},
  pages = {??--??}
}
Peér, I., Shamir, R. & Sharan, R. Incomplete Directed Perfect Phylogeny 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Peer2000,
  author = {I. Pe\'er and R. Shamir and R. Sharan},
  title = {Incomplete Directed Perfect Phylogeny},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {143--153}
}
Pereira, F. C. N. Machine Learning for Efficient Natural-Language Processing 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Pereira2000,
  author = {F. C. N. Pereira},
  title = {Machine Learning for Efficient Natural-Language Processing},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {11}
}
Pevzner, P. A. Computational Molecular Biology: An Algorithmic Approach 2000   book  
BibTeX:
@book{Pevzner2000,
  author = {P. A. Pevzner},
  title = {Computational Molecular Biology: An Algorithmic Approach},
  publisher = {MIT Press},
  year = {2000}
}
Pevzner, P. A. & Sze, S. Combinatorial Approaches to Finding Subtle Signals in DNA Sequences 2000 Proceedings International Conference on Intelligent Systems for Molecular Biology   inproceedings  
BibTeX:
@inproceedings{Pevzner2000a,
  author = {P. A. Pevzner and S.-H. Sze},
  title = {Combinatorial Approaches to Finding Subtle Signals in {DNA} Sequences},
  booktitle = {Proceedings International Conference on Intelligent Systems for Molecular Biology},
  publisher = {AAAI Press},
  year = {2000},
  pages = {269--278}
}
Pinzón, Y. J., Christodoulakis, M. & Iliopoulos, C. S. Simple Algorithm for Sorting All the Fibonacci String Rotations 2006 Proceedings of the 32nd Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'06)   inproceedings  
BibTeX:
@inproceedings{Pinzon2006,
  author = {Yoan José Pinzón and Manolis Christodoulakis and Costas S. Iliopoulos},
  title = {Simple Algorithm for Sorting All the Fibonacci String Rotations},
  booktitle = {Proceedings of the 32nd Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'06)},
  publisher = {Springer-Verlag},
  year = {2006},
  volume = {3831},
  pages = {218-225}
}
Pinzón, Y. J., Christodoulakis, M., Iliopoulos, C. S. & Mohamed, M. Efficient (delta,gamma)-Matching with Don't Cares 2005 Proceedings of the 16-th Australasian Workshop on Combinatorial Algorithms (AWOCA'05)   inproceedings  
BibTeX:
@inproceedings{Pinzon2005d,
  author = {Yoan José Pinzón and Manolis Christodoulakis and Costas S. Iliopoulos and Manal Mohamed},
  title = {Efficient (delta,gamma)-Matching with Don't Cares},
  booktitle = {Proceedings of the 16-th Australasian Workshop on Combinatorial Algorithms (AWOCA'05)},
  publisher = {Ballarat, Victoria, Australia},
  year = {2005},
  pages = {27-38}
}
Pinzón, Y. J., Christodoulakis, M. & Mohamed, M. Wildcards in Delta-Matching 2005 Franco-Canadian Workshop on Combinatorial Algorithms (COMAL'05)   inproceedings  
BibTeX:
@inproceedings{Pinzon2005c,
  author = {Yoan José Pinzón and Manolis Christodoulakis and Manal Mohamed},
  title = {Wildcards in Delta-Matching},
  booktitle = {Franco-Canadian Workshop on Combinatorial Algorithms (COMAL'05)},
  year = {2005}
}
Pinzón, Y. J., Clifford, R. & Mohamed, M. Necklace Swap Problem for Rhythmic Similarity Measures" 2005 Proceedings of the 12th International Symposium on String Processing and Information Retrieval (SPIRE'05)   inproceedings  
BibTeX:
@inproceedings{Pinzon2005a,
  author = {Yoan José Pinzón and Raphaël Clifford and Manal Mohamed},
  title = {Necklace Swap Problem for Rhythmic Similarity Measures"},
  booktitle = {Proceedings of the 12th International Symposium on String Processing and Information Retrieval (SPIRE'05)},
  publisher = {Springer-Verlag, Berlin},
  year = {2005},
  volume = {3772},
  pages = {235-246}
}
Pinzón, Y. J., Iliopoulos, C. S., Landau, G. M. & Mohamed, M. Approximation Algorithm for the Cyclic Swap Problem 2005 Proceedings of the Prague Stringology Conference (PSC'05)   inproceedings  
BibTeX:
@inproceedings{Pinzon2005b,
  author = {Yoan José Pinzón and Costas S. Iliopoulos and Gad M. Landau and Manal Mohamed},
  title = {Approximation Algorithm for the Cyclic Swap Problem},
  booktitle = {Proceedings of the Prague Stringology Conference (PSC'05)},
  year = {2005},
  pages = {189-199}
}
Pinzón, Y. J. & Wang, S. Simple Algorithm for Pattern-Matching with Bounded Gaps in Genomic Sequences 2005 Proceedings of the International Conference on Numerical Analysis and Applied Mathematics (ICNAAM'05)   inproceedings  
BibTeX:
@inproceedings{Pinzon2005,
  author = {Yoan José Pinzón and Shu Wang},
  title = {Simple Algorithm for Pattern-Matching with Bounded Gaps in Genomic Sequences},
  booktitle = {Proceedings of the International Conference on Numerical Analysis and Applied Mathematics (ICNAAM'05)},
  publisher = {Wiley-VCH and Berlin},
  year = {2005},
  pages = {827-831}
}
Pisanti, N., Crochemore, M., Grossi, R. & Sagot, M. Bases of Motifs for Generating Repeated Patterns with Wild Cards 2005 IEEE/ACM Transactions on Computational Biology and Bioinformatics   article  
BibTeX:
@article{Pisanti2005a,
  author = {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie-France Sagot},
  title = {{B}ases of {M}otifs for {G}enerating {R}epeated {P}atterns with {W}ild {C}ards},
  journal = {{IEEE}/{ACM} {T}ransactions on {C}omputational {B}iology and {B}ioinformatics},
  year = {2005},
  volume = {2},
  number = {1},
  pages = {40–50}
}
Przywarski, R., Grabowski, S., Navarro, G. & Salinger, A. FM-KZ: An Even Simpler Alphabet-Independent FM-Index 2006 Proceedings of the 11th Prague Stringology Conference (PSC'06)   inproceedings  
BibTeX:
@inproceedings{Przywarski2006,
  author = {R. Przywarski and Sz. Grabowski and G. Navarro and A. Salinger},
  title = {{FM-KZ}: An Even Simpler Alphabet-Independent {FM-Index}},
  booktitle = {Proceedings of the 11th Prague Stringology Conference (PSC'06)},
  year = {2006},
  pages = {226--240}
}
Rahmann, S. & Rivals, E. Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Rahmann2000,
  author = {S. Rahmann and E. Rivals},
  title = {Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {375--387}
}
Reinert, G., Schbath, S. & Waterman, M. S. Probabilistic and Statistical Properties of Words: An Overview 2000 J. Comput. Bio.   article  
BibTeX:
@article{Reinert2000,
  author = {G. Reinert and S. Schbath and M. S. Waterman},
  title = {Probabilistic and Statistical Properties of Words: An Overview},
  journal = {J. Comput. Bio.},
  year = {2000},
  volume = {7},
  pages = {1--46}
}
Rick, C. Simple and fast linear space computation of longest common subsequences 2000 Inf. Process. Lett.   article  
BibTeX:
@article{Rick2000,
  author = {C. Rick},
  title = {Simple and fast linear space computation of longest common subsequences},
  journal = {Inf. Process. Lett.},
  year = {2000},
  volume = {75},
  number = {6},
  pages = {275--281}
}
Ristov, S. & Laporte, E. Ziv Lempel compression of huge natural language data tries using suffix arrays 2000 J. Discret. Algorithms   article  
BibTeX:
@article{Ristov2000,
  author = {S. Ristov and E. Laporte},
  title = {{Ziv Lempel} compression of huge natural language data tries using suffix arrays},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {241--256}
}
Rocke, E. Using Suffix Trees for Gapped Motif Discovery 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Rocke2000,
  author = {E. Rocke},
  title = {Using Suffix Trees for Gapped Motif Discovery},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {335--349}
}
Ruskey, F. & Sawada, J. Generating Necklaces and Strings with Forbidden Substrings 2000 Proceedings of the 6th Annual International Conference on Computing and Combinatorics   inproceedings  
BibTeX:
@inproceedings{Ruskey2000,
  author = {F. Ruskey and J Sawada},
  title = {Generating Necklaces and Strings with Forbidden Substrings},
  booktitle = {Proceedings of the 6th Annual International Conference on Computing and Combinatorics},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1858},
  pages = {330--339}
}
Ruskey, F. & Sawada, J. An fast algorithm to generate necklaces 2000 Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms   inproceedings  
BibTeX:
@inproceedings{Ruskey2000a,
  author = {F. Ruskey and J Sawada},
  title = {An fast algorithm to generate necklaces},
  booktitle = {Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms},
  year = {2000},
  pages = {256--262}
}
Régnier, M. A unified approach to word occurrence probabilities 2000 Discret. Appl. Math.   article  
BibTeX:
@article{R'egnier2000,
  author = {M. R{\'e}gnier},
  title = {A unified approach to word occurrence probabilities},
  journal = {Discret. Appl. Math.},
  year = {2000},
  volume = {104},
  pages = {259--280}
}
Régnier, M. & Mouchard, L. Periods and Quasiperiods Characterization 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{R'egnier2000a,
  author = {M. R{\'e}gnier and L. Mouchard},
  title = {Periods and Quasiperiods Characterization},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {388--396}
}
Sankoff, D. The early introduction of dynamic programming into computational biology 2000 Bioinformatics   article  
BibTeX:
@article{Sankoff2000,
  author = {D. Sankoff},
  title = {The early introduction of dynamic programming into computational biology},
  journal = {Bioinformatics},
  year = {2000},
  volume = {16},
  pages = {41--47}
}
Schbath, S. An Overview on the Distribution of Word Counts in Markov Chains 2000 J. Comput. Bio.   article  
BibTeX:
@article{Schbath2000,
  author = {S. Schbath},
  title = {An Overview on the Distribution of Word Counts in {M}arkov Chains},
  journal = {J. Comput. Bio.},
  year = {2000},
  volume = {7},
  pages = {193--201}
}
Senellart, J. Fast pattern matching in indexed texts 2000 Theor. Comput. Sci.   article  
BibTeX:
@article{Senellart2000,
  author = {J. Senellart},
  title = {Fast pattern matching in indexed texts},
  journal = {Theor. Comput. Sci.},
  year = {2000},
  volume = {237},
  number = {1--2},
  pages = {239--262}
}
Shibata, Kida, Fukamachi, Takeda, Shinohara, Shinohara & Arikawa Speeding Up Pattern Matching by Text Compression 2000 CIAC: Italian Conference on Algorithms and Complexity   inproceedings  
BibTeX:
@inproceedings{Shibata2000,
  author = {Shibata and Kida and Fukamachi and Takeda and Shinohara and Shinohara and Arikawa},
  title = {Speeding Up Pattern Matching by Text Compression},
  booktitle = {CIAC: Italian Conference on Algorithms and Complexity},
  year = {2000}
}
Shibata, Y., Matsumoto, T., Takeda, M., Shinohara, A. & Arikawa, S. A Boyer-Moore Type Algorithm for Compressed Pattern Matching 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Shibata2000a,
  author = {Y. Shibata and T. Matsumoto and M. Takeda and A. Shinohara and S. Arikawa},
  title = {A {Boyer-Moore} Type Algorithm for Compressed Pattern Matching},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {181--194}
}
Shibata, Y., Takeda, M., Shinohara, A. & Arikawa, S. Pattern Matching in Text Compressed by Using Antidictionaries 2000 J. Discret. Algorithms   article  
BibTeX:
@article{Shibata2000b,
  author = {Y. Shibata and M. Takeda and A. Shinohara and S. Arikawa},
  title = {Pattern Matching in Text Compressed by Using Antidictionaries},
  journal = {J. Discret. Algorithms},
  year = {2000},
  volume = {1},
  number = {1},
  pages = {257--269}
}
Sim, J. S., Iliopoulos, C., Park, K. & Smyth, W. Approximate Periods of Strings 2001 Theor. Comput. Sci.   article  
BibTeX:
@article{Sim2001,
  author = {J. S. Sim and C. Iliopoulos and K. Park and W.F. Smyth},
  title = {Approximate Periods of Strings},
  journal = {Theor. Comput. Sci.},
  year = {2001},
  volume = {262},
  number = {1--2},
  pages = {557--?}
}
Skiena, S. & Sumazin, P. Shift Error Detection in Standardized Exams 2000 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching   inproceedings  
BibTeX:
@inproceedings{Skiena2000,
  author = {S. Skiena and P. Sumazin},
  title = {Shift Error Detection in Standardized Exams},
  booktitle = {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching},
  publisher = {Springer-Verlag, Berlin},
  year = {2000},
  number = {1848},
  pages = {264--276}
}
Skopal, T., Snáv sel, V. & Krátký, M. Image Recognition Using Finite Automata 2002 Proceedings of the Prague Stringology Conference~'02   inproceedings  
BibTeX:
@inproceedings{Skopal2002,
  author = {T. Skopal and V. Sn\'a{\v s}el and M. Kr\'atk\'y},
  title = {Image Recognition Using Finite Automata},
  booktitle = {Proceedings of the Prague Stringology Conference~'02},
  year = {2002},
  pages = {88--95},
  note = {Research Report DC--2002--03}
}
Smyth, W. F. Computing Patterns in Strings 2003   book  
BibTeX:
@book{Smyth2003,
  author = {W. F. Smyth},
  title = {Computing Patterns in Strings},
  publisher = {Addison Wesley Pearson},
  year = {2003}
}
Smyth, W. F. Repetitive perhaps, but not boring 2000 Theor. Comput. Sci.   article  
BibTeX:
@article{Smyth2000,
  author = {W. F. Smyth},
  title = {Repetitive perhaps, but not boring},
  journal = {Theor. Comput. Sci.},
  year = {2000},
  volume = {249},
  number = {5},
  pages = {343--355}
}
Tompa, M. Finding Motifs Using Random Projections 2001 Proceedings Annual International Conference on Computational Molecular Biology (RECOMB)   inproceedings  
BibTeX:
@inproceedings{Tompa2001,
  author = {M. Tompa},
  title = {Finding Motifs Using Random Projections},
  booktitle = {Proceedings Annual International Conference on Computational Molecular Biology (RECOMB)},
  year = {2001},
  pages = {67--74}
}
Uribe, R., Granero, F. & Navarro, G. Voronoi-Tree: Optimización y Dinamismo 2005 Revista de la SCCC (Chile)   article  
BibTeX:
@article{Uribe2005,
  author = {R. Uribe and F. Granero and G. Navarro},
  title = {Voronoi-Tree: Optimizaci\'on y Dinamismo},
  journal = {Revista de la SCCC (Chile)},
  year = {2005},
  volume = {6},
  number = {1},
  note = {In Spanish.}
}
Uribe, R., Navarro, G., Barrientos, R. & Marín, M. An Index Data Structure for Searching in Metric Space Databases 2006 Proceedings of the 6th International Conference on Computational Science (ICCS 2006)   inproceedings  
BibTeX:
@inproceedings{Uribe2006,
  author = {Roberto Uribe and Gonzalo Navarro and Ricardo Barrientos and Mauricio Mar\'{i}n},
  title = {An Index Data Structure for Searching in Metric Space Databases},
  booktitle = {Proceedings of the 6th International Conference on Computational Science (ICCS 2006)},
  year = {2006},
  note = {To appear}
}
Vilo, J., Brazma, A., Jonassen, I., Robinson, A. & Ukkonen, E. Mining for Putative Regulatory Elements in the Yeast Genome using Gene Expression Data 2000 Proceedings International Conference on Intelligent Systems for Molecular Biology   inproceedings  
BibTeX:
@inproceedings{Vilo2000,
  author = {J. Vilo and A. Br{\={a}}zma and I. Jonassen and A. Robinson and E. Ukkonen},
  title = {Mining for Putative Regulatory Elements in the Yeast Genome using Gene Expression Data},
  booktitle = {Proceedings International Conference on Intelligent Systems for Molecular Biology},
  publisher = {AAAI Press},
  year = {2000},
  pages = {384--394}
}
Voracek, M., Melichar, B. & Christodoulakis, M. Generalized and Weighted Strings: Repetitions and Pattern Matching 2004 String Algorithmics   incollection  
BibTeX:
@incollection{Voracek2004,
  author = {M. Voracek and B. Melichar and M. Christodoulakis},
  title = {Generalized and Weighted Strings: Repetitions and Pattern Matching},
  booktitle = {String Algorithmics},
  publisher = {King's College Publications},
  year = {2004},
  pages = {225-248}
}
Watson, B. W. A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms 2000 Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia   inproceedings  
BibTeX:
@inproceedings{Watson2000,
  author = {B. W. Watson},
  title = {A new family of {Commentz-Walter}-style multiple-keyword pattern matching algorithms},
  booktitle = {Proceedings of the Prague Stringology Club Workshop~'2000, Bratislava, Slovakia},
  year = {2000},
  pages = {71--76},
  note = {Collaborative Report DC--2000--03}
}
Zhang, H., Guo, Q. & S.Iliopoulos, C. String Matching with swaps in a Weighted Sequence 2004 Proceedings of International Symposium on Computational and Information Sciences (CIS 04)   inproceedings  
BibTeX:
@inproceedings{Zhang2004,
  author = {Hui Zhang and Qing Guo and Costas S.Iliopoulos},
  title = {String Matching with swaps in a Weighted Sequence},
  booktitle = {Proceedings of International Symposium on Computational and Information Sciences (CIS 04)},
  year = {2004}
}
Zobel, J., Heinz, S. & Williams, H. E. In-memory hash tables for accumulating text vocabularies 2001 Inf. Process. Lett.   article  
BibTeX:
@article{Zobel2001,
  author = {J. Zobel and S. Heinz and H. E. Williams},
  title = {In-memory hash tables for accumulating text vocabularies},
  journal = {Inf. Process. Lett.},
  year = {2001},
  volume = {80},
  number = {6},
  pages = {271--277}
}

Created by JabRef on 05/03/2007.