default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Holub 0001
Person information
- not to be confused with: Jan Holub 0002
- affiliation: Czech Technical University in Prague, Department of Theoretical Computer Science, Czech Republic
Other persons with the same name
- Jan Holub 0002
![[0000-0003-3350-534X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-3350-534X")
— Czech Technical University in Prague, Department of Measurement, Czech Republic
2020 – today
- 2024
[c30]Dominika Draesslerová, Omar Y. Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, Gonzalo Navarro:
Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests. SEA 2024: 10:1-10:13- [e24]Jan Holub, Jan Zdárek:
Prague Stringology Conference 2024, Prague, Czech Republic, August 26-27, 2024. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2024, ISBN 978-80-01-07328-5 [contents] - [i6]Dominika Draesslerová, Omar Y. Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, Gonzalo Navarro:
Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests. CoRR abs/2402.06935 (2024) - 2023
- [j26]Petr Procházka, Ondrej Cvacho, Lubos Krcál, Jan Holub:
Backward Pattern Matching on Elastic-Degenerate Strings. SN Comput. Sci. 4(5): 442 (2023) - [e23]Jan Holub, Jan Zdárek:
Prague Stringology Conference 2023, Prague, Czech Republic, August 28-29, 2023. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2023, ISBN 978-80-01-07206-6 [contents] - 2022
- [j25]Rayan Chikhi, Jan Holub, Paul Medvedev:
Data Structures to Represent a Set of k-long DNA Sequences. ACM Comput. Surv. 54(1): 17:1-17:22 (2022) - [c29]Lubos Krcál, Shen-Shyang Ho, Jan Holub:
Hierarchical Bitmap Indexing for Range Queries on Multidimensional Arrays. DASFAA (1) 2022: 509-525 - [e22]Hideo Bannai, Jan Holub:
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic. LIPIcs 223, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-234-1 [contents] - 2021
- [c28]Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Compressed Suffix Trees. ALENEX 2021: 60-72 - [c27]Petr Procházka, Ondrej Cvacho, Lubos Krcál, Jan Holub:
Backward Pattern Matching on Elastic Degenerate Strings. BIOINFORMATICS 2021: 50-59 - [e21]Jan Holub, Jan Zdárek:
Prague Stringology Conference 2021, Prague, Czech Republic, August 30-31, 2021. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2021, ISBN 978-80-01-06869-4 [contents] - [i5]Lubos Krcál, Shen-Shyang Ho, Jan Holub:
Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays. CoRR abs/2108.13735 (2021) - 2020
- [j24]Jan Holub:
Preface: Stringology Algorithms. Discret. Appl. Math. 274: 1 (2020) - [e20]Jan Holub, Jan Zdárek:
Prague Stringology Conference 2020, Prague, Czech Republic, August 31 - September 2, 2020. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2020, ISBN 978-80-01-06749-9 [contents] - [i4]Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Data Structures. CoRR abs/2006.11687 (2020)
2010 – 2019
- 2019
- [c26]Petr Procházka, Jan Holub:
On-line Searching in IUPAC Nucleotide Sequences. BIOINFORMATICS 2019: 66-77 - [e19]Jan Holub, Jan Zdárek:
Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2019, ISBN 978-80-01-06618-8 [contents] - [i3]Rayan Chikhi, Jan Holub, Paul Medvedev:
Data structures to represent sets of k-long DNA sequences. CoRR abs/1903.12312 (2019) - 2018
- [j23]Aleksander Cislak, Szymon Grabowski, Jan Holub:
SOPanG: online text searching over a pan-genome. Bioinform. 34(24): 4290-4292 (2018) - [j22]Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth:
Reconstructing a string from its Lyndon arrays. Theor. Comput. Sci. 710: 44-51 (2018) - [c25]Ondrej Cvacho, Jan Holub:
Filtering Invalid Off-Targets in CRISPR/Cas9 Design Tools. DCC 2018: 403 - [e18]Jan Holub, Jan Zdárek:
Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science 2018, ISBN 978-80-01-06484-9 [contents] - 2017
- [j21]Petr Procházka, Jan Holub:
Towards Efficient Positional Inverted Index. Algorithms 10(1): 30 (2017) - [j20]Jorma Tarhio, Jan Holub, Emanuele Giaquinta:
Technology beats algorithms (in exact string matching). Softw. Pract. Exp. 47(12): 1877-1885 (2017) - [c24]Petr Procházka, Jan Holub:
Byte-Aligned Pattern Matching in Encoded Genomic Sequences. WABI 2017: 20:1-20:13 - [e17]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2017, ISBN 978-80-01-06193-0 [contents] - 2016
- [j19]Jan Holub:
Editorial: Stringology Algorithms. Discret. Appl. Math. 212: 1 (2016) - [c23]Lukas Hrbek, Jan Holub:
Approximate String Matching for Self-Indexes. DCC 2016: 604 - [c22]Petr Procházka, Jan Holub:
Positional Inverted Self-index. DCC 2016: 627 - [e16]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2016, ISBN 978-80-01-05996-8 [contents] - [i2]Jorma Tarhio, Jan Holub, Emanuele Giaquinta:
Technology Beats Algorithms (in Exact String Matching). CoRR abs/1612.01506 (2016) - 2015
- [j18]Petr Procházka, Jan Holub:
Compression of a Set of Files with Natural Language Content. Comput. J. 58(5): 1169-1185 (2015) - [c21]Lubos Krcál, Jan Holub:
Incremental Locality and Clustering-Based Compression. DCC 2015: 203-212 - [e15]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2015, Prague, Czech Republic, August 24-26, 2015. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2015, ISBN 978-80-01-05787-2 [contents] - 2014
- [j17]Jan Holub:
Stringology algorithms. Discret. Appl. Math. 163: 237 (2014) - [c20]Petr Procházka, Jan Holub:
Compressing Similar Biological Sequences Using FM-Index. DCC 2014: 312-321 - [e14]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2014, ISBN 978-80-01-05547-2 [contents] - 2013
- [j16]Petr Procházka, Jan Holub:
ODC: Frame for definition of Dense codes. Eur. J. Comb. 34(1): 52-68 (2013) - [c19]Petr Procházka, Jan Holub:
Natural Language Compression Optimized for Large Set of Files. DCC 2013: 514 - [c18]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA 2013: 337-348 - [e13]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2013, ISBN 978-80-01-05330-0 [contents] - [i1]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. CoRR abs/1305.1744 (2013) - 2012
- [j15]Jan Holub:
Preface. Int. J. Found. Comput. Sci. 23(2) (2012) - [j14]Jan Holub:
The finite automata approaches in stringology. Kybernetika 48(3): 386-401 (2012) - [e12]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2012, Prague, Czech Republic, August 27-28, 2012. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2012, ISBN 978-80-01-05095-8 [contents] - 2011
- [c17]Petr Procházka, Jan Holub:
Natural Language Compression per Blocks. CCP 2011: 67-75 - [c16]Jan Holub, Jakub Reznicek, Filip Simek:
Lossless Data Compression Testbed: ExCom and Prague Corpus. DCC 2011: 457 - [c15]Petr Procházka, Jan Holub:
Block-Oriented Dense Compressor. DCC 2011: 472 - [e11]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2011, ISBN 978-80-01-04870-2 [contents] - 2010
- [j13]Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio:
Improving practical exact string matching. Inf. Process. Lett. 110(4): 148-152 (2010) - [c14]Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis:
An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM 2010: 133-136 - [e10]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2010, ISBN 978-80-01-04597-8 [contents]
2000 – 2009
- 2009
- [j12]Jan Holub:
Foreword. Int. J. Found. Comput. Sci. 20(6): 965-966 (2009) - [j11]Jan Holub:
Preface. Theor. Comput. Sci. 410(37): 3437 (2009) - [c13]Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio:
Tuning BNDM with q-Grams. ALENEX 2009: 29-37 - [c12]Petr Procházka, Jan Holub:
New Word-Based Adaptive Dense Compressors. IWOCA 2009: 420-431 - [c11]Jan Holub, Stanislav Stekr:
On Parallel Implementations of Deterministic Finite Automata. CIAA 2009: 54-64 - [e9]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague 2009, ISBN 978-80-01-04403-2 [contents] - 2008
- [j10]Jan Holub:
Foreword. Int. J. Found. Comput. Sci. 19(1): 1-3 (2008) - [j9]Jan Holub, William F. Smyth, Shu Wang:
Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6(1): 37-50 (2008) - [c10]Martin Fiala, Jan Holub:
DCA Using Suffix Arrays. DCC 2008: 516 - [e8]Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague 2008, ISBN 978-80-01-04145-1 [contents] - 2007
- [e7]Jan Holub, Jan Zdárek:
Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4783, Springer 2007, ISBN 978-3-540-76335-2 [contents] - 2006
- [j8]Jan Holub:
Foreword. Int. J. Found. Comput. Sci. 17(6): 1233-1234 (2006) - [c9]Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo:
Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77 - [e6]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, ISBN 80-01-03533-6 [contents] - 2005
- [j7]Jan Holub:
Foreword. Int. J. Found. Comput. Sci. 16(6): 1071-1073 (2005) - [j6]Jan Holub:
Editorial. J. Autom. Lang. Comb. 10(5/6): 575 (2005) - [e5]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, ISBN 80-01-03307-4 [contents] - 2004
- [e4]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, ISBN 80-01-03050-4 [contents] - 2003
- [j5]Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao:
Computing Quasi Suffix Arrays. J. Autom. Lang. Comb. 8(4): 593-606 (2003) - [j4]Jan Holub:
Guest Editor's Foreword. Nord. J. Comput. 10(1): 1 (2003) - 2002
- [j3]Jan Holub:
Dynamic programming for reduced NFAs for approximate string and sequence matching. Kybernetika 38(1): 81-90 (2002) - [c8]Jan Holub, Maxime Crochemore:
On the Implementation of Compact DAWG's. CIAA 2002: 289-294 - [c7]Jan Holub:
Dynamic Programming - NFA Simulation. CIAA 2002: 295-300 - 2001
- [j2]Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata. J. Autom. Lang. Comb. 6(2): 191-201 (2001) - [c6]Jan Holub:
Bit Parallelism - NFA Simulation. CIAA 2001: 149-160 - 2000
- [j1]Jan Holub, Borivoj Melichar:
Approximate string matching using factor automata. Theor. Comput. Sci. 249(2): 305-311 (2000)
1990 – 1999
- 1999
- [e3]Jan Holub, Milan Simánek:
Proceedings of the Prague Stringology Club Workshop 1999, Prague, Czech Republic, July 8-9, 1999. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 1999 [contents] - 1998
- [c5]Jan Holub:
Dynamic Programming for Reduced NFAs for Approximate String and Sequence Matching. Stringology 1998: 73-82 - [c4]Jan Holub, Borivoj Melichar:
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. Workshop on Implementing Automata 1998: 92-99 - [e2]Jan Holub, Milan Simánek:
Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, September 3-4, 1998. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 1998 [contents] - 1997
- [c3]Borivoj Melichar, Jan Holub:
6D Classification of Pattern Matching Problems. Stringology 1997: 24-32 - [c2]Jan Holub:
Simulation of NFA in Approximate String and Sequence Matching. Stringology 1997: 39-46 - [e1]Jan Holub:
Proceedings of the Prague Stringology Club Workshop 1997, Prague, Czech Republic, July 7, 1997. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 1997 [contents] - 1996
- [c1]Jan Holub:
Reduced Nondeterministic Finite Automata for Approximate String Matching. Stringology 1996: 19-27
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
