default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2003: Prague, Czech Republic
- Milan Simánek:
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, September 22-24, 2003. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2003, ISBN 80-01-02823-2
Regular Contributions
- Behshad Behzadi, Jean-Marc Steyaert:
The Transformation Distance Problem Revisited. 1-9 - Domenico Cantone, Simone Faro:
Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. 10-24 - Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. 25-36 - Loek G. Cleophas, Gerard Zwaan, Bruce W. Watson:
Constructing Factor Oracles. 37-50 - Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
Computing the Minimum k-Cover of a String. 51-64 - Abolfazl Fatholahzadeh:
Learning the Morphological Features of a Large Set of Words. 65-76 - Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. 77-90 - Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis:
Computing the Repetitions in a Weighted Sequence. 91-98 - Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Matching Numeric Strings under Noise. 99-110 - Borivoj Melichar, Milan Simánek:
Operation L-INSERT on Factor Automaton. 111-126 - Tetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa:
An Efficient Mapping for Score of String Matching. 127-136
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.
last updated on 2025-12-05 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
