| Publication | Date of Publication | Type |
|---|
| Minimizers in semi-dynamic strings | 2026-02-26 | Paper |
Elastic-degenerate string matching with 1 error or mismatch
Theory of Computing Systems | 2024-11-12 | Paper |
| Comparing elastic-degenerate strings: algorithms, lower bounds, and applications | 2024-10-21 | Paper |
| Suffix-prefix queries on a dictionary | 2024-10-21 | Paper |
| Sparse suffix and LCP array: simple, direct, small, and fast | 2024-05-31 | Paper |
Pattern masking for dictionary matching: theory and practice
Algorithmica | 2024-05-30 | Paper |
| Frequency-constrained substring complexity | 2024-05-29 | Paper |
| On strings having the same length-\(k\) substrings | 2024-05-06 | Paper |
| Longest palindromic substring in sublinear time | 2024-05-06 | Paper |
| Making de Bruijn graphs Eulerian | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
| Range shortest unique substring queries | 2024-04-19 | Paper |
Pattern masking for dictionary matching
(available as arXiv preprint) | 2024-01-15 | Paper |
Maximal degenerate palindromes with gaps and mismatches
Theoretical Computer Science | 2023-10-12 | Paper |
scientific article; zbMATH DE number 7740885 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
| Bidirectional String Anchors: A New String Sampling Mechanism | 2023-09-20 | Paper |
Subsequence covers of words
String Processing and Information Retrieval | 2023-08-04 | Paper |
Maximal motif discovery in a sliding window
String Processing and Information Retrieval | 2023-07-28 | Paper |
On extended special factors of a word
String Processing and Information Retrieval | 2023-07-28 | Paper |
Efficient computation of sequence mappability
String Processing and Information Retrieval | 2023-07-28 | Paper |
Longest common prefixes with \(k\)-errors and applications
String Processing and Information Retrieval | 2023-07-28 | Paper |
Longest property-preserved common factor
String Processing and Information Retrieval | 2023-07-28 | Paper |
Elastic-degenerate string matching with 1 error
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
scientific article; zbMATH DE number 7696005 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
| scientific article; zbMATH DE number 7695992 (Why is no real title available?) | 2023-06-14 | Paper |
| scientific article; zbMATH DE number 7695995 (Why is no real title available?) | 2023-06-14 | Paper |
Property Suffix Array with Applications in Indexing Weighted Sequences
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7651098 (Why is no real title available?) | 2023-02-07 | Paper |
Reverse-safe text indexing
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
All-pairs suffix/prefix in optimal time using Aho-Corasick space
Information Processing Letters | 2022-09-02 | Paper |
Longest unbordered factor in quasilinear time
(available as arXiv preprint) | 2022-07-21 | Paper |
| Even faster elastic-degenerate string matching via fast matrix multiplication | 2022-07-21 | Paper |
| Degenerate string comparison and applications | 2022-07-18 | Paper |
Internal shortest absent word queries in constant time and linear space
Theoretical Computer Science | 2022-06-13 | Paper |
Elastic-Degenerate String Matching via Fast Matrix Multiplication
SIAM Journal on Computing | 2022-06-08 | Paper |
| Beyond the BEST theorem: fast assessment of Eulerian trails | 2022-05-20 | Paper |
Longest common substring made fully dynamic
(available as arXiv preprint) | 2022-05-11 | Paper |
Efficient computation of sequence mappability
Algorithmica | 2022-05-03 | Paper |
Constructing antidictionaries of long texts in output-sensitive space
Theory of Computing Systems | 2021-08-05 | Paper |
Efficient pattern matching in elastic-degenerate strings
Information and Computation | 2021-07-21 | Paper |
Comparing Degenerate Strings
Fundamenta Informaticae | 2021-05-20 | Paper |
Efficient identification of \(k\)-closed strings
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Longest common factor after one edit operation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Pattern matching on elastic-degenerate text with errors
String Processing and Information Retrieval | 2021-02-16 | Paper |
Reverse-safe data structures for text indexing
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Influence maximization in the presence of vulnerable nodes: a ratio perspective
Theoretical Computer Science | 2021-01-25 | Paper |
| scientific article; zbMATH DE number 7286689 (Why is no real title available?) | 2020-12-16 | Paper |
Linear-time algorithm for long LCF with \(k\) mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Dynamic and internal longest common substring
Algorithmica | 2020-11-11 | Paper |
Circular pattern matching with \(k\) mismatches
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Longest common prefixes with \(k\)-mismatches and applications
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Searching and indexing circular patterns
Algorithms for Next-Generation Sequencing Data | 2020-08-07 | Paper |
Optimal computation of overabundant words
(available as arXiv preprint) | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7205098 (Why is no real title available?) | 2020-05-27 | Paper |
| On-line pattern matching on similar texts | 2020-05-25 | Paper |
Approximate pattern matching on elastic-degenerate text
Theoretical Computer Science | 2020-02-20 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
| Property suffix array with applications | 2020-02-12 | Paper |
Circular pattern matching with \(k\) mismatches
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Indexing weighted sequences: neat and efficient
Information and Computation | 2020-01-17 | Paper |
Indexing weighted sequences: neat and efficient
Information and Computation | 2020-01-17 | Paper |
Absent words in a sliding window with applications
Information and Computation | 2020-01-17 | Paper |
Creating improvisations on chord progressions using suffix trees
Journal of Mathematics and Music | 2020-01-07 | Paper |
On overabundant words and their application to biological sequence analysis
Theoretical Computer Science | 2019-10-07 | Paper |
Pattern matching and consensus problems on weighted sequences and profiles
Theory of Computing Systems | 2019-06-27 | Paper |
Fast Average-Case Pattern Matching on Weighted Sequences
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
On-line weighted pattern matching
Information and Computation | 2019-05-02 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
(available as arXiv preprint) | 2018-10-17 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
How to answer a small batch of RMQs or LCA queries in practice
(available as arXiv preprint) | 2018-06-15 | Paper |
Pattern matching and consensus problems on weighted sequences and profiles
(available as arXiv preprint) | 2018-04-19 | Paper |
Crochemore's partitioning on weighted strings and applications
Algorithmica | 2018-04-06 | Paper |
Faster algorithms for 1-mappability of a sequence
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Optimal computation of avoided words
(available as arXiv preprint) | 2018-03-23 | Paper |
Efficient algorithms for shortest partial seeds in words
Theoretical Computer Science | 2018-02-16 | Paper |
| Minimal absent words in a sliding window and applications to on-line pattern matching | 2017-11-22 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
scientific article; zbMATH DE number 6792413 (Why is no real title available?)
(available as arXiv preprint) | 2017-10-17 | Paper |
Circular sequence comparison with \(q\)-grams
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Efficient pattern matching in elastic-degenerate texts
Lecture Notes in Computer Science | 2017-06-01 | Paper |
Fast circular dictionary-matching algorithm
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Linear-time computation of prefix table for weighted strings {\&} applications
Theoretical Computer Science | 2017-02-06 | Paper |
On-Line Pattern Matching on Uncertain Sequences and Applications
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
An optimal algorithm for computing all subtree repeats in trees
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Average-case optimal approximate circular string matching
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Linear-time superbubble identification algorithm for genome assembly
Theoretical Computer Science | 2015-12-08 | Paper |
Linear-time computation of prefix table for weighted strings
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Accurate and efficient methods to improve multiple circular sequence alignment
Experimental Algorithms | 2015-09-30 | Paper |
Fast and simple computations using prefix tables under Hamming and edit distance
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Fast algorithm for partial covers in words
Algorithmica | 2015-09-03 | Paper |
Global and local sequence alignment with a bounded number of gaps
Theoretical Computer Science | 2015-04-29 | Paper |
Tree template matching in unranked ordered trees
Journal of Discrete Algorithms | 2014-08-13 | Paper |
| Verifying an enhanced cover array in linear time | 2014-07-10 | Paper |
Efficient Algorithms for Shortest Partial Seeds in Words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Extending alignments with \(k\)-mismatches and \(\ell\)-gaps
Theoretical Computer Science | 2014-03-13 | Paper |
An optimal algorithm for computing all subtree repeats in trees
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Enhanced string covering
Theoretical Computer Science | 2014-01-16 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
Tree template matching in ranked ordered trees by pushdown automata
Journal of Discrete Algorithms | 2013-06-24 | Paper |
On left and right seeds of a string
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Fast Algorithm for Partial Covers in Words
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Computing all subtree repeats in ordered trees
Information Processing Letters | 2013-03-21 | Paper |
Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
An algorithm for mapping short reads to a dynamically changing genomic sequence
Journal of Discrete Algorithms | 2012-05-11 | Paper |
On the right-seed array of a string
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Tree template matching in ranked ordered trees by pushdown automata
Implementation and Application of Automata | 2011-07-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Cover array string reconstruction
Combinatorial Pattern Matching | 2010-07-26 | Paper |
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
Algorithms and Applications | 2010-05-04 | Paper |
