22. CPM 2011: Palermo, Italy

Invited Talks

• Gad M. Landau:
  Algorithms on Grammar-Compressed Strings. 1
  
• Nello Cristianini:
  Automatic Discovery of Patterns in Media Content. 2-13
  
• Martin Vingron:
  Computational Regulatory Genomics. 14
  

Contributed Papers

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

Last update Sat May 25 02:37:04 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page