default search action
29th CPM 2018: Qingdao, China
- Gonzalo Navarro, David Sankoff, Binhai Zhu:
Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. LIPIcs 105, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-074-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Yoshifumi Sakai:
Maximal Common Subsequence Algorithms. 1:1-1:10 - Rui Henriques
, Alexandre P. Francisco
Order-Preserving Pattern Matching Indeterminate Strings. 2:1-2:15 - Uwe Baier:
On Undetected Redundancy in the Burrows-Wheeler Transform. 3:1-3:15 - Amihood Amir, Avivit Levy, Ely Porat:
Quasi-Periodicity Under Mismatch Errors. 4:1-4:15 - Brian Brubach:
Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant. 5:1-5:14 - Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme
Nearest constrained circular words. 6:1-6:14 - Hideo Bannai, Travis Gagie
Online LZ77 Parsing and Matching Statistics with RLBWTs. 7:1-7:12 - Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci
Non-Overlapping Indexing - Cache Obliviously. 8:1-8:9 - Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Online Elastic Degenerate String Matching. 9:1-9:10 - Tatsuya Akutsu
A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. 10:1-10:12 - Amihood Amir, Itai Boneh:
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. 11:1-11:13 - Mitsuru Funakoshi
Longest substring palindrome after edit. 12:1-12:14 - Brian Brubach, Jay Ghurye:
A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment. 13:1-13:12 - Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng:
Can a permutation be sorted by best short swaps?. 14:1-14:12 - Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda:
Computing longest common square subsequences. 15:1-15:13 - Bartlomiej Dudek
Slowing Down Top Trees for Better Worst-Case Compression. 16:1-16:8 - Guillaume Fertin, Julien Fradin, Christian Komusiewicz:
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. 17:1-17:15 - Rayan Chikhi, Alexander Schönhuth:
Dualities in Tree Representations. 18:1-18:12 - Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Lyndon Substring After Edit. 19:1-19:10 - Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
The Heaviest Induced Ancestors Problem Revisited. 20:1-20:13 - Bastien Cazaux, Eric Rivals
Superstrings with multiplicities. 21:1-21:16 - Kilho Shin, Taichi Ishikawa:
Linear-time algorithms for the subpath kernel. 22:1-22:13 - Panagiotis Charalampopoulos
Linear-Time Algorithm for Long LCF with k Mismatches. 23:1-23:16 - Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Lyndon Factorization of Grammar Compressed Texts Revisited. 24:1-24:10
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 2024-12-29 20:18 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: