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