Conference Programme
You can also download the CPM 2015 programme as a pdf.
A. Overview
Note that the CPM 2015 social programme will start on June 28 evening with a Welcome Cocktail. The scientific programme starts on June 29.
| June 28 (Sunday) | June 29 (Monday) | June 30 (Tuesday) | July 1 (Wednesday) | ||
|---|---|---|---|---|---|
| 08:30 | Registration | ||||
| 08:55 | Opening | ||||
| 09:00 | Invited Talk | Invited Talk | (starts at 9:10) Session 8 2 Talks |
||
| 10:00 | Mini Break | ||||
| 10:15 | Session 1 2 Talks |
Session 5 2 Talks |
Session 9 2 Talks |
||
| 11:05 | Coffee Break | ||||
| 11:30 | Session 2 4 Talks |
Session 6 4 Talks |
Session 10 4 Talks |
||
| 13:10 | Lunch break | ||||
| 14:40 | Invited Talk | Session 7 3 Talks |
Session 11 4 Talks |
||
| 15:40 | Mini Break | ||||
| 15:55 | Session 3 2 Talks |
Coffee Break | |||
| 16:20 | End of Day 2 | Coffee Break | |||
| 16:45 | Coffee Break | Session 12 3 Talks |
|||
| 17:10 | Session 4 2 Talks |
||||
| 18:00 | End of Day 1 |
Concert and Social Dinner |
End of CPM 2015 | ||
| 18:30 | Business Meeting | ||||
| 19:30 | Registration and Welcome Cocktail |
||||
B. Detailed Technical Programme
June 28 (Sunday)
- 19:30: Registration and Welcome Cocktail
June 29 (Monday)
- Invited Talk I:
- 09:00-10:00: Rasmus Pagh: On Multiseed Lossless Filtration
- Session 1
- 10:15-10:40: Pooya Davoodi, John Iacono, Gad M. Landau and Moshe Lewenstein : Range Minimum Query Indexes in Higher Dimensions
- 10:40-11:05: Pawel Gawrychowski and Patrick K. Nicholson: Encodings of Range Maximum-Sum Segment Queries and Applications
- Session 2
- 11:30-11:55: Wing-Kai Hon, Tak-Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting and Yilin Yang: Dictionary Matching With Uneven Gaps
- 11:55-12:20: Timothy M. Chan and Moshe Lewenstein: Fast String Dictionary Lookup with One Error
- 12:20-12:45: Gonzalo Navarro and Sharma V. Thankachan: Reporting Closest Substring Occurrences Under Bounded Gap Constraints
- 12:45-13:10: Sukhyeun Cho, Joong Chae Na and Jeong Seop Sim: Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
- Invited Talk II:
- 14:40-15:40: Wojciech Szpankowski: Analytic Pattern Matching: From DNA to Twitter
- Session 3
- 15:55-16:20: Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein and Hjalte Wedel Vildhøj: Longest Common Extensions in Sublinear Space
- 16:20-16:45: Juha Kärkkäinen, Dominik Kempa and Marcin Piatkowski: Tighter Bounds for the Sum of Irreducible LCP Values
- Session 4
- 17:10-17:35: Ivan Bliznets, Fedor Fomin, Petr Golovach, Nikolay Karpov, Alexander Kulikov and Saket Saurabh: Parameterized Complexity of Superstring Problems
- 17:35-18:00: Alexander Kulikov, Sergey Savinov and Evgeniy Sluzhaev: Greedy Conjecture for Strings of Length 4
June 30 (Tuesday)
- Invited Talk III:
- 09:00-10:00: Sorin Istrail: On Humans, Plants and Disease: Algorithmic Strategies for Haplotype Assembly Problems
- Session 5
- 10:15-10:40: Ron Zeira and Ron Shamir: Sorting by cuts, joins and duplications
- 10:40-11:05: Rayan Chikhi, Paul Medvedev, Martin Milanic and Sofya Raskhodnikova: On the readability of overlap digraphs
- Session 6
- 11:30-11:55: Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti and Simone Zaccaria: On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction problem
- 11:55-12:20: Jozef Hales, Jan Manuch, Yann Ponty and Ladislav Stacho: Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
- 12:20-12:45: Jesper Jansson, Andrzej Lingas and Eva-Marta Lundell: The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
- 12:45-13:10: Timo Beller and Enno Ohlebusch: Efficient construction of a compressed de Bruijn graph for pan-genome analysis
- Session 7
- 14:40-15:05: Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza and Mathieu Raffinot: Composite repetition-aware data structures
- 15:05-15:30: Johannes Fischer, Tomohiro I and Dominik Köppl: Lempel Ziv Computation In Small Space (LZ-CISS)
- 15:30-15:55: Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda: LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
- Session 8
- 09:10-09:35: Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen: String Powers in Trees
- 09:35-10:00: Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau and Oren Weimann: Longest Common Extensions in Trees
- Session 9
- 10:15-10:40: Gabriel Istrate and Cosmin Bonchis: Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
- 10:40-11:05: Amihood Amir and Benny Porat: On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
- Session 10
- 11:30-11:55: Johannes Fischer and Pawel Gawrychowski: Alphabet-Dependent String Searching with Wexponential Search Trees
- 11:55-12:20: Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda: Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- 12:20-12:45: Arnab Ganguly, Sharma V. Thankachan and Rahul Shah: Succinct Non-overlapping Indexing
- 12:45-13:10: Simon Gog and Matthias Petri: Compact Indexes for Flexible Top-k Retrieval
- Session 11
- 14:40-15:05: Dmitry Kosolobov: Online Detection of Repetitions with Backtracking
- 15:05-15:30: Sudip Biswas, Arnab Ganguly, Rahul Shah and Sharma Thankachan: Ranked Document Retrieval With Forbidden Pattern
- 15:30-15:55:Cyril Nicaud: A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
- 15:55-16:20: Juha Kärkkäinen, Dominik Kempa and Simon Puglisi: Parallel External Memory Suffix Sorting
- Session 12
- 16:45-17:10: Alexander Loptev, Gregory Kucherov and Tatiana Starikovskaya: On Maximal Unbordered Factors
- 17:10-17:35: Patrick K. Nicholson and Rajeev Raman: Encoding Nearest Larger Values
- 17:35-18:00: Djamal Belazzougui and Fabio Cunial: A framework for space-efficient string kernels