default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th CPM 2005: Jeju Island, Korea
- Alberto Apostolico, Maxime Crochemore, Kunsoo Park:
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Lecture Notes in Computer Science 3537, Springer 2005, ISBN 3-540-26201-6 - Brona Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar:
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. 1-10 - Bin Ma, Kaizhong Zhang:
On the Longest Common Rigid Subsequence Problem. 11-20 - Moritz G. Maaß, Johannes Nowak:
Text Indexing with Errors. 21-32 - Dong Kyue Kim, Heejin Park:
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. 33-44 - Veli Mäkinen, Gonzalo Navarro:
Succinct Suffix Arrays Based on Run-Length Encoding. 45-56 - Joong Chae Na:
Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. 57-67 - Peter Clifford, Raphaël Clifford
, Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems. 68-78 - Zheng Liu, Xin Chen, James Borneman, Tao Jiang:
A Fast Algorithm for Approximate String Matching on Gene Sequences. 79-90 - Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski:
Approximate Matching in the L1 Metric. 91-103 - Luís M. S. Russo, Arlindo L. Oliveira:
An Efficient Algorithm for Generating Super Condensed Neighborhoods. 104-115 - Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp:
The Median Problem for the Reversal Distance in Circular Bacterial Genomes. 116-127 - Gad M. Landau, Laxmi Parida, Oren Weimann:
Using PQ Trees for Comparative Genomics. 128-143 - François Nicolas, Eric Rivals:
Hardness of Optimal Spaced Seed Design. 144-155 - Meng Zhang, Liang Hu, Qiang Li, Jiubin Ju:
Weighted Directed Word Graph. 156-167 - Shiri Dori, Gad M. Landau:
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets. 168-177 - Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. 178-189 - Behshad Behzadi, Fabrice Le Fessant:
DNA Compression Challenge Revisited: A Dynamic Programming Approach. 190-200 - Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly. 201-218 - Paul Horton, Wataru Fujibuchi:
An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. 219-228 - Nadia Pisanti, Henry Soldano, Mathilde Carpentier:
Incremental Inference of Relational Motifs with a Degenerate Alphabet. 229-240 - Daniel Fredouille, Christopher H. Bryant:
Speeding up Parsing of Biological Context-Free Grammars. 241-256 - Kangmin Fan, William F. Smyth, R. J. Simpson:
A New Periodicity Lemma. 257-265 - Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two Dimensional Parameterized Matching. 266-279 - Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu:
An Optimal Algorithm for Online Square Detection. 280-287 - Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A Simple Fast Hybrid Pattern-Matching Algorithm. 288-297 - Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-Free Regular-Expression Matching. 298-309 - Lucian Ilie, Roberto Solis-Oba, Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders. 310-321 - Abdullah N. Arslan:
Regular Expression Constrained Sequence Alignment. 322-333 - Hélène Touzet:
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. 334-345 - Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. 346-357 - Valentina Boeva, Julien Clément, Mireille Régnier, Mathias Vandenbogaert:
Assessing the Significance of Sets of Words. 358-370 - Tatsuya Akutsu, Daiji Fukagawa:
Inferring a Graph from Path Frequency. 371-382 - Ion I. Mandoiu, Dragos Trinca:
Exact and Approximation Algorithms for DNA Tag Set Design. 383-393 - David Fernández-Baca, Balaji Venkatachalam:
Parametric Analysis for Ungapped Markov Models of Evolution. 394-405 - Jijun Tang, Bernard M. E. Moret:
Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. 406-416 - Mary Ellen Bock, Guido Maria Cortelazzo, Carlo Ferrari, Concettina Guerra:
Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation. 417-428 - Sebastian Böcker, Hans-Michael Kaltenbach:
Mass Spectra Alignments and Their Significance. 429-441
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-05-06 21:40 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:
