| Publication | Date of Publication | Type |
|---|
| On suffix tree detection | 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 | 2022-12-22 | Paper |
| Exploiting pseudo-locality of interchange distance | 2022-06-15 | Paper |
| Multidimensional period recovery | 2022-06-01 | Paper |
| A comparative study of dictionary matching with gaps: limitations, techniques and challenges | 2022-03-22 | Paper |
| Quasi-Periodicity Under Mismatch Errors | 2020-12-16 | Paper |
| Online recognition of dictionary with one gap | 2020-12-15 | Paper |
| Online parameterized dictionary matching with one gap | 2020-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110892 | 2020-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110891 | 2020-05-25 | Paper |
| Approximate cover of strings | 2019-10-07 | Paper |
| Can we recover the cover? | 2019-05-21 | Paper |
| Mind the gap! | 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 | 2016-06-16 | Paper |
| Dictionary matching with a few gaps | 2015-06-01 | Paper |
| Approximate periodicity | 2015-05-04 | Paper |
| Cycle detection and correction | 2014-12-05 | Paper |
| Dictionary Matching with One Gap | 2014-06-30 | Paper |
| Range LCP | 2014-06-10 | Paper |
| Closest periodic vectors in \(L_p\) spaces | 2014-04-16 | Paper |
| Detecting approximate periodic patterns | 2014-03-13 | Paper |
| On approximating string selection problems with outliers | 2014-01-10 | Paper |
| Detecting Approximate Periodic Patterns | 2013-04-19 | Paper |
| On Approximating String Selection Problems with Outliers | 2012-08-14 | Paper |
| Quasi-distinct parsing and optimal compression methods | 2012-05-14 | Paper |
| Closest Periodic Vectors in L p Spaces | 2011-12-16 | Paper |
| Range LCP | 2011-12-16 | Paper |
| Approximate string matching with stuck address bits | 2011-07-14 | Paper |
| Distance Oracles for Vertex-Labeled Graphs | 2011-07-07 | Paper |
| LCS approximation via embedding into locally non-repetitive strings | 2011-04-28 | Paper |
| Approximate Periodicity | 2010-12-09 | Paper |
| Cycle detection and correction | 2010-09-07 | Paper |
| On the cost of interchange rearrangement in strings | 2010-09-06 | Paper |
| String rearrangement metrics: a survey | 2010-05-04 | Paper |
| Approximate string matching with address bit errors | 2009-11-18 | Paper |
| Interchange rearrangement: the element-cost model | 2009-10-09 | Paper |
| Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances | 2009-10-09 | Paper |
| Pattern matching with address errors: rearrangement distances | 2009-07-24 | Paper |
| LCS Approximation via Embedding into Local Non-repetitive Strings | 2009-07-07 | Paper |
| Quasi-distinct Parsing and Optimal Compression Methods | 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 | 2008-09-25 | Paper |
| Approximate String Matching with Address Bit Errors | 2008-06-17 | Paper |
