default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2016: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2016, ISBN 978-80-01-05996-8
Invited Talk
- Shmuel Tomi Klein
:
The Use and Usefulness of Fibonacci Codes. 1-5
Regular Contributions
- Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings. 7-21 - Kamil Awid, Loek Cleophas, Bruce W. Watson:
Using Human Computation in Dead-zone based 2D Pattern Matching. 22-32 - Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski:
Generating All Minimal Petri Net Unsolvable Binary Words. 33-46 - Mwawi F. Msiska, Lynette van Zijl:
Interpreting the Subset Construction Using Finite Sublanguages. 48-62 - Gilad Baruch, Shmuel Tomi Klein, Dana Shapira:
Accelerated Partial Decoding in Wavelet Trees. 63-69 - Igor O. Zavadskyi, Anatoly V. Anisimov:
A Family of Data Compression Codes with Multiple Delimiters. 71-83 - Camille Marchet, Antoine Limasset, Lucie Bittner, Pierre Peterlongo:
A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics. 85-97 - Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio:
The String Matching Algorithms Research Tool. 99-111 - Sukhpal Singh Ghuman, Jorma Tarhio:
Jumbled Matching with SIMD. 114-124 - Neerja Mhaskar, Michael Soltys:
Forced Repetitions over Alphabet Lists. 125-134 - Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. 135-145 - Ondrej Guth:
Computing All Approximate Enhanced Covers with the Hamming Distance. 146-157 - Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Index and LZ Factorization in Compressed Space. 158-170 - Frantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth:
Algorithms to Compute the Lyndon Array. 172-184
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-04 22:06 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:
