default search action
6th CPM 1995: Espoo/Helsinki, Finland
- Zvi Galil, Esko Ukkonen:
Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings. Lecture Notes in Computer Science 937, Springer 1995, ISBN 3-540-60044-2 - Vineet Bafna, S. Muthukrishnan, R. Ravi:
Computing Similarity between RNA Strings. 1-16 - Craig J. Benham, Sampath Kannan, Tandy J. Warnow:
Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility. 17-26 - Dany Breslauer, Leszek Gasieniec:
Efficient String Matching on Coded Texts. 27-40 - Archie L. Cobbs:
Fast Approximate Matching using Suffix Trees. 41-54 - Vlado Dancík:
Common Subsequences and Supersequences and Their expected Length. 55-63 - Jianghai Fu:
Pattern Matching in Directed Graphs. 64-77 - Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. 78-89 - Raffaele Giancarlo, Roberto Grossi:
Multi-Dimensional Pattern Matching with Dimensional Wildcards. 90-101 - Leslie Ann Goldberg, Paul W. Goldberg
, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow:
Minimizing Phylogenetic Number to find Good Evolutionary Trees. 102-127 - Sandeep K. Gupta, John D. Kececioglu, Alejandro A. Schäffer:
Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice (Extended Abstract). 128-143 - Liz Hanks, Ron Cytron, Will D. Gillett:
An Efficient Algorithm for Developing Topological Valid Matchings. 144-161 - Sridhar Hannenhalli:
Polynomial-time Algorithm for Computing Translocation Distance between Genomes. 162-176 - Jotun Hein, Tao Jiang
On the Complexity of Comparing Evolutionary Trees (Extended Abstract). 177-190 - Juha Kärkkäinen:
Suffix Cactus: A Cross between Suffix Tree and Suffix Array. 191-204 - Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
Pattern-Matching for Strings with Short Descriptions. 205-214 - Lukas Knecht:
Pairwise Alignment with Scoring on Tuples. 215-229 - Gregory Kucherov
Matching a Set of Strings with Variable Length Don't Cares. 230-247 - Arthur M. Lesk
Three-Dimensional Pattern Matching in Protein Structure Analysis. 248-260 - Hans-Werner Mewes
Genome Analysis: Pattern Search in Biological Macromolecules. 261-285 - Mehryar Mohri:
Matching Patterns of An Automaton. 286-297 - S. Muthukrishnan:
New Results and Open Problems Related to Non-Standard Stringology. 298-317 - Kunsoo Park, Dong Kyue Kim:
String Matching in Hypertext. 318-329 - R. Ravi, John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. 330-339 - Claus Rick:
A New Flexible Algorithm for the Longest Common Subsequence Problem. 340-351 - Emmanuel Roche:
Smaller Representations for Finite-State Transducers and Finite-State Automata. 352-365 - Marie-France Sagot, Alain Viari, Henry Soldano:
Multiple Sequence Comparison: A Peptide Matching Approach. 366-385 - Uzi Vishkin:
On a Technique for Parsing a String (Abstract). 386 - Andrew Chi-Chih Yao, F. Frances Yao:
Dictionary Loop-Up with Small Errors. 387-394 - Kaizhong Zhang, Jason Tsong-Li Wang, Dennis E. Shasha:
On the Editing Distance between Undirected Acyclic Graphs and Related Problems. 395-407
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-11-21 20:18 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: