CPM B

36 papers

YearTitle / Authors
2012A Linear Kernel for the Complementary Maximal Strip Recovery Problem.
Haitao Jiang, Binhai Zhu
2012An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata.
Omar AitMous, Frédérique Bassino, Cyril Nicaud
2012Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.
Dima Blokh, Danny Segev, Roded Sharan
2012Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings
Juha Kärkkäinen, Jens Stoye
2012Compressed String Dictionary Look-Up with Edit Distance One.
Djamal Belazzougui, Rossano Venturini
2012Computing the Burrows-Wheeler Transform of a String and Its Reverse.
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
2012Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles.
Jesper Jansson, Andrzej Lingas
2012Constant-Time Word-Size String Matching.
Dany Breslauer, Leszek Gasieniec, Roberto Grossi
2012Cross-Document Pattern Matching.
Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
2012Document Listing for Queries with Excluded Pattern.
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
2012Efficient Algorithm for Circular Burrows-Wheeler Transform.
Wing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan
2012Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees.
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu
2012Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation.
Christian Hundt, Florian Wendland
2012FEMTO: Fast Search of Large Sequence Collections.
Michael P. Ferguson
2012Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract).
Aïda Ouangraoua, Mathieu Raffinot
2012Finding Longest Common Segments in Protein Structures in Nearly Linear Time.
Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li
2012Fixed-Parameter Algorithms for Finding Agreement Supertrees.
David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati
2012Gene Regulation, Protein Networks and Disease: A Computational Perspective.
Ron Shamir
2012Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
2012Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots.
Saad Sheikh, Rolf Backofen, Yann Ponty
2012Least Random Suffix/Prefix Matches in Output-Sensitive Time.
Niko Välimäki
2012Local Exact Pattern Matching for Non-fixed RNA Structures.
Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will
2012Minimum Leaf Removal for Reconciliation: Complexity and Algorithms.
Riccardo Dondi, Nadia El-Mabrouk
2012Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2012On Approximating String Selection Problems with Outliers.
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2012On the Closest String via Rank Distance.
Liviu Petrisor Dinu, Alexandru Popa
2012Partitioning into Colorful Components by Minimum Edge Deletions.
Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
2012Pattern Matching in Multiple Streams.
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2012Simple and Efficient LZW-Compressed Multiple Pattern Matching.
Pawel Gawrychowski
2012Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012The Complexity of String Partitioning.
Anne Condon, Ján Manuch, Chris Thachuk
2012The Maximum Number of Squares in a Tree.
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012The Parameterized Complexity of the Shared Center Problem.
Zhi-Zhong Chen, Lusheng Wang, Wenji Ma
2012Time-Space Trade-Offs for Longest Common Extensions.
Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
2012Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval.
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan
2012Wavelet Trees for All.
Gonzalo Navarro