• 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 8 matches

• 2014
• 
  Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu:
  Efficient exponential-time algorithms for edit distance between unordered trees. J. Discrete Algorithms 25: 79-93 (2014)
• 
  Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
  Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25: 42-50 (2014)
• 
  Riccardo Dondi, Nadia El-Mabrouk, Krister M. Swenson:
  Gene tree correction for reconciliation and species tree inference: Complexity and algorithms. J. Discrete Algorithms 25: 51-65 (2014)
• 
  Pawel Gawrychowski:
  Simple and efficient LZW-compressed multiple pattern matching. J. Discrete Algorithms 25: 34-41 (2014)
• 
  Jesper Jansson, Andrzej Lingas:
  Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25: 66-78 (2014)
• 
  Gonzalo Navarro:
  Wavelet trees for all. J. Discrete Algorithms 25: 2-20 (2014)
• 
  Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
  Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25: 21-33 (2014)
• 
  Jens Stoye, Juha Kärkkäinen:
  Editorial. J. Discrete Algorithms 25: 1 (2014)