Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd CPM 2012: Helsinki, Finland
- Juha Kärkkäinen, Jens Stoye
:
Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. Lecture Notes in Computer Science 7354, Springer 2012, ISBN 978-3-642-31264-9
Invited Talks
- Ron Shamir:
Gene Regulation, Protein Networks and Disease: A Computational Perspective. 1 - Gonzalo Navarro:
Wavelet Trees for All. 2-26
Contributed Papers
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. 27-40 - Aïda Ouangraoua, Mathieu Raffinot:
Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract). 41-55 - Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann:
Partitioning into Colorful Components by Minimum Edge Deletions. 56-69 - Dima Blokh, Danny Segev, Roded Sharan:
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. 70-82 - Dany Breslauer, Leszek Gasieniec, Roberto Grossi:
Constant-Time Word-Size String Matching. 83-96 - Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Pattern Matching in Multiple Streams. 97-109 - Omar AitMous, Frédérique Bassino, Cyril Nicaud:
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. 110-123 - Christian Hundt, Florian Wendland:
Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation. 124-137 - Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette:
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. 138-148 - Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. 149-158 - Anne Condon, Ján Manuch, Chris Thachuk:
The Complexity of String Partitioning. 159-172 - Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan:
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval. 173-184 - Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Document Listing for Queries with Excluded Pattern. 185-195 - Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-Document Pattern Matching. 196-207 - Michael P. Ferguson:
FEMTO: Fast Search of Large Sequence Collections. 208-219 - Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. 220-231 - Pawel Gawrychowski:
Simple and Efficient LZW-Compressed Multiple Pattern Matching. 232-242 - Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler Transform of a String and Its Reverse. 243-256 - Wing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan:
Efficient Algorithm for Circular Burrows-Wheeler Transform. 257-268 - Niko Välimäki:
Least Random Suffix/Prefix Matches in Output-Sensitive Time. 269-279 - Djamal Belazzougui, Rossano Venturini:
Compressed String Dictionary Look-Up with Edit Distance One. 280-292 - Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Longest Common Extensions. 293-305 - Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will:
Local Exact Pattern Matching for Non-fixed RNA Structures. 306-320 - Saad Sheikh, Rolf Backofen, Yann Ponty:
Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots. 321-333 - Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li:
Finding Longest Common Segments in Protein Structures in Nearly Linear Time. 334-348 - Haitao Jiang, Binhai Zhu:
A Linear Kernel for the Complementary Maximal Strip Recovery Problem. 349-359 - Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu:
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees. 360-372 - David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. 373-384 - Jesper Jansson, Andrzej Lingas:
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. 385-398 - Riccardo Dondi, Nadia El-Mabrouk:
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms. 399-412 - Liviu Petrisor Dinu, Alexandru Popa:
On the Closest String via Rank Distance. 413-426 - Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. 427-438 - Zhi-Zhong Chen, Lusheng Wang, Wenji Ma:
The Parameterized Complexity of the Shared Center Problem. 439-452
a service of 
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 2024-04-18 20:19 CEST 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:
