CPM 2008: Pisa, Italy
Invited Talks.
Proceedings.
- Christian Hundt, Maciej Liskiewicz:
Two-Dimensional Pattern Matching with Combined Scaling and Rotation. 5-17
download presentation (PPT)
download paper
- Roman Kolpakov, Gregory Kucherov:
Searching for Gapped Palindromes. 18-30
download presentation (PPT)
download paper
- Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems 31-43
download presentation (PDF)
download paper
- Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li:
Finding Largest Well-Predicted Subset of Protein Structure Models. 44-55
download presentation (PPT)
download paper
- Anne Bergeron, Julia Mixtacki, Jens Stoye:
HP Distance Via Double Cut and Join Distance. 56-68
download presentation (PDF)
download paper
- Mathias Mohl, Sebastian Will, Rolf Backofen:
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. 69-81
download presentation (PPT)
download paper
- Leszek Gasieniec, Cindy Y. Li, Meng Zhang:
Faster Algorithm for the Set Variant of the String Barcoding Problem. 82-94
download presentation (PPT)
download paper
- Tobias Marschall, Sven Rahmann:
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. 95-106
download presentation (PDT)
download paper
- Julien Fayolle:
Analysis of the Size of Antidictionary in DCA. 107-117
download paper
- Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. 118-129
download paper
- Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha:
On-Line Approximate String Matching with Bounded Errors. 130-142
download presentation (PPT)
download paper
- Raphael Clifford, Klim Efremenko, Benny Porat, Ely Porat:
A Black Box for Online Approximate Pattern Matching. 143-151
download presentation (PPT)
download paper
- Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree. 152-165
download presentation (PDF)
download paper
- Igor Nitto, Rossano Venturini:
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices. 166-177
download presentation (PDF)
download paper
- Ge Nong, Sen Zhang, Wai Hong Chan:
Computing Inverse ST in Linear Complexity. 178-190
download presentation (PPT)
download paper
- Luis M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Dynamic Fully-Compressed Suffix Trees.
download presentation (PDF) 191-203
download paper
- Martin Farach-Colton, Yang Huang:
A Linear Delay Algorithm for Building Concept Lattices. 204-216
download presentation (PDF)
download paper
- Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani:
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. 217-229
download presentation (PDF)
download paper
- Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson:
Fast Algorithms for Computing Tree LCS. 230-243
download presentation (PDF)
download paper
- Bin Ma:
Why Greed Works for Shortest Common Superstring Problem. 244-254
download presentation (PPT)
download paper
- Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein:
Constrained LCS: Hardness and Approximation. 255-262
download presentation (PPT)
download paper
- Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang:
Finding Additive Biclusters with Random Background. 263-276
download presentation (PPT)
download paper
- Diego Arroyuelo:
An Improved Succinct Representation for Dynamic k-ary Trees. 277-289
download presentation (PPT)
download paper
- Maxime Crochemore, Lucian Ilie, Liviu Tinta:
Towards a Solution to the "Runs" Conjecture. 290-302
download presentation (PDF)
download paper
- Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the Longest Common Parameterized Subsequence. 303-315
download paper