default search action
Prague Stringology Conference 2018: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2018, ISBN 978-80-01-06484-9
Invited Talk
- Esko Ukkonen:
Discovery of Regulatory Motifs in DNA. 1
Regular Contributions
- Ekaterina Benza, Shmuel Tomi Klein, Dana Shapira:
Fibonacci Based Compressed Suffix Array. 3-11 - Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
O(n log n)-time Text Compression by LZ-style Longest First Substitution. 12-26 - Shmuel Tomi Klein, Elina Opalinsky, Dana Shapira:
Synchronizing Dynamic Huffman Codes. 27-37 - Ali Alatabbi, Jacqueline W. Daykin, Mhaskar Neerja, Mohammad Sohel Rahman, William F. Smyth:
A Faster V-order String Comparison Algorithm. 38-48 - Filip Pavetic, Ivan Katanic, Gustav Matula, Goran Zuzic, Mile Sikic:
Fast and Simple Algorithms for Computing both LCSk and LCSk+. 50-62 - Frantisek Franek, Michael Liut, William F. Smyth:
On Baier's Sort of Maximal Lyndon Substrings. 63-78 - Eliska Sestáková, Borivoj Melichar, Jan Janousek:
Constrained Approximate Subtree Matching by Finite Automata. 79-90 - Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left Online Construction of Parameterized Position Heaps. 91-102 - B. Riva Shalom:
Parameterized Dictionary Matching with One Gap. 103-116 - Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Three Strategies for the Dead-Zone String Matching Algorithm. 117-128
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.