| Publication | Date of Publication | Type |
|---|
On suffix tree detection
Theoretical Computer Science | 2024-08-27 | Paper |
| On suffix tree detection | 2024-05-29 | Paper |
| Partial permutations comparison, maintenance and applications | 2024-05-06 | Paper |
Multidimensional Period Recovery
1511.6835 | 2022-12-22 | Paper |
| Exploiting pseudo-locality of interchange distance | 2022-06-15 | Paper |
Multidimensional period recovery
Algorithmica | 2022-06-01 | Paper |
A comparative study of dictionary matching with gaps: limitations, techniques and challenges
Algorithmica | 2022-03-22 | Paper |
| Quasi-periodicity under mismatch errors | 2020-12-16 | Paper |
Online recognition of dictionary with one gap
Information and Computation | 2020-12-15 | Paper |
Online parameterized dictionary matching with one gap
Theoretical Computer Science | 2020-10-22 | Paper |
| Approximate cover of strings | 2020-05-25 | Paper |
| scientific article; zbMATH DE number 7203330 (Why is no real title available?) | 2020-05-25 | Paper |
Approximate cover of strings
Theoretical Computer Science | 2019-10-07 | Paper |
Can we recover the cover?
Algorithmica | 2019-05-21 | Paper |
Mind the gap!
Algorithmica | 2019-05-17 | Paper |
| Mind the gap: essentially optimal algorithms for online dictionary matching with one gap | 2018-04-19 | Paper |
LCS\(k\): a refined similarity measure
Theoretical Computer Science | 2016-06-16 | Paper |
Dictionary matching with a few gaps
Theoretical Computer Science | 2015-06-01 | Paper |
Approximate periodicity
Information and Computation | 2015-05-04 | Paper |
Cycle detection and correction
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Dictionary matching with one gap
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Range LCP
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Closest periodic vectors in \(L_p\) spaces
Theoretical Computer Science | 2014-04-16 | Paper |
Detecting approximate periodic patterns
Theoretical Computer Science | 2014-03-13 | Paper |
On approximating string selection problems with outliers
Theoretical Computer Science | 2014-01-10 | Paper |
Detecting Approximate Periodic Patterns
Lecture Notes in Computer Science | 2013-04-19 | Paper |
On approximating string selection problems with outliers
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science | 2012-05-14 | Paper |
Closest periodic vectors in \(L_p\) spaces
Algorithms and Computation | 2011-12-16 | Paper |
Range LCP
Algorithms and Computation | 2011-12-16 | Paper |
Approximate string matching with stuck address bits
Theoretical Computer Science | 2011-07-14 | Paper |
Distance oracles for vertex-labeled graphs
Automata, Languages and Programming | 2011-07-07 | Paper |
LCS approximation via embedding into locally non-repetitive strings
Information and Computation | 2011-04-28 | Paper |
Approximate Periodicity
Algorithms and Computation | 2010-12-09 | Paper |
Cycle detection and correction
Automata, Languages and Programming | 2010-09-07 | Paper |
On the cost of interchange rearrangement in strings
SIAM Journal on Computing | 2010-09-06 | Paper |
String rearrangement metrics: a survey
Algorithms and Applications | 2010-05-04 | Paper |
Approximate string matching with address bit errors
Theoretical Computer Science | 2009-11-18 | Paper |
Interchange rearrangement: the element-cost model
Theoretical Computer Science | 2009-10-09 | Paper |
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
Theoretical Computer Science | 2009-10-09 | Paper |
Pattern matching with address errors: rearrangement distances
Journal of Computer and System Sciences | 2009-07-24 | Paper |
LCS Approximation via Embedding into Local Non-repetitive Strings
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Quasi-distinct Parsing and Optimal Compression Methods
Combinatorial Pattern Matching | 2009-07-07 | Paper |
| The practical efficiency of convolutions in pattern matching algorithms | 2009-01-28 | Paper |
On the Cost of Interchange Rearrangement in Strings
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Approximate String Matching with Address Bit Errors
Combinatorial Pattern Matching | 2008-06-17 | Paper |
