


default search action
Prague Stringology Club Workshop 1999: Prague, Czech Republic
- Jan Holub, Milan Simánek:

Proceedings of the Prague Stringology Club Workshop 1999, Prague, Czech Republic, July 8-9, 1999. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 1999
Regular Contributions
- Gabriela Andrejková:

The Closest Common Subsequence Problems. 1-15 - Thomas Berry, Somasundaram Ravindran:

A Fast String Matching Algorithm and Experimental Results. 16-28 - Weiler Alves Finamore, Rafael Donnici de Azevedo, Marcelo da Silva Pinho:

On Procedures for Multiple-string Match with Respect to Two Sets. 29-39 - Heiko Goeman, Michael Clausen:

A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem. 40-60 - Fei Shi, Dong-Guk Shin:

Centroid Trees with Application to String Processing. 61-72

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














