Your search returned the following 6 documents:

6. A really Simple Approximation of Smallest Grammar
   Artur Jez
   In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Moscow, Russia, 2014, 182-191
   
5. Computing Minimal and Maximal Suffixes of a Substring Revisited
   Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, and Tatiana A. Starikovskaya
   In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, Moscow, Russia, 2014, 30-39
   
4. Order-Preserving Pattern Matching with k Mismatches
   Pawel Gawrychowski and Przemyslaw Uznanski
   In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, Moscow, Russia, 2014, 130-139
   
3. A Combinatorial Approach to Protein Docking with Flexible Side-Chains
   Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, and Peter Müller
   In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, April 8-11, 2000, 2000, 15-24
   
2. A polyhedral approach to RNA sequence structure alignment
   Hans-Peter Lenhof, Knut Reinert, and Martin Vingron
   In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), New York, USA, March 22-25, 1998, 153-162
   
1. q-gram Based Database Searching Using a Suffix Array (QUASAR)
   Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, and Martin Vingron
   In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), Lyon, France, April 11-14, 1999, 77-83