CPM B

31 papers

YearTitle / Authors
201627th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, June 27-29, 2016
Roberto Grossi, Moshe Lewenstein
2016A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem.
Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer
2016A Linear-Time Algorithm for the Copy Number Transformation Problem.
Ron Shamir, Meirav Zehavi, Ron Zeira
2016Boxed Permutation Pattern Matching.
Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj
2016Color-Distance Oracles and Snippets.
Tsvi Kopelowitz, Robert Krauthgamer
2016Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016Efficient Index for Weighted Sequences.
Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
2016Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost.
Manuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk
2016Encoding Two-Dimensional Range Top-k Queries.
Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti
2016Estimating Statistics on Words Using Ambiguous Descriptions.
Cyril Nicaud
2016Factorizing a String into Squares in Linear Time.
Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea
2016Fast Compatibility Testing for Rooted Phylogenetic Trees.
Yun Deng, David Fernández-Baca
2016Faster Longest Common Extension Queries in Strings over General Alphabets.
Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen
2016Finding Maximal 2-Dimensional Palindromes.
Sara H. Geizhals, Dina Sokol
2016Front Matter, Table of Contents, Preface.
2016Fully-online Construction of Suffix Trees for Multiple Texts.
Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura
2016Genomic Scaffold Filling Revisited.
Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu
2016Graph Motif Problems Parameterized by Dual.
Guillaume Fertin, Christian Komusiewicz
2016Hardness of RNA Folding Problem With Four Symbols.
Yi-Jun Chang
2016Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.
Uwe Baier
2016Longest Common Substring with Approximately k Mismatches.
Tatiana Starikovskaya
2016Minimal Suffix and Rotation of a Substring in Optimal Time.
Tomasz Kociumaka
2016On Almost Monge All Scores Matrices.
Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
2016On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching.
Johannes Fischer, Dominik Köppl, Florian Kurpicz
2016Optimal Prefix Free Codes with Partial Sorting.
Jérémy Barbay
2016Reconstruction of Trees from Jumbled and Weighted Subtrees.
Dénes Bartha, Peter Burcsi, Zsuzsanna Lipták
2016Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching.
Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang
2016Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.
Tsvi Kopelowitz, Ely Porat, Yaron Rozen
2016The Nearest Colored Node in a Tree.
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
2016Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
2016Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
Costas S. Iliopoulos, Jakub Radoszewski