default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th CPM 2008: Pisa, Italy
- Paolo Ferragina, Gad M. Landau:
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
Invited Talks
- Dan Gusfield:
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. 1-2 - J. Ian Munro:
Lower Bounds for Succinct Data Structures. 3 - Prabhakar Raghavan:
The Changing Face of Web Search. 4
Contributed Papers
- Christian Hundt, Maciej Liskiewicz:
Two-Dimensional Pattern Matching with Combined Scaling and Rotation. 5-17 - Roman Kolpakov
, Gregory Kucherov:
Searching for Gapped Palindromes. 18-30 - Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. 31-43 - Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li:
Finding Largest Well-Predicted Subset of Protein Structure Models. 44-55 - Anne Bergeron, Julia Mixtacki, Jens Stoye:
HP Distance Via Double Cut and Join Distance. 56-68 - Mathias Möhl, Sebastian Will, Rolf Backofen:
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. 69-81 - Leszek Gasieniec, Cindy Y. Li, Meng Zhang:
Faster Algorithm for the Set Variant of the String Barcoding Problem. 82-94 - Tobias Marschall, Sven Rahmann:
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. 95-106 - Julien Fayolle:
Analysis of the Size of Antidictionary in. 107-117 - Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. 118-129 - Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha:
On-Line Approximate String Matching with Bounded Errors. 130-142 - Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat:
A Black Box for Online Approximate Pattern Matching. 143-151 - Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree. 152-165 - Igor Nitto, Rossano Venturini:
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices. 166-177 - Ge Nong, Sen Zhang, Wai Hong Chan:
Computing Inverse ST in Linear Complexity. 178-190 - Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Dynamic Fully-Compressed Suffix Trees. 191-203 - Martin Farach-Colton, Yang Huang:
A Linear Delay Algorithm for Building Concept Lattices. 204-216 - Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani:
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. 217-229 - Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson:
Fast Algorithms for Computing Tree LCS. 230-243 - Bin Ma:
Why Greed Works for Shortest Common Superstring Problem. 244-254 - Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein:
Constrained LCS: Hardness and Approximation. 255-262 - Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang:
Finding Additive Biclusters with Random Background. 263-276 - Diego Arroyuelo:
An Improved Succinct Representation for Dynamic k-ary Trees. 277-289 - Maxime Crochemore, Lucian Ilie, Liviu Tinta:
Towards a Solution to the "Runs" Conjecture. 290-302 - Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the Longest Common Parameterized Subsequence. 303-315
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-16 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
