Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th CPM 2015: Ischia Island, Italy
- Ferdinando Cicalese, Ely Porat, Ugo Vaccaro:
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science 9133, Springer 2015, ISBN 978-3-319-19928-3 - Amihood Amir, Benny Porat:
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling. 1-12 - Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. 13-25 - Djamal Belazzougui, Fabio Cunial, Travis Gagie
, Nicola Prezza, Mathieu Raffinot:
Composite Repetition-Aware Data Structures. 26-39 - Timo Beller, Enno Ohlebusch:
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. 40-51 - Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. 52-64 - Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. 65-76 - Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Ranked Document Retrieval with Forbidden Pattern. 77-88 - Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. 89-99 - Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria:
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem. 100-113 - Timothy M. Chan, Moshe Lewenstein:
Fast String Dictionary Lookup with One Error. 114-123 - Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
On the Readability of Overlap Digraphs. 124-137 - Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem. 138-148 - Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein:
Range Minimum Query Indexes in Higher Dimensions. 149-159 - Johannes Fischer, Pawel Gawrychowski:
Alphabet-Dependent String Searching with Wexponential Search Trees. 160-171 - Johannes Fischer, Tomohiro I, Dominik Köppl:
Lempel Ziv Computation in Small Space (LZ-CISS). 172-184 - Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Succinct Non-overlapping Indexing. 185-195 - Pawel Gawrychowski, Patrick K. Nicholson:
Encodings of Range Maximum-Sum Segment Queries and Applications. 196-206 - Simon Gog, Matthias Petri:
Compact Indexes for Flexible Top- k k Retrieval. 207-218 - Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. 219-230 - Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho:
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. 231-246 - Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang:
Dictionary Matching with Uneven Gaps. 247-260 - Gabriel Istrate, Cosmin Bonchis:
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. 261-271 - Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. 272-283 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. 284-294 - Dmitry Kosolobov:
Online Detection of Repetitions with Backtracking. 295-306 - Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev:
Greedy Conjecture for Strings of Length 4. 307-315 - Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter Bounds for the Sum of Irreducible LCP Values. 316-328 - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Parallel External Memory Suffix Sorting. 329-342 - Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya:
On Maximal Unbordered Factors. 343-354 - Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. 355-366 - Gonzalo Navarro, Sharma V. Thankachan:
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints. 367-373 - Cyril Nicaud:
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. 374-384 - Patrick K. Nicholson, Rajeev Raman:
Encoding Nearest Larger Values. 385-395 - Ron Zeira, Ron Shamir:
Sorting by Cuts, Joins and Whole Chromosome Duplications. 396-409
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-05-31 18:46 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:
