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:0009:00 
Registration  
09:0009:05  G. Levi, Chair of CS Dept  Welcome 
09:0509:35  C. Hundt, M. Liskiewicz  Twodimensional pattern matching with combined scaling and rotation 
09:3510:05  R. Kolpakov, G. Kucherov  Searching for gapped palindromes 
10:0510:35  N. Betzler, M. Fellows, C. Komusiewicz, R. Niedermeier  Parameterized algorithms and hardness results for some graph motif problems 
10:3511:00  Coffee Break 

11:0012:00  Dan Gusfield, UC Davis  Invited Talk on "ReCombinatorics: phylogenetic networks with recombination" 
12:0012:30  S.C. Li, D. Bu, J. Xu, M. Li  Finding largest wellpredicted subset of protein structure models 
12:3013:00  A. Bergeron, J. Mixtacki, J. Stoye  HP distance via double cut and join distance 
13:0014:30  Lunch time  
14:3015:00  M. Moehl, S. Will, R. Backofen  Fixed parameter tractable alignment of RNA structures including arbitrary pseudoknots 
15:0015:30  L. Gasieniec, C.Y. Li, M. Zhang  Faster algorithm for the set variant of the string barcoding problem 
15:3016:00  Coffee Break  
16:0016:30  T. Marschall, S. Rahmann  Probabilistic arithmetic automata and their application to pattern matching statistics 
16:3017:00  J. Fayolle  Analysis of the size of the antidictionary in DCA 
17:3020:00  Social Event: Guided Tour of Piazza dei Miracoli  
 
THURSDAY, JUNE 19th, 2008  
Time  Authors  Paper Title 
09:0009:30  A. Amir, Y. Aumann, O. Kapah, A. Levy, E. Porat  Approximate string matching with address bit errors 
09:3010:00  M. Kiwi, G. Navarro, C. Telha  Online approximate string matching with bounded errors 
10:0010:30  R. Clifford, K. Efremenko, B. Porat, E. Porat  A black box for online approximate pattern matching 
10:3011:00  Coffee Break  
11:0012:00  Ian Munro, Waterloo  Invited Talk on "Lower Bounds for Succinct Data Structures" 
12:0012:30  J. Fischer, V. Makinen, G. Navarro  An(other) EntropyBounded Compressed Suffix Tree 
12:3013:00  I. Nitto, R. Venturini  On compact representations of allpairsshortestpathdistance matrices 
13:0014:30  Lunch time  
14:3015:00  G. Nong, S. Zhang, W.H. Chan  Computing inverse ST in linear complexity 
15:0015:30  L.M. Russo, G. Navarro, A. Oliveira  Dynamic fullycompressed suffix trees 
15:3016:00  Coffee Break  
16:0016:30  M. FarachColton, Y. Huang  A Linear delay algorithm for building concept lattices 
16:3017: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:0009:30  S. Mozes, D. Tsur, O. Weimann, M. ZivUkelson  Fast algorithms for computing tree LCS 
09:3010:00  B. Ma  Why greed works for shortest common superstring problem 
10:0010:30  Z. Gotthilf, D. Hermelin, M. Lewenstein  Constrained LCS: Hardness and approximation 
10:3011:00  Coffee Break 

11:0012:00  Prabhakar Raghavan, Yahoo! Research  Invited Talk on "The changing face of web search" 
12:0012:30  J. Xiao, L. Wang, X. Liu, T. Jiang  Finding additive biclusters with random background 
12:3013:00  D. Arroyuelo  An improved succinct representation for dynamic kary trees 
13:0014:30  Lunch time  
14:3015:00  M. Crochemore, L. Ilie, L. Tinta  Towards a solution to the ''runs'' conjecture 
15:0015:30  O. Keller, T. Kopelowitz, M. Lewenstein  On the longest common parameterized subsequence 
15:3016:00  Coffee Break  
16:0017:00  TBA  TBA 