| Publication | Date of Publication | Type |
|---|
Linear time construction of cover suffix tree and applications
| 2025-01-06 | Paper |
Internal pattern matching queries in a text and applications
SIAM Journal on Computing | 2024-10-21 | Paper |
Comparing elastic-degenerate strings: algorithms, lower bounds, and applications
| 2024-10-21 | Paper |
Linear-time computation of cyclic roots and cyclic covers of a string
| 2024-10-21 | Paper |
A note on the maximum number of \(k\)-powers in a finite word
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
Pattern masking for dictionary matching: theory and practice
Algorithmica | 2024-05-30 | Paper |
Longest palindromic substring in sublinear time
| 2024-05-06 | Paper |
Linear-time computation of shortest covers of all rotations of a string
| 2024-05-06 | Paper |
Rectangular tile covers of 2D-strings
| 2024-05-06 | Paper |
Weighted shortest common supersequence problem revisited
| 2024-04-19 | Paper |
Pattern masking for dictionary matching
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7740885 (Why is no real title available?)
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7740932 (Why is no real title available?)
| 2023-09-20 | Paper |
Subsequence covers of words
String Processing and Information Retrieval | 2023-08-04 | Paper |
Faster recovery of approximate periods over edit distance
String Processing and Information Retrieval | 2023-07-28 | Paper |
Efficient computation of sequence mappability
String Processing and Information Retrieval | 2023-07-28 | Paper |
scientific article; zbMATH DE number 7695998 (Why is no real title available?)
| 2023-06-14 | Paper |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651099 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651109 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651171 (Why is no real title available?)
| 2023-02-07 | Paper |
Efficient Computation of 2-Covers of a String.
| 2023-02-07 | Paper |
Approximating Longest Common Substring with k mismatches: Theory and Practice
| 2023-02-07 | Paper |
Internal dictionary matching
| 2023-02-03 | Paper |
Efficient Enumeration of Distinct Factors Using Package Representations
1511.68098 | 2022-12-22 | Paper |
Internal Quasiperiod Queries
1511.681 | 2022-12-22 | Paper |
Quasi-Periodicity in Streams
| 2022-07-18 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
| 2022-07-18 | Paper |
String covers of a tree
| 2022-06-15 | Paper |
Efficient representation and counting of antipower factors in words
Information and Computation | 2022-06-13 | Paper |
A note on the maximum number of $k$-powers in a finite word
| 2022-05-20 | Paper |
Longest common substring made fully dynamic
| 2022-05-11 | Paper |
Efficient computation of sequence mappability
Algorithmica | 2022-05-03 | Paper |
\(k\)-approximate quasiperiodicity under Hamming and edit distance
Algorithmica | 2022-03-22 | Paper |
A periodicity lemma for partial words
Information and Computation | 2022-03-14 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
A linear-time algorithm for seeds computation
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Shortest covers of all cyclic shifts of a string
Theoretical Computer Science | 2021-04-14 | Paper |
Longest common factor after one edit operation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Experimental evaluation of algorithms for computing quasiperiods
Theoretical Computer Science | 2021-01-25 | Paper |
Optimal skeleton and reduced Huffman trees
Theoretical Computer Science | 2021-01-25 | Paper |
Linear-time algorithm for long LCF with \(k\) mismatches
| 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 |
String Periods in the Order-Preserving Model
| 2020-08-05 | Paper |
Shortest covers of all cyclic shifts of a string
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Streaming \(k\)-mismatch with error correcting and applications
Information and Computation | 2020-03-12 | Paper |
Universal reconstruction of a string
Theoretical Computer Science | 2020-02-20 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | 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 |
String periods in the order-preserving model
Information and Computation | 2020-01-17 | Paper |
Efficient representation and counting of antipower factors in words
Lecture Notes in Computer Science | 2019-12-04 | Paper |
Pattern matching and consensus problems on weighted sequences and profiles
Theory of Computing Systems | 2019-06-27 | Paper |
Palindromic decompositions with gaps and errors
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 |
Correction to: ``Longest common substring with approximately \(k\) mismatches
Algorithmica | 2019-05-21 | Paper |
Longest common substring with approximately \(k\) mismatches
Algorithmica | 2019-05-17 | Paper |
A linear time algorithm for seeds computation
| 2019-05-10 | Paper |
On-line weighted pattern matching
Information and Computation | 2019-05-02 | Paper |
On Abelian Longest Common Factor with and without RLE
Fundamenta Informaticae | 2019-01-17 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
| 2018-10-17 | Paper |
On periodicity lemma for partial words
| 2018-06-26 | Paper |
Pattern matching and consensus problems on weighted sequences and profiles
| 2018-04-19 | Paper |
Faster algorithms for 1-mappability of a sequence
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Efficient algorithms for shortest partial seeds in words
Theoretical Computer Science | 2018-02-16 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
Theoretical Computer Science | 2018-02-16 | Paper |
String powers in trees
Algorithmica | 2017-11-09 | Paper |
Covering problems for partial words and for indeterminate strings
Theoretical Computer Science | 2017-11-06 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
| 2017-10-17 | Paper |
scientific article; zbMATH DE number 6792413 (Why is no real title available?)
| 2017-10-17 | Paper |
Internal pattern matching queries in a text and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Two strings at Hamming distance 1 cannot be both quasiperiodic
Information Processing Letters | 2017-09-19 | Paper |
Palindromic decompositions with gaps and errors
| 2017-08-22 | Paper |
Efficient indexes for jumbled pattern matching with constant-sized alphabet
Algorithmica | 2017-05-02 | Paper |
Fast algorithms for abelian periods in words and greatest common divisor queries
| 2017-01-30 | Paper |
Fast algorithms for abelian periods in words and greatest common divisor queries
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
SIAM Journal on Discrete Mathematics | 2016-10-28 | Paper |
Maximum number of distinct and nonequivalent nonstandard squares in a word
Theoretical Computer Science | 2016-09-12 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Subquadratic-time algorithms for abelian stringology problems
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Discrete Applied Mathematics | 2016-04-07 | Paper |
On the greedy algorithm for the shortest common superstring problem with reversals
Information Processing Letters | 2016-01-05 | Paper |
Universal reconstruction of a string
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Linear-time version of Holub's algorithm for morphic imprimitivity testing
Theoretical Computer Science | 2015-09-25 | Paper |
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
Covering problems for partial words and for indeterminate strings
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Fast algorithm for partial covers in words
Algorithmica | 2015-09-03 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
String Powers in Trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
String Processing and Information Retrieval | 2015-02-10 | Paper |
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Developments in Language Theory | 2014-10-14 | Paper |
A linear time algorithm for consecutive permutation pattern matching
Information Processing Letters | 2014-08-13 | Paper |
Efficient counting of square substrings in a tree
Theoretical Computer Science | 2014-07-07 | Paper |
Computing \(k\)-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Efficient Algorithms for Shortest Partial Seeds in Words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science | 2014-01-22 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
Efficient indexes for jumbled pattern matching with constant-sized alphabet
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fast Algorithm for Partial Covers in Words
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Efficient counting of square substrings in a tree
Algorithms and Computation | 2013-03-21 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
Language and Automata Theory and Applications | 2013-03-18 | Paper |
On the maximum number of cubic subwords in a word
European Journal of Combinatorics | 2012-11-15 | Paper |
The maximal number of cubic runs in a word
Journal of Computer and System Sciences | 2012-11-06 | Paper |
On the maximal sum of exponents of runs in a string
Journal of Discrete Algorithms | 2012-09-13 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
On the structure of compacted subword graphs of Thue-Morse words and their applications
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Hamiltonian paths in the square of a tree
Algorithms and Computation | 2011-12-16 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
On the Maximal Sum of Exponents of Runsin a String
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Algorithms for Three Versions of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2010-07-26 | Paper |
On the maximal number of cubic runs in a string
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Efficient testing of equivalence of words in a free idempotent semigroup
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
On the maximal number of cubic subwords in a string
Lecture Notes in Computer Science | 2009-12-11 | Paper |
