default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2011: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2011, ISBN 978-80-01-04870-2
Invited Talk
- Simone Faro, Thierry Lecroq:
2001-2010: Ten Years of Exact String Matching Algorithms. 1-2
Regular Contributions
- Hannu Peltola, Jorma Tarhio:
Variations of Forward-SBNDM. 3-14 - Derrick G. Kourie, Bruce W. Watson, Loek G. Cleophas:
On Compile Time Knuth-Morris-Pratt Precomputation. 15-29 - Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Efficient Eager XPath Filtering over XML Streams. 30-44 - Mira Abraham, Haim J. Wolfson:
Inexact Graph Matching by "Geodesic Hashing" for the Alignment of Pseudoknoted RNA Secondary Structures. 45-57 - Martin Berglund:
Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable. 59-72 - Andrew Baker, Antoine Deza, Frantisek Franek:
A Parameterized Formulation for the Maximum Number of Runs Problem. 74-82 - Maria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot:
Finding Long and Multiple Repeats with Edit Distance. 83-97 - Frantisek Franek, Mei Jiang, Chia-Chun Weng:
An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm. 98-105 - Marcin Piatkowski, Wojciech Rytter:
Computing the Number of Cubic Runs in Standard Sturmian Words. 106-120 - Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Suffix Trees and Links on a Binary Alphabet. 121-130 - Johannes Bubenzer:
Minimization of Acyclic DFAs. 132-146 - Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato:
Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations. 147-161 - Radoslaw Glowinski, Wojciech Rytter:
Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words. 162-172 - Michael Hirsch, Shmuel Tomi Klein
, Yair Toaff:
Improving Deduplication Techniques by Accelerating Remainder Calculations. 173-183 - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Computing Abelian Periods in Words. 184-196 - Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Longest Common Substring/Subsequence of Non-linear Texts. 197-208 - Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski:
Algorithmics of Posets Generated by Words over Partially Commutative Alphabets. 209-219 - Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up. 220-225 - Kalle Karhu:
Improving Exact Search of Multiple Patterns From a Compressed Suffix Array. 226-231
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-01-15 20:55 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:
