


default search action
Prague Stringology Conference 2002: Prague, Czech Republic
- Miroslav Balík, Milan Simánek:

Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, September 23-24, 2002. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2002, ISBN 80-01-02616-7
Regular Contributions
- Sergio De Agostino:

A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching. 1-8 - Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:

A Note on Randomized Algorithm for String Matching with Mismatches. 9-17 - Kirke Bent:

A Recursive Function for Calculating the Number of Legal Strings of Parentheses and for Calculating Catalan Numbers. 18-27 - Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:

Border Array on Bounded Alphabet. 28-35 - Frantisek Franek, William F. Smyth, Xiangdong Xiao:

A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach. 56-43 - Heikki Hyyrö:

A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances. 44-54 - Costas S. Iliopoulos, Masahiro Kurokawa:

String Matching with Gaps for Musical Melodic Recognition. 55-64 - Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis:

String Regularities with Don't Cares. 65-74 - Shunsuke Inenaga:

Bidirectional Construction of Suffix Trees. 75-87 - Tomás Skopal, Václav Snásel, Michal Krátký:

Image Recognition Using Finite Automata. 88-95 - Jean-Marc Champarnaud, Ahmed Khorsi, Thomas Paranthoën:

Split and join for minimizing: Brzozowski's algorithm. 96-104

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














