2009 |
20 | EE | Branislav Durian,
Jan Holub,
Hannu Peltola,
Jorma Tarhio:
Tuning BNDM with q-Grams.
ALENEX 2009: 29-37 |
2008 |
19 | EE | Martin Fiala,
Jan Holub:
DCA Using Suffix Arrays.
DCC 2008: 516 |
18 | EE | Jan Holub:
Foreword.
Int. J. Found. Comput. Sci. 19(1): 1-3 (2008) |
17 | EE | Jan Holub,
William F. Smyth,
Shu Wang:
Fast pattern-matching on indeterminate strings.
J. Discrete Algorithms 6(1): 37-50 (2008) |
2007 |
16 | | Jan Holub,
Jan Zdárek:
Implementation and Application of Automata, 12th International Conference, CIAA 2007, Praque, Czech Republic, July 16-18, 2007, Revised Selected Papers
Springer 2007 |
2006 |
15 | | Jan Holub,
Jan Zdárek:
Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2006 |
14 | EE | Pavlos Antoniou,
Jan Holub,
Costas S. Iliopoulos,
Borivoj Melichar,
Pierre Peterlongo:
Finding Common Motifs with Gaps Using Finite Automata.
CIAA 2006: 69-77 |
13 | EE | Jan Holub:
Foreword.
Int. J. Found. Comput. Sci. 17(6): 1233-1234 (2006) |
2005 |
12 | | Jan Holub,
Milan Simánek:
Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 29-31, 2005
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2005 |
11 | EE | Jan Holub:
Foreword.
Int. J. Found. Comput. Sci. 16(6): 1071-1073 (2005) |
2004 |
10 | | Milan Simánek,
Jan Holub:
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30 - September 1, 2004
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2004 |
2003 |
9 | | Frantisek Franek,
Jan Holub,
William F. Smyth,
Xiangdong Xiao:
Computing Quasi Suffix Arrays.
Journal of Automata, Languages and Combinatorics 8(4): 593-606 (2003) |
8 | | Jan Holub:
Guest Editor's Foreword.
Nord. J. Comput. 10(1): 1 (2003) |
2002 |
7 | EE | Jan Holub,
Maxime Crochemore:
On the Implementation of Compact DAWG's.
CIAA 2002: 289-294 |
6 | EE | Jan Holub:
Dynamic Programming - NFA Simulation.
CIAA 2002: 295-300 |
2001 |
5 | EE | Jan Holub:
Bit Parallelism - NFA Simulation.
CIAA 2001: 149-160 |
4 | | Jan Holub,
Costas S. Iliopoulos,
Borivoj Melichar,
Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata.
Journal of Automata, Languages and Combinatorics 6(2): 191-204 (2001) |
2000 |
3 | EE | Jan Holub,
Borivoj Melichar:
Approximate string matching using factor automata.
Theor. Comput. Sci. 249(2): 305-311 (2000) |
1998 |
2 | EE | Jan Holub,
Borivoj Melichar:
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.
Workshop on Implementing Automata 1998: 92-99 |
1996 |
1 | EE | Jan Holub:
Reduced Nondeterministic Finite Automata for Approximate String Matching.
Stringology 1996: 19-27 |