CPM 2011: Palermo, Italy

• CPM 2011 Group Photo 1
• CPM 2011 Group Photo 2
• CPM 2011 Group Photo 3
• CPM 2011 Group Photo 4
• CPM 2011 Group Photo 5

• Gad M. Landau:
  Algorithms on Grammar-Compressed Strings. 1
   download paper
• Nello Cristianini:
  Automatic Discovery of Patterns in Media Content. 2-13
   download paper
• Martin Vingron:
  Implicit Hitting Set Problems and Multi-genome Alignment. 14
   download paper

• Enno Ohlebusch, Simon Gog:
  Lempel-Ziv Factorization Revisited. 15-26
   download presentation (PDF)
   download paper
• Chris Thachuk:
  Succincter Text Indexing with Wildcards. 27-40
   download presentation (PDF)
   download paper
• Sebastian Kreft, Gonzalo Navarro:
  Self-indexing Based on LZ77. 41-54
   download paper
• Haitao Jiang, Farong Zhong, Binhai Zhu:
  Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies. 55-64
   download presentation (PPT)
   download paper
• David E. Daykin, Jacqueline W. Daykin, William F. Smyth:
  String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. 65-76
   download presentation (PDF)
   download paper
• Antoine Deza, Frantisek Franek, Mei Jiang:
  A d-Step Approach for Distinct Squares in Strings. 77-89
   download paper
• Cedric Chauve, Jan Manuch, Murray Patterson, Roland Wittler:
  Tractability Results for the Consecutive-Ones Property with Multiplicity. 90-103
   download presentation (PDF)
   download paper
• Stefanie Schirmer, Robert Giegerich:
  Forest Alignment with Affine Gaps and Anchors. 104-117
   download presentation (PDF)
   download paper
• Wolfgang Otto, Peter F. Stadler, Sonja J. Prohaska:
  Phylogenetic Footprinting and Consistent Sets of Local Aligments. 118-131
   download presentation (PDF)
   download paper
• Michel Habib, Juraj Stacho:
  Unique Perfect Phylogeny Is NP-Hard. 132-146
   download presentation (PDF)
   download paper
• Daniel Gregory Brown, Jakub Truszkowski:
  Fast Error-Tolerant Quartet Phylogeny Algorithms. 147-161
   download paper
• Dany Breslauer, Zvi Galil:
  Real-Time Streaming String-Matching. 162-172
   download paper
• Dany Breslauer, Roberto Grossi, Filippo Mignosi:
  Simple Real-Time Constant-Space String Matching. 173-183
   download paper
• Raphael Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
  Space Lower Bounds for Online Pattern Matching. 184-196
   download paper
• Travis Gagie, Juha Karkkainen:
  Counting Colours in Compressed Strings. 197-207
   download presentation (PDF)
   download paper
• German Tischler:
  On Wavelet Tree Construction. 208-218
   download presentation (PDF)
   download paper
• Markus J. Bauer, Anthony J. Cox, Giovanna Rosone:
  Lightweight BWT Construction for Very Large String Collections. 219-231
   download paper
• Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
  Palindrome Pattern Matching. 232-245
   download presentation (PPTX)
   download paper
• Takashi Uemura, Hiroki Arimura:
  Sparse and Truncated Suffix Trees on Variable-Length Codes. 246-260
   download paper
• Paolo Ferragina:
  On the Weak Prefix-Search Problem. 261-272
   download presentation (PPTX)
   download paper
• Isaac Goldstein, Moshe Lewenstein:
  Quick Greedy Computation for Minimum Common String Partitions. 273-284
   download paper
• Jeremy Barbay, Johannes Fischer, Gonzalo Navarro:
  LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. 285-298
   download paper
• Philip Bille, Inge Li Gortz:
  Substring Range Reporting. 299-308
   download presentation (PDF)
   download paper
• Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
  Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. 309-322
   download presentation (PDF)
   download paper
• Yassin Refahi, Etienne Farcot, Yann Guédon, Fabrice Besnard, Teva Vernoux, Christophe Godin:
  A Combinatorial Model of Phyllotaxis Perturbations in Arabidopsis thaliana. 323-335
   download presentation (PPT)
   download paper
• Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu:
  Tractability and Approximability of Maximal Strip Recovery. 336-349
   download paper
• Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
  Efficient Seeds Computation Revisited. 350-363
   download presentation (PDF)
   download paper
• Domenico Cantone, Salvatore Cristofaro, Simone Faro:
  Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. 364-375
   download paper
• Jesper Nielsen:
  A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths. 376-387
   download paper
• Riccardo Dondi, Guillaume Fertin, Stephane Vialette:
  Finding Approximate and Constrained Motifs in Graphs. 388-401
   download presentation (PDF)
   download paper
• Kouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama:
  Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees. 402-415
   download paper
• Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan:
  Approximation Algorithms for Orienting Mixed Graphs. 416-428
   download presentation (PDF)
   download paper
• Stephane Gosselin, Guillaume Damiand, Christine Solnon:
  Frequent Submap Discovery. 429-440
   download presentation (PDF)
   download paper
• Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson:
  Edit Distance with Duplications and Contractions Revisited. 441-454
   download presentation (PPTX)
   download paper
• Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
  Polynomial-Time Approximation Algorithms for Weighted LCS Problem. 455-466
   download presentation (PDF)
   download paper
• Raphael Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
  Restricted Common Superstring and Restricted Common Supersequence. 467-478
   download presentation (PDF)
   download paper