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