CPM 2004: İstanbul, Turkey

• CPM 2004 Group Photo

• G. Myers:
  On The Shotgun DNA Sequencing Assembly Problem
  
• P. Indyk:
  Embedded Stringology
    download presentation (PPT)
  
• M. Farach-Colton:
  Suffix Trees, then and now
    download presentation (PPT)
  
• P. Ferragina:
  Indexing and Compression: Two sides of the same coin
    download presentation (PDF)
  

• E. Tannier, M. Sagot:
  Sorting by reversals in subquadratic time. 1-13
    download paper   download presentation (PPT)
  
• T. Barzuza, J. Beckmann, R. Shamir, I. Pe'er:
  Computational Problems in Perfect Phylogeny Haplotyping: XOR-Genotypes and Tag SNPs. 14-31
    download paper   download presentation (PPT)
  
• F. Swidan, M. Bender, D. Ge, S. He, H. Hu, R. Pinter:
  Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. 32-46
    download paper   download presentation (PDF)
  
• J. Xu, D. Brown, M. Li, B. Ma:
  Optimizing multiple spaced seeds for homology search. 47-58
    download paper   download presentation (PPT)
  
• R. Pinter, O. Rokhlenko, D. Tsur, M. Ziv-Ukelson:
  Approximate Labelled Subtree Homeomorphism. 59-73
    download paper   download presentation (PPT)
  
• S. Janson, S. Lonardi, W. Szpankowski:
  On average sequence complexity. 74-88
    download paper   download presentation (PDF)
  
• T. Suga, S. Shimonzono:
  Approximate Point Set Pattern Matching on Sequences and Planes. 89-101
    download paper   download presentation (PPT)
  
• S. Lonardi, W. Szpankowski, Q. Yang:
  Finding biclusters by random projections. 102-116
    download paper   download presentation (PDF)
  
• L. Gasieniec, R. Kolpakov:
  Real-time string matching in sublinear space. 117-129
    download paper   download presentation (PDF)
  
• Y. Jiao, J. Xu, M. Li:
  On the k-Closest Substring and k-Consensus Pattern Problems. 130-144
    download paper   download presentation (PPT)
  
• M. Crochemore, C. Epifanio, R. Grossi, F. Mignosi:
  A Trie-Based Approach for Compacting Automata. 145-158
    download paper   download presentation (PPT)
  
• R. Geary, N. Rahman, R. Raman, V. Raman:
  A Simple Optimal Representation for Balanced Parentheses. 159-172
    download paper   download presentation (PPT)
  
• G. Landau, G. Myers, M. Ziv-Ukelson:
  Two Algorithms for LCS Consecutive Suffix Alignment. 173-193
    download paper   download presentation (PDF)
  
• N. Bansal, M. Cieliebak, Z. Liptàk
  Efficient Algorithms for Finding Submasses in Weighted Strings. 194-204
    download paper   download presentation (PDF)
  
• V. Berry, F. Nicolas:
  Maximum Agreement and Maximum Compatible Supertrees. 205-219
    download paper   download presentation (PDF)
  
• A. Dessmark, J. Jansson, A. Lingas, E. Lundell:
  Polynomial-time algorithms for the ordered maximum agreement subtree problem. 220-229
    download paper
• A. Gupta, J. Manuch, L. Stacho, C. Zhu:
  Small phylogeny problem: character evolution trees. 230-243
    download paper   download presentation (PDF)
  
• P. Berman, B. DasGupta, D. Mubayi, R. Sloan, G. Turan, Y. Zhang:
  The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattice. 244-253
    download paper
• E. Davydov, S. Batzoglou:
  A Computational Model for RNA Multiple Structural Alignment. 254-269
    download paper
• R. Backofen, A. Busch:
  Computational Design of New and Recombinant Selenoproteins. 270-284
    download presentation (PDF)
  
• V. Choi, N. Goyal:
  A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. 285-296
    download paper
• G. Kucherov, L. Noe, M. Roytberg:
  Multi-seed lossless filtration. 297-310
    download paper   download presentation (PPT)
• G. Blin, G. Fertin, S. Vialette:
  New results for the 2-interval pattern problem. 311-322
    download paper
• G. Li, X. Qi, X. Wang, B. Zhu:
  A linear-time algorithm for computing translocation distance between signed genomes. 323-332
    download paper   download presentation (PDF)
  
• N. Efraty, G. Landau:
  Sparse normalized local alignment. 333-346
    download paper   download presentation (PPT)
  
• T. Schmidt, J. Stoye:
  Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. 347-358
    download paper   download presentation (PPT)
  
• M. Habib, C. Paul, M. Raffinot:
  Common connected components of interval graphs. 359-372
    download paper   download presentation (PDF)
  
• M. Csürös:
  Performing local similarity searches with variable length seeds. 373-387
    download paper   download presentation (PDF)
  
• A. Bergeron, J. Mixtacki, J. Stoye:
  Reversal distance without hurdles and fortresses. 388-399
    download paper   download presentation (PDF)
  
• R. Baeza-Yates:
  A Fast Set Intersection Algorithm for Sorted Sequences. 400-408
    download paper   download presentation (PDF)
  
• A. Amir, O. Kapah, D. Tsur:
  Faster Two Dimensional Pattern Matching with Rotations. 409-419
    download paper   download presentation (PDF)
  
• V. Makinen, G. Navarro:
  Compressed Compact Suffix Arrays. 420-433
    download paper   download presentation (PPT)
  
• N. Huynh, W. Hon, T. Lam, W. Sung:
  Approximate String Matching using Compressed Suffix Arrays. 434-444
    download paper   download presentation (PPT)
  
• H. Chan, W. Hon, T. Lam:
  Compressed Index for a Dynamic Collection of Texts. 445-456
    download paper   download presentation (PPT)
  
• K. Fredriksson, G. Navarro:
  Improved Single and Multiple Approximate String Matching. 457-471
    download paper   download presentation (PDF)
  
• M. Maass:
  Average-Case Analysis of Approximate Trie Search. 472-484
    download paper   download presentation (PDF)