TUESDAY, JUNE 17th, 2008 | ||
---|---|---|
This year we are proposing a "special" Welcome Meeting for CPM attendees. Indeed, June 17th is the day of the Patron of the city of Pisa, so that we suggest you to attend in the afternoon the beautiful Regatta of Saint Ranieri on the Arno River, just downtown Pisa. Actually, if you arrive the day before, namely June 16th, then you cannot miss in the evening the Illuminations of Saint Ranieri. | ||
WEDNESDAY, JUNE 18th, 2008 | ||
Time | Authors | Paper Title |
08:00-09:00 |
Registration | |
09:00-09:05 | G. Levi, Chair of CS Dept | Welcome |
09:05-09:35 | C. Hundt, M. Liskiewicz | Two-dimensional pattern matching with combined scaling and rotation |
09:35-10:05 | R. Kolpakov, G. Kucherov | Searching for gapped palindromes |
10:05-10:35 | N. Betzler, M. Fellows, C. Komusiewicz, R. Niedermeier | Parameterized algorithms and hardness results for some graph motif problems |
10:35-11:00 | Coffee Break |
|
11:00-12:00 | Dan Gusfield, UC Davis | Invited Talk on "ReCombinatorics: phylogenetic networks with recombination" |
12:00-12:30 | S.C. Li, D. Bu, J. Xu, M. Li | Finding largest well-predicted subset of protein structure models |
12:30-13:00 | A. Bergeron, J. Mixtacki, J. Stoye | HP distance via double cut and join distance |
13:00-14:30 | Lunch time | |
14:30-15:00 | M. Moehl, S. Will, R. Backofen | Fixed parameter tractable alignment of RNA structures including arbitrary pseudoknots |
15:00-15:30 | L. Gasieniec, C.Y. Li, M. Zhang | Faster algorithm for the set variant of the string barcoding problem |
15:30-16:00 | Coffee Break | |
16:00-16:30 | T. Marschall, S. Rahmann | Probabilistic arithmetic automata and their application to pattern matching statistics |
16:30-17:00 | J. Fayolle | Analysis of the size of the antidictionary in DCA |
17:30-20:00 | Social Event: Guided Tour of Piazza dei Miracoli | |
| ||
THURSDAY, JUNE 19th, 2008 | ||
Time | Authors | Paper Title |
09:00-09:30 | A. Amir, Y. Aumann, O. Kapah, A. Levy, E. Porat | Approximate string matching with address bit errors |
09:30-10:00 | M. Kiwi, G. Navarro, C. Telha | On-line approximate string matching with bounded errors |
10:00-10:30 | R. Clifford, K. Efremenko, B. Porat, E. Porat | A black box for online approximate pattern matching |
10:30-11:00 | Coffee Break | |
11:00-12:00 | Ian Munro, Waterloo | Invited Talk on "Lower Bounds for Succinct Data Structures" |
12:00-12:30 | J. Fischer, V. Makinen, G. Navarro | An(other) Entropy-Bounded Compressed Suffix Tree |
12:30-13:00 | I. Nitto, R. Venturini | On compact representations of all-pairs-shortest-path-distance matrices |
13:00-14:30 | Lunch time | |
14:30-15:00 | G. Nong, S. Zhang, W.H. Chan | Computing inverse ST in linear complexity |
15:00-15:30 | L.M. Russo, G. Navarro, A. Oliveira | Dynamic fully-compressed suffix trees |
15:30-16:00 | Coffee Break | |
16:00-16:30 | M. Farach-Colton, Y. Huang | A Linear delay algorithm for building concept lattices |
16:30-17:00 | W. Fraczak, W. Rytter, M. Yazdani | Matching integer intervals by minimal sets of binary words with "don't cares" |
19:00- | Social Dinner at Villa Poschi "Le Arcate" | |
| ||
FRIDAY, JUNE 20th, 2008 | ||
Time | Authors | Paper Title |
09:00-09:30 | S. Mozes, D. Tsur, O. Weimann, M. Ziv-Ukelson | Fast algorithms for computing tree LCS |
09:30-10:00 | B. Ma | Why greed works for shortest common superstring problem |
10:00-10:30 | Z. Gotthilf, D. Hermelin, M. Lewenstein | Constrained LCS: Hardness and approximation |
10:30-11:00 | Coffee Break |
|
11:00-12:00 | Prabhakar Raghavan, Yahoo! Research | Invited Talk on "The changing face of web search" |
12:00-12:30 | J. Xiao, L. Wang, X. Liu, T. Jiang | Finding additive biclusters with random background |
12:30-13:00 | D. Arroyuelo | An improved succinct representation for dynamic k-ary trees |
13:00-14:30 | Lunch time | |
14:30-15:00 | M. Crochemore, L. Ilie, L. Tinta | Towards a solution to the ''runs'' conjecture |
15:00-15:30 | O. Keller, T. Kopelowitz, M. Lewenstein | On the longest common parameterized subsequence |
15:30-16:00 | Coffee Break | |
16:00-17:00 | TBA | TBA |