default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th CPM 2006: Barcelona, Spain
- Moshe Lewenstein, Gabriel Valiente:
Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings. Lecture Notes in Computer Science 4009, Springer 2006, ISBN 3-540-35455-7 - Amihood Amir:
Asynchronous Pattern Matching. 1-10 - Eran Halperin:
SNP and Haplotype Analysis - Algorithms and Applications. 11-11 - Levon Lloyd, Andrew Mehler, Steven Skiena
:
Identifying Co-referential Names Across Large Corpora. 12-23
Data Structures
- Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. 24-35 - Johannes Fischer, Volker Heun:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. 36-48
Indexing Data Structures
- Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong:
A Linear Size Index for Approximate Pattern Matching. 49-59 - Shunsuke Inenaga, Masayuki Takeda:
On-Line Linear-Time Construction of Word Suffix Trees. 60-71 - Pang Ko, Srinivas Aluru:
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. 72-83 - Tetsuo Shibuya:
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures. 84-93
Probabilistic and Algebraic Techniques
- Brona Brejová, Daniel G. Brown, Ian M. Harrower, Tomás Vinar:
New Bounds for Motif Finding in Strong Instances. 94-105 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri:
Fingerprint Clustering with Bounded Number of Missing Values. 106-116 - Olivier Bodini, Eric Rivals:
Tiling an Interval of the Discrete Line. 117-128 - Eric Blais, Mathieu Blanchette:
Common Substrings in Random Strings. 129-140
Applications in Molecular Biology I
- Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter:
On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. 141-152 - Sven Rahmann:
Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms. 153-164 - Sylvain Guillemot, François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. 165-176 - Behshad Behzadi, Martin Vingron:
An Improved Algorithm for the Macro-evolutionary Phylogeny Problem. 177-187
String Matching I
- Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property Matching and Weighted Matching. 188-199 - Amihood Amir, Eran Chencinski:
Faster Two Dimensional Scaled Matching. 200-210
Applications in Molecular Biology II
- Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen:
Approximation of RNA Multiple Structural Alignment. 211-222 - Patricia A. Evans:
Finding Common RNA Pseudoknot Structures in Polynomial Time. 223-232 - Carl Kingsford, Elena Zaslavsky, Mona Singh:
A Compact Mathematical Programming Formulation for DNA Motif Finding. 233-245 - Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. 246-257
Applications in Molecular Biology III
- Michal Ozery-Flato, Ron Shamir:
An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations. 258-269 - Alexandre Tiskin:
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. 270-281
Data Compression
- Haim Kaplan, Shir Landau, Elad Verbin:
A Simpler Analysis of Burrows-Wheeler Based Compression. 282-293 - Rodrigo González, Gonzalo Navarro:
Statistical Encoding of Succinct Data Structures. 294-305 - Veli Mäkinen, Gonzalo Navarro:
Dynamic Entropy-Compressed Sequences and Full-Text Indexes. 306-317 - Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane:
Reducing the Space Requirement of LZ-Index. 318-329
String Matching II
- Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz:
Faster Algorithms for Computing Longest Common Increasing Subsequences. 330-341 - Roman Kolpakov, Mathieu Raffinot:
New Algorithms for Text Fingerprinting. 342-353 - Leena Salmela, Jorma Tarhio:
Sublinear Algorithms for Parameterized Matching. 354-364 - Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat:
Approximate Matching in Weighted Sequences. 365-376
Dynamic Programming
- Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. 377-388 - Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang:
Efficient Algorithms for Regular Expression Constrained Sequence Alignment. 389-400 - Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré:
Large Scale Matching for Position Weight Matrices. 401-412
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-12-02 21:15 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:
