Fast pattern-matching on indeterminate strings J Holub, WF Smyth, S Wang Journal of Discrete Algorithms 6 (1), 37-50, 2008 | 57 | 2008 |

Tuning BNDM with *q*-GramsB Ďurian, J Holub, H Peltola, J Tarhio 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009 | 49 | 2009 |

Text searching algorithms B Melichar, J Holub, T Polcar Available on: http://stringology. org/athens, 2005 | 41 | 2005 |

Improving practical exact string matching B Ďurian, J Holub, H Peltola, J Tarhio Information Processing Letters 110 (4), 148-152, 2010 | 37 | 2010 |

Simulation of nondeterministic finite automata in pattern matching J Holub Ph. D. Thesis, Czech Technical University in Prague, 2000 | 35 | 2000 |

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 | 34 | 2001 |

Algorithms on indeterminate strings J Holub, WF Smyth | 32 | 2003 |

Implementation of nondeterministic finite automata for approximate pattern matching J Holub, B Melichar International Workshop on Implementing Automata, 92-99, 1998 | 30 | 1998 |

On parallel implementations of deterministic finite automata J Holub, S Štekr International Conference on Implementation and Application of Automata, 54-64, 2009 | 26 | 2009 |

Approximate string matching using factor automata J Holub, B Melichar Theoretical Computer Science 249 (2), 305-311, 2000 | 24 | 2000 |

Suffix tree of alignment: An efficient index for similar data JC Na, H Park, M Crochemore, J Holub, CS Iliopoulos, L Mouchard, ... International Workshop on Combinatorial Algorithms, 337-348, 2013 | 22 | 2013 |

DCA using suffix arrays M Fiala, J Holub Data Compression Conference (DCC 2008), 516-516, 2008 | 22 | 2008 |

Finding common motifs with gaps using finite automata P Antoniou, J Holub, CS Iliopoulos, B Melichar, P Peterlongo International Conference on Implementation and Application of Automata, 69-77, 2006 | 21 | 2006 |

Computing quasi suffix arrays F Franěk, J Holub, WF Smyth, X Xiao Journal of Automata, Languages and Combinatorics 8 (4), 593-606, 2003 | 21 | 2003 |

Fast variants of bit parallel approach to suffix automata J Holub, B Durian Unpublished Lecture, University of Haifa, 2005 | 19 | 2005 |

On the Implementation of Compact DAWG’s J Holub, M Crochemore International Conference on Implementation and Application of Automata, 289-294, 2002 | 18 | 2002 |

6D Classification of Pattern Matching Problems. B Melichar, J Holub Stringology, 24-32, 1997 | 18 | 1997 |

Reduced Nondeterministic Finite Automata for Approximate String Matching. J Holub Stringology, 19-27, 1996 | 17 | 1996 |

Simulation of NFA in Approximate String and Sequence Matching. J Holub Stringology, 39-46, 1997 | 11 | 1997 |

A different proof of Crochemore-Ilie lemma concerning microruns F Franek, J Holub London Algorithmics, 1-9, 2008 | 9 | 2008 |