- ORCID iD
-
0000-0001-8517-0479
Show
Sort by
-
- Journal Article
- A1
- open access
Run-length compressed metagenomic read classification with SMEM-finding and tagging
-
- Journal Article
- A1
- open access
Columba : fast approximate pattern matching with optimized search schemes
-
KeBaB : k-mer Based Breaking for Finding Long MEMs
(2025) STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2025. In Lecture Notes in Computer Science 16073. p.10-17 -
Advancing practical pan-genomics with compressed indexing
(2025) -
- Book Chapter
- open access
Search schemes for approximate pattern matching : an overview
-
- Journal Article
- A1
- open access
b-move : faster lossless approximate pattern matching in a run-length compressed index
-
- Journal Article
- A1
- open access
Lossless approximate pattern matching : automated design of efficient search schemes
-
- Conference Paper
- P1
- open access
B-move : faster bidirectional character extensions in a run-length compressed index
-
- Conference Paper
- P1
- open access
Faster maximal exact matches with lazy LCP evaluation
-
- Conference Paper
- P1
- open access
Automated design of efficient search schemes for lossless approximate pattern matching
(2024) RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, RECOMB 2024. In Lecture Notes in Computer Science 14758. p.164-184