• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

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