zbMATH — the first resource for mathematics

29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. (English) Zbl 1390.68025
LIPIcs – Leibniz International Proceedings in Informatics 105. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-074-3). xii, 24 articles, not consecutively paged, electronic only, open access (2018).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1366.68006].
Indexed articles:
Sakai, Yoshifumi, Maximal common subsequence algorithms, Article 1, 10 p. [Zbl 07286727]
Henriques, Rui; Francisco, Alexandre P.; Russo, Luís M. S.; Bannai, Hideo, Order-preserving pattern matching indeterminate strings, Article 2, 15 p. [Zbl 07286728]
Baier, Uwe, On undetected redundancy in the Burrows-Wheeler transform, Article 3, 15 p. [Zbl 07286729]
Amir, Amihood; Levy, Avivit; Porat, Ely, Quasi-periodicity under mismatch errors, Article 4, 15 p. [Zbl 07286730]
Brubach, Brian, Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant, Article 5, 14 p. [Zbl 07286731]
Blin, Guillaume; Blondin, Massé Alexandre; Gasparoux, Marie; Hamel, Sylvie; Vandomme, Élise, Nearest constrained circular words, Article 6, 14 p. [Zbl 07286732]
Bannai, Hideo; Gagie, Travis; Tomohiro, I., Online LZ77 parsing and matching statistics with RLBWTs, Article 7, 12 p. [Zbl 07286733]
Hooshmand, Sahar; Abedin, Paniz; Külekci, M. Oğuzhan; Thankachan, Sharma V., Non-overlapping indexing – cache obliviously, Article 8, 9 p. [Zbl 07286734]
Aoyama, Kotaro; Nakashima, Yuto; I., Tomohiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki, Faster online elastic degenerate string matching, Article 9, 10 p. [Zbl 07286735]
Akutsu, Tatsuya; de la Higuera, Colin; Tamura, Takeyuki, A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications, Article 10, 12 p. [Zbl 07286736]
Amir, Amihood; Boneh, Itai, Locally maximal common factors as a tool for efficient dynamic string algorithms, Article 11, 13 p. [Zbl 07286737]
Funakoshi, Mitsuru; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki, Longest substring palindrome after edit, Article 12, 14 p. [Zbl 07286738]
Brubach, Brian; Ghurye, Jay, A succinct four russians speedup for edit distance computation and one-against-many banded alignment, Article 13, 12 p. [Zbl 07286739]
Zhang, Shu; Zhu, Daming; Jiang, Haitao; Ma, Jingjing; Guo, Jiong; Feng, Haodi, Can a permutation be sorted by best short swaps?, Article 14, 12 p. [Zbl 07286740]
Inoue, Takafumi; Inenaga, Shunsuke; Hyyrö, Heikki; Bannai, Hideo; Takeda, Masayuki, Computing longest common square subsequences, Article 15, 13 p. [Zbl 07286741]
Dudek, Bartłomiej; Gawrychowski, Paweł, Slowing down top trees for better worst-case compression, Article 16, 8 p. [Zbl 07286742]
Fertin, Guillaume; Fradin, Julien; Komusiewicz, Christian, On the maximum colorful arborescence problem and color hierarchy graph structure, Article 17, 15 p. [Zbl 07286743]
Chikhi, Rayan; Schönhuth, Alexander, Dualities in tree representations, Article 18, 12 p. [Zbl 07286744]
Urabe, Yuki; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki, Longest Lyndon substring after edit, Article 19, 10 p. [Zbl 07286745]
Abedin, Paniz; Hooshmand, Sahar; Ganguly, Arnab; Thankachan, Sharma V., The heaviest induced ancestors problem revisited, Article 20, 13 p. [Zbl 07286746]
Cazaux, Bastien; Rivals, Eric, Superstrings with multiplicities, Article 21, 16 p. [Zbl 07286747]
Shin, Kilho; Ishikawa, Taichi, Linear-time algorithms for the subpath kernel, Article 22, 13 p. [Zbl 07286748]
Charalampopoulos, Panagiotis; Crochemore, Maxime; Iliopoulos, Costas S.; Kociumaka, Tomasz; Pissis, Solon P.; Radoszewski, Jakub; Rytter, Wojciech; Waleń, Tomasz, Linear-time algorithm for long LCF with \(k\) mismatches, Article 23, 16 p. [Zbl 07286749]
Furuya, Isamu; Nakashima, Yuto; I., Tomohiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki, Lyndon factorization of grammar compressed texts revisited, Article 24, 10 p. [Zbl 07286750]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68W32 Algorithms on strings
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI Link