default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st CPM 2010: New York, NY, USA
- Amihood Amir, Laxmi Parida:
Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6129, Springer 2010, ISBN 978-3-642-13508-8 - Kaizhong Zhang, Yunkun Zhu:
Algorithms for Forest Pattern Matching. 1-12 - Christian Hundt:
Affine Image Matching Is Uniform TC0-Complete. 13-25 - Zvi Galil:
Old and New in Stringology. 26 - Shoshana Neuburger, Dina Sokol
:
Small-Space 2D Compressed Dictionary Matching. 27-39 - Thomas Schnattinger, Enno Ohlebusch, Simon Gog:
Bidirectional Search in a String with Wavelet Trees. 40-50 - Zhi Xu:
A Minimal Periods Algorithm with Applications. 51-62 - Tsvi Kopelowitz:
The Property Suffix Tree with Dynamic Properties. 63-75 - Niko Välimäki, Susana Ladra, Veli Mäkinen:
Approximate All-Pairs Suffix/Prefix Overlaps. 76-87 - Djamal Belazzougui:
Succinct Dictionary Matching with No Slowdown. 88-100 - Raphaël Clifford, Benjamin Sach:
Pseudo-realtime Pattern Matching: Closing the Gap. 101-111 - Haitao Jiang, Cédric Chauve, Binhai Zhu:
Breakpoint Distance and PQ-Trees. 112-124 - Minghui Jiang:
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs. 125-137 - Guy E. Blelloch, Arash Farzan:
Succinct Representations of Separable Graphs. 138-150 - Richard M. Karp:
Implicit Hitting Set Problems and Multi-genome Alignment. 151 - Yufeng Wu:
Bounds on the Minimum Mosaic of Population Sequences under Recombination. 152-163 - Michal Nánási, Tomás Vinar, Brona Brejová:
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection. 164-176 - Michael Elberfeld, Till Tantau:
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. 177-189 - Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. 190-201 - Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot:
Mod/Resc Parsimony Inference. 202-213 - Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu:
Extended Islands of Tractability for Parsimony Haplotyping. 214-226 - Jouni Sirén:
Sampled Longest Common Prefix Array. 227-237 - Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying a Parameterized Border Array in O(n1.5) Time. 238-250 - Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler:
Cover Array String Reconstruction. 251-259 - Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter:
Compression, Indexing, and Retrieval for Massive String Data. 260-274 - Omar AitMous, Frédérique Bassino, Cyril Nicaud:
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. 275-287 - Domenico Cantone, Simone Faro, Emanuele Giaquinta:
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. 288-298 - Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Algorithms for Three Versions of the Shortest Common Superstring Problem. 299-309 - Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding Optimal Alignment and Consensus of Circular Strings. 310-322 - Pablo Montes, Heraldo Memelli, Charles B. Ward, Joondong Kim, Joseph S. B. Mitchell, Steven Skiena:
Optimizing Restriction Site Placement for Synthetic Genomes. 323-337 - Hidetoshi Yokoo:
Extension and Faster Implementation of the GRP Transform for Lossless Compression. 338-347 - Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Parallel and Distributed Compressed Indexes. 348-360
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-12-09 23: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:
