default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2021: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Prague Stringology Conference 2021, Prague, Czech Republic, August 30-31, 2021. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2021, ISBN 978-80-01-06869-4
Regular Contributions
- Eliska Sestáková, Ondrej Guth, Jan Janousek:
Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance. 1-15 - Waltteri Pakalén, Hannu Peltola, Jorma Tarhio, Bruce W. Watson:
Pitfalls of Algorithm Comparison. 16-29 - Cédric Chauve, Marni Mishna, France Paquet-Nadeau:
Refined Upper Bounds on the Size of the Condensed Neighbourhood of Sequences. 30-40 - Frantisek Franek, Michael Liut:
Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited. 41-52 - Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. 53-60 - Stefan Hoffmann:
The n-ary Initial Literal and Literal Shuffle. 61-74 - Simone Faro, Francesco Pio Marino, Arianna Pavone
, Antonio Scardace:
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. 75-89 - Waltteri Pakalén, Jorma Tarhio, Bruce W. Watson:
Searching with Extended Guard and Pivot Loop. 90-102
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-11-29 00:04 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:
