default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2010: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2010, ISBN 978-80-01-04597-8
Invited Talk
- Maxime Crochemore, Dov M. Gabbay:
Reactive Links to Save Automata States. 1-8
Regular Contributions
- Noud de Beijer, Loek G. Cleophas, Derrick G. Kourie, Bruce W. Watson:
Improving Automata Efficiency by Stretching and Jamming. 9-24 - Jan Lahoda, Jan Zdárek:
Simple Tree Pattern Matching for Trees in the Prefix Bar Notation. 25-36 - Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Approximate String Matching Allowing for Inversions and Translocations. 37-51 - Raphaël Clifford, Alexandru Popa:
(In)approximability Results for Pattern Matching Problems. 52-62 - Domenico Cantone, Salvatore Cristofaro, Simone Faro:
A Space-Efficient Implementation of the Good-Suffix Heuristic. 63-75 - Martin Berglund, Frank Drewes:
On the Complexity of Variants of the k Best Strings Problem. 76-88 - Giuseppe Lancia, Romeo Rizzi, Russell Schwartz:
Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. 89-102 - Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability. 103-115 - Shmuel Tomi Klein
, Dana Shapira:
Practical Fixed Length Lempel Ziv Coding. 116-126 - Szymon Grabowski, Wojciech Bieniecki:
Tight and Simple Web Graph Compression. 127-137 - Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New Simple Efficient Algorithms Computing Powers and Runs in Strings. 138-149 - Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Inferring Strings from Runs. 150-160 - Golnaz Badkobeh, Maxime Crochemore:
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. 161-166 - Kazuhiko Kusano, Ayumi Shinohara:
Average Number of Runs and Squares in Necklace. 167-177 - Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson:
The Number of Runs in a Ternary Word. 178-181 - Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie:
Formal Characterizations of FA-based String Processors. 183-185
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 2024-11-15 19:47 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:
