| Fast pattern-matching on indeterminate strings J Holub, WF Smyth, S Wang Journal of Discrete Algorithms 6 (1), 37-50, 2008 | 75 | 2008 |
| Tuning BNDM with q-Grams B Ďurian, J Holub, H Peltola, J Tarhio 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009 | 62 | 2009 |
| Improving practical exact string matching B Ďurian, J Holub, H Peltola, J Tarhio Information Processing Letters 110 (4), 148-152, 2010 | 51 | 2010 |
| On parallel implementations of deterministic finite automata J Holub, S Štekr International Conference on Implementation and Application of Automata, 54-64, 2009 | 45 | 2009 |
| Text searching algorithms B Melichar, J Holub, T Polcar Available on: http://stringology. org/athens, 2005 | 45 | 2005 |
| Algorithms on indeterminate strings J Holub, WF Smyth 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), 2003 | 41 | 2003 |
| Distributed pattern matching using finite automata J Holub, CS Iliopoulos, B Melichar, L Mouchard Journal of Automata, Languages and Combinatorics 6 (2), 191-204, 2001 | 41 | 2001 |
| Simulation of nondeterministic finite automata in pattern matching J Holub en, Publisher: Praha (Czech Republic): Ceske vysoke uceni technicke v Praze …, 2000 | 37 | 2000 |
| Implementation of nondeterministic finite automata for approximate pattern matching J Holub, B Melichar Automata Implementation: Third International Workshop on Implementing …, 1999 | 33 | 1999 |
| Fast variants of bit parallel approach to suffix automata J Holub, B Durian Unpublished Lecture, University of Haifa, 2005 | 31 | 2005 |
| Suffix tree of alignment: An efficient index for similar data JC Na, H Park, M Crochemore, J Holub, CS Iliopoulos, L Mouchard, ... Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen …, 2013 | 29 | 2013 |
| Computing quasi suffix arrays F Franěk, J Holub, WF Smyth, X Xiao Journal of Automata, Languages and Combinatorics 8 (4), 593-606, 2003 | 28 | 2003 |
| Finding common motifs with gaps using finite automata P Antoniou, J Holub, CS Iliopoulos, B Melichar, P Peterlongo Implementation and Application of Automata: 11th International Conference …, 2006 | 24 | 2006 |
| Approximate string matching using factor automata J Holub, B Melichar Theoretical Computer Science 249 (2), 305-311, 2000 | 24 | 2000 |
| 6D Classification of Pattern Matching Problems. B Melichar, J Holub Stringology, 24-32, 1997 | 23 | 1997 |
| DCA using suffix arrays M Fiala, J Holub 2008 Data Compression Conference, 516-516, 2008 | 22 | 2008 |
| On the Implementation of Compact DAWG’s J Holub, M Crochemore International Conference on Implementation and Application of Automata, 289-294, 2002 | 19 | 2002 |
| Reduced Nondeterministic Finite Automata for Approximate String Matching. J Holub Stringology, 19-27, 1996 | 17 | 1996 |
| Compressing similar biological sequences using fm-index P Procházka, J Holub 2014 Data Compression Conference, 312-321, 2014 | 13 | 2014 |
| Hybrid pattern-matching algorithms on indeterminate strings J Holub, WF Smyth, S Wang London Algorithmics and Stringology 2006, 115-133, 2007 | 13 | 2007 |
