| Publication | Date of Publication | Type |
|---|
Comparing elastic-degenerate strings: algorithms, lower bounds, and applications
| 2024-10-21 | Paper |
Pattern masking for dictionary matching: theory and practice
Algorithmica | 2024-05-30 | Paper |
Online algorithms on antipowers and antiperiods
| 2024-04-19 | Paper |
Pattern masking for dictionary matching
| 2024-01-15 | Paper |
Longest property-preserved common factor
String Processing and Information Retrieval | 2023-07-28 | Paper |
scientific article; zbMATH DE number 7695989 (Why is no real title available?)
| 2023-06-14 | Paper |
scientific article; zbMATH DE number 7651098 (Why is no real title available?)
| 2023-02-07 | Paper |
Even faster elastic-degenerate string matching via fast matrix multiplication
| 2022-07-21 | Paper |
Degenerate string comparison and applications
| 2022-07-18 | Paper |
Detecting mutations by eBWT
| 2022-07-18 | 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 |
Comparing Degenerate Strings
Fundamenta Informaticae | 2021-05-20 | Paper |
Pattern matching on elastic-degenerate text with errors
String Processing and Information Retrieval | 2021-02-16 | 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 |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
Optimal listing of cycles and \(st\)-paths in undirected graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Motif trie: an efficient text index for pattern discovery with don't cares
Theoretical Computer Science | 2018-02-16 | Paper |
Circular sequence comparison with \(q\)-grams
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Output-sensitive pattern extraction in sequences
| 2017-04-25 | Paper |
\textsc{Rime}: repeat identification
Discrete Applied Mathematics | 2015-09-22 | Paper |
On the fixed parameter tractability and approximability of the minimum error correction problem
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science | 2009-10-09 | Paper |
Suffix tree characterization of maximal motifs in biological sequences
Theoretical Computer Science | 2009-10-09 | Paper |
Lossless filter for multiple repetitions with Hamming distance
Journal of Discrete Algorithms | 2009-05-13 | Paper |
RISOTTO: Fast Extraction of Motifs with Mismatches
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Room allocation: a polynomial subcase of the quadratic assignment problem
Discrete Applied Mathematics | 2005-02-23 | Paper |
Further thoughts on the syntenic distance between genomes
Algorithmica | 2002-09-25 | Paper |
scientific article; zbMATH DE number 1156876 (Why is no real title available?)
| 1998-10-05 | Paper |
