default search action
Prague Stringology Conference 2012: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2012, Prague, Czech Republic, August 27-28, 2012. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2012, ISBN 978-80-01-05095-8
Invited Talk
- Bruce W. Watson:
Correctness-by-Construction in Stringology. 1-2
Regular Contributions
- Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel Tomi Klein, Yair Toaff:
Similarity Based Deduplication with Small Data Chunks. 3-17 - Sergio De Agostino:
LZW Data Compression on Large Scale and Extreme Distributed Systems. 18-27 - Derrick G. Kourie, Bruce W. Watson, Loek G. Cleophas, Fritz Venter:
Failure Deterministic Finite Automata. 28-41 - Thomas Hanneforth, Bruce W. Watson:
An Efficient Parallel Determinisation Algorithm for Finite-state Automata. 42-52 - Guillaume Holley, Pierre Peterlongo:
BlastGraph: Intensive Approximate Pattern Matching in Sequence Graphs and de-Bruijn Graphs. 53-63 - David Becerra, Juan Mendivelso, Yoan J. Pinzón:
A Multiobjective Approach to the Weighted Longest Common Subsequence Problem. 64-74 - Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski:
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. 75-88 - Marcin Piatkowski, Wojciech Rytter:
The Number of Cubes in Sturmian Words. 89-102 - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
Quasi-linear Time Computation of the Abelian Periods of a Word. 103-110 - Antoine Deza, Frantisek Franek, Mei Jiang:
A Computational Framework for Determining Square-maximal Strings. 111-119
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.