Jan Holub

Orcid: 0000-0003-3022-2694

Affiliations:
  • Czech Technical University in Prague, Department of Theoretical Computer Science, Czech Republic


According to our database1, Jan Holub authored at least 53 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests.
CoRR, 2024

2023
Backward Pattern Matching on Elastic-Degenerate Strings.
SN Comput. Sci., September, 2023

2022
Data Structures to Represent a Set of <i>k</i>-long DNA Sequences.
ACM Comput. Surv., 2022

Hierarchical Bitmap Indexing for Range Queries on Multidimensional Arrays.
Proceedings of the Database Systems for Advanced Applications, 2022

2021
Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays.
CoRR, 2021

PFP Compressed Suffix Trees.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
Preface: Stringology Algorithms.
Discret. Appl. Math., 2020

PFP Data Structures.
CoRR, 2020

2019
Data structures to represent sets of k-long DNA sequences.
CoRR, 2019

On-line Searching in IUPAC Nucleotide Sequences.
Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2019), 2019

2018
Reconstructing a string from its Lyndon arrays.
Theor. Comput. Sci., 2018

SOPanG: online text searching over a pan-genome.
Bioinform., 2018

Filtering Invalid Off-Targets in CRISPR/Cas9 Design Tools.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Technology beats algorithms (in exact string matching).
Softw. Pract. Exp., 2017

Towards Efficient Positional Inverted Index.
Algorithms, 2017

Byte-Aligned Pattern Matching in Encoded Genomic Sequences.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016
Editorial: Stringology Algorithms.
Discret. Appl. Math., 2016

Positional Inverted Self-index.
Proceedings of the 2016 Data Compression Conference, 2016

Approximate String Matching for Self-Indexes.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Compression of a Set of Files with Natural Language Content.
Comput. J., 2015

Incremental Locality and Clustering-Based Compression.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Stringology algorithms.
Discret. Appl. Math., 2014

Compressing Similar Biological Sequences Using FM-Index.
Proceedings of the Data Compression Conference, 2014

2013
ODC: Frame for definition of Dense codes.
Eur. J. Comb., 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Natural Language Compression Optimized for Large Set of Files.
Proceedings of the 2013 Data Compression Conference, 2013

2012
The finite automata approaches in stringology.
Kybernetika, 2012

2011
Block-Oriented Dense Compressor.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Lossless Data Compression Testbed: ExCom and Prague Corpus.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Natural Language Compression per Blocks.
Proceedings of the First International Conference on Data Compression, 2011

2010
Improving practical exact string matching.
Inf. Process. Lett., 2010

An algorithm for mapping short reads to a dynamically changing genomic sequence.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009
Preface.
Theor. Comput. Sci., 2009

On Parallel Implementations of Deterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2009

New Word-Based Adaptive Dense Compressors.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Tuning BNDM with q-Grams.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Fast pattern-matching on indeterminate strings.
J. Discrete Algorithms, 2008

DCA Using Suffix Arrays.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

2006
Finding Common Motifs with Gaps Using Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

2005
Editorial.
J. Autom. Lang. Comb., 2005

Foreword.
Int. J. Found. Comput. Sci., 2005

2003
Guest Editor's Foreword.
Nord. J. Comput., 2003

Computing Quasi Suffix Arrays.
J. Autom. Lang. Comb., 2003

2002
Dynamic programming for reduced NFAs for approximate string and sequence matching.
Kybernetika, 2002

On the Implementation of Compact DAWG's.
Proceedings of the Implementation and Application of Automata, 2002

Dynamic Programming - NFA Simulation.
Proceedings of the Implementation and Application of Automata, 2002

2001
Distributed Pattern Matching Using Finite Automata.
J. Autom. Lang. Comb., 2001

Bit Parallelism - NFA Simulation.
Proceedings of the Implementation and Application of Automata, 2001

2000
Approximate string matching using factor automata.
Theor. Comput. Sci., 2000

1998
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.
Proceedings of the Automata Implementation, 1998

1997
6D Classification of Pattern Matching Problems.
Proceedings of the Prague Stringology Club Workshop 1997, 1997

Simulation of NFA in Approximate String and Sequence Matching.
Proceedings of the Prague Stringology Club Workshop 1997, 1997

1996
Reduced Nondeterministic Finite Automata for Approximate String Matching.
Proceedings of the Prague Stringology Club Workshop 1996, 1996


  Loading...