default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th CPM 1997: Aarhus, Denmark
- Alberto Apostolico, Jotun Hein:
Combinatorial Pattern Matching, 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30 - July 2, 1997, Proceedings. Lecture Notes in Computer Science 1264, Springer 1997, ISBN 3-540-63220-4
Session 1
- Masamichi Miyazaki, Ayumi Shinohara
, Masayuki Takeda:
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. 1-11 - Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen:
Episode Matching. 12-27 - Jee-Soo Lee, Dong Kyue Kim, Kunsoo Park, Yookun Cho:
Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract). 28-39
Session 2
- Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. 40-51 - Stefan Kurtz, Gene Myers:
Estimating the Probability of Approximate Matches. 52-64 - Shmuel T. Klein:
Space- and Time-Efficient Decoding with Canonical Huffman Trees. 65-75 - Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson:
On Weak Circular Squares in Binary Words. 76-82
Session 3
- Nicholas Q. Trân:
An Easy Case of Sorting by Reversals. 83-89 - Leszek Gasieniec, Piotr Indyk, Piotr Krysta:
External Inverse Pattern Matching. 90-101 - Gonzalo Navarro, Joao Paulo Kitajima, Berthier A. Ribeiro-Neto, Nivio Ziviani:
Distributed Generation of Suffix Arrays. 102-115 - Maxime Crochemore, Renaud Vérin:
Direct Construction of Compact Directed Acyclic Word Graphs. 116-129 - Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips:
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. 130-149
Session 4
- Thorsten Richter:
A New Algorithm for the Ordered Tree Inclusion Problem. 150-166 - Saïd Abdeddaïm:
On Incremental Computation of Transitive Closure and Greedy Alignment. 167-179 - Lars Arvestad:
Aligning Coding DNA in the Presence of Frame-Shift Errors. 180-190 - Enno Ohlebusch:
A Filter Method for the Weighted Local Similarity Search Problem. 191-205 - Ting Chen, Steven Skiena:
Trie-Based Data Structures for Sequence Assembly. 206-223
Session 5
- Marie-France Sagot, Alain Viari:
Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helices. 224-246 - Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi:
Banishing Bias from Consensus Sequences. 247-261 - David Sankoff, Marie-Noelle Parent, Isabelle Marchand, Vincent Ferretti:
On the Nadeau-Taylor Theory of Conserved Chromosome Segments. 262-274
Invited Lectures
- Andreas W. M. Dress:
Iterative versus simultaneous Multiple Sequence Alignment (Abstract). 275 - Joseph B. Kruskal:
Modern Comparative Lexicostatistics. 276
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-01-10 18:40 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:
