| Publication | Date of Publication | Type |
|---|
| MUL-tree pruning for consistency and compatibility | 2024-10-21 | Paper |
| Linear-time computation of cyclic roots and cyclic covers of a string | 2024-10-21 | Paper |
| Linear-time computation of shortest covers of all rotations of a string | 2024-05-06 | Paper |
| Online algorithms on antipowers and antiperiods | 2024-04-19 | Paper |
| Finding the cyclic covers of a string | 2023-11-24 | Paper |
| Maximal degenerate palindromes with gaps and mismatches | 2023-10-12 | Paper |
| Efficient computation of sequence mappability | 2023-07-28 | Paper |
| Longest common prefixes with \(k\)-errors and applications | 2023-07-28 | Paper |
| Longest property-preserved common factor | 2023-07-28 | Paper |
| Maximal motif discovery in a sliding window | 2023-07-28 | Paper |
| Property Suffix Array with Applications in Indexing Weighted Sequences | 2023-05-23 | Paper |
| Finding the Anticover of a String | 2023-02-07 | Paper |
| Internal Quasiperiod Queries | 2022-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090361 | 2022-07-18 | Paper |
| Quasi-Linear-Time Algorithm for Longest Common Circular Factor | 2022-07-18 | Paper |
| Computing the Antiperiod(s) of a String | 2022-07-18 | Paper |
| Efficient computation of sequence mappability | 2022-05-03 | Paper |
| Efficient pattern matching in elastic-degenerate strings | 2021-07-21 | Paper |
| Comparing Degenerate Strings | 2021-05-20 | Paper |
| Efficient Identification of k-Closed Strings | 2021-04-19 | Paper |
| Shortest covers of all cyclic shifts of a string | 2021-04-14 | Paper |
| Longest Common Factor After One Edit Operation | 2021-02-16 | Paper |
| Linear-Time Algorithm for Long LCF with k Mismatches | 2020-12-16 | Paper |
| Longest Common Prefixes with k-Mismatches and Applications | 2020-10-21 | Paper |
| Searching and Indexing Circular Patterns | 2020-08-07 | Paper |
| Shortest covers of all cyclic shifts of a string | 2020-07-22 | Paper |
| Optimal Computation of Overabundant Words | 2020-05-27 | Paper |
| On-line pattern matching on similar texts | 2020-05-25 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2020-02-20 | Paper |
| Longest property-preserved common factor: a new string-processing framework | 2020-02-20 | Paper |
| Property suffix array with applications | 2020-02-12 | Paper |
| Off-line and on-line algorithms for closed string factorization | 2019-10-07 | Paper |
| On overabundant words and their application to biological sequence analysis | 2019-10-07 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| On-line weighted pattern matching | 2019-05-02 | Paper |
| Efficient Computation of Palindromes in Sequences with Uncertainties* | 2019-01-17 | Paper |
| Near-optimal computation of runs over general alphabet via non-crossing LCE queries | 2018-10-17 | Paper |
| How to answer a small batch of RMQs or LCA queries in practice | 2018-06-15 | Paper |
| Recent advances of palindromic factorization | 2018-06-15 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2018-03-26 | Paper |
| Optimal computation of avoided words | 2018-03-23 | Paper |
| Covering problems for partial words and for indeterminate strings | 2017-11-06 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2017-10-23 | Paper |
| Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. | 2017-10-17 | Paper |
| Text redundancies | 2017-10-06 | Paper |
| Two strings at Hamming distance 1 cannot be both quasiperiodic | 2017-09-19 | Paper |
| Palindromic decompositions with gaps and errors | 2017-08-22 | Paper |
| Circular Sequence Comparison with q-grams | 2017-07-25 | Paper |
| Efficient pattern matching in elastic-degenerate strings | 2017-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978301 | 2017-04-21 | Paper |
| Fast circular dictionary-matching algorithm | 2017-04-04 | Paper |
| The longest common substring problem | 2017-04-04 | Paper |
| Algorithms for longest common abelian factors | 2016-11-18 | Paper |
| Closed factorization | 2016-09-12 | Paper |
| The swap matching problem revisited | 2016-06-27 | Paper |
| Order-preserving indexing | 2016-06-16 | Paper |
| On the appearance of seeds in words | 2016-05-30 | Paper |
| Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis | 2016-05-03 | Paper |
| Average-Case Optimal Approximate Circular String Matching | 2016-04-08 | Paper |
| Linear-time superbubble identification algorithm for genome assembly | 2015-12-08 | Paper |
| Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment | 2015-09-30 | Paper |
| New simple efficient algorithms computing powers and runs in strings | 2015-09-22 | Paper |
| Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance | 2015-09-15 | Paper |
| Covering problems for partial words and for indeterminate strings | 2015-09-11 | Paper |
| A note on the longest common compatible prefix problem for partial words | 2015-08-24 | Paper |
| Global and local sequence alignment with a bounded number of gaps | 2015-04-29 | Paper |
| Antimagicness of generalized corona and snowflake graphs | 2015-03-25 | Paper |
| Bipartite Ramsey numbers involving stars, stripes and trees | 2015-03-05 | Paper |
| Tree template matching in unranked ordered trees | 2014-08-13 | Paper |
| Maximizing the size of planar graphs under girth constraints | 2014-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5169578 | 2014-07-10 | Paper |
| Abelian borders in binary words | 2014-05-06 | Paper |
| Degree/diameter problem for trees and pseudotrees | 2014-04-25 | Paper |
| Extending alignments with \(k\)-mismatches and \(\ell\)-gaps | 2014-03-13 | Paper |
| Order-preserving matching | 2014-03-13 | Paper |
| On the average number of regularities in a word | 2014-03-13 | Paper |
| Extracting powers and periods in a word from its runs structure | 2014-01-22 | Paper |
| Suffix Tree of Alignment: An Efficient Index for Similar Data | 2014-01-17 | Paper |
| Enhanced string covering | 2014-01-16 | Paper |
| Efficient seed computation revisited | 2014-01-09 | Paper |
| Overlapping factors in words | 2013-12-13 | Paper |
| On left and right seeds of a string | 2013-06-24 | Paper |
| Tree template matching in ranked ordered trees by pushdown automata | 2013-06-24 | Paper |
| IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS | 2013-06-06 | Paper |
| Generic Algorithms for Factoring Strings | 2013-04-09 | Paper |
| Computing all subtree repeats in ordered trees | 2013-03-21 | Paper |
| A note on efficient computation of all abelian periods in a string | 2013-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910720 | 2013-03-19 | Paper |
| NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES | 2013-02-21 | Paper |
| Construction of antimagic labeling for the Cartesian product of regular graphs | 2012-12-03 | Paper |
| Computing the longest previous factor | 2012-11-15 | Paper |
| The maximal number of cubic runs in a word | 2012-11-06 | Paper |
| Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome | 2012-08-30 | Paper |
| The Maximum Number of Squares in a Tree | 2012-08-14 | Paper |
| Improved algorithms for the range next value problem and applications | 2012-06-25 | Paper |
| Efficient algorithms for three variants of the LPF table | 2012-05-11 | Paper |
| An algorithm for mapping short reads to a dynamically changing genomic sequence | 2012-05-11 | Paper |
| On the Right-Seed Array of a String | 2011-08-17 | Paper |
| Tree Template Matching in Ranked Ordered Trees by Pushdown Automata | 2011-07-29 | Paper |
| Efficient Seeds Computation Revisited | 2011-06-29 | Paper |
| New complexity results for the \(k\)-covers problem | 2011-06-22 | Paper |
| Finding Patterns In Given Intervals | 2011-06-14 | Paper |
| A Note on a priori Estimations of Classification Circuit Complexity | 2011-06-10 | Paper |
| Validation and Decomposition of Partially Occluded Images | 2011-04-01 | Paper |
| NUMBER OF OCCURRENCES OF POWERS IN STRINGS | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576753 | 2010-08-02 | Paper |
| Algorithms for Three Versions of the Shortest Common Superstring Problem | 2010-07-26 | Paper |
| Cover Array String Reconstruction | 2010-07-26 | Paper |
| Varieties of Regularities in Weighted Sequences | 2010-07-20 | Paper |
| Optimal prefix and suffix queries on texts | 2010-06-09 | Paper |
| On diregularity of digraphs of defect at most two | 2010-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565933 | 2010-06-07 | Paper |
| Algorithms for two versions of LCS problem for indeterminate strings | 2010-06-07 | Paper |
| An algorithmic framework for motif discovery problems in weighted sequences | 2010-05-28 | Paper |
| On the maximal number of cubic runs in a string | 2010-05-26 | Paper |
| Finite automata based algorithms on subsequences and supersequences of degenerate strings | 2010-05-25 | Paper |
| A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches | 2010-05-04 | Paper |
| New efficient algorithms for the LCS and constrained LCS problems | 2010-04-19 | Paper |
| Faster index for property matching | 2010-03-24 | Paper |
| A bit-parallel suffix automaton approach for \((\delta,\gamma)\)-matching in music retrieval. | 2010-02-09 | Paper |
| Toward a General Framework for Polyphonic Comparison | 2010-02-05 | Paper |
| Faster algorithms for computing maximal multirepeats in multiple sequences | 2010-02-05 | Paper |
| Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays | 2010-01-28 | Paper |
| LPF computation revisited | 2009-12-11 | Paper |
| A new efficient algorithm for computing the longest common subsequence | 2009-10-19 | Paper |
| Indexing factors with gaps | 2009-07-24 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| On special families of morphisms related to \(\delta \)-matching and don't care symbols | 2009-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506326 | 2009-01-28 | Paper |
| Algorithms for computing the \(\lambda\)-regularities in strings | 2009-01-28 | Paper |
| IDENTIFYING RHYTHMS IN MUSICAL TEXTS | 2008-11-03 | Paper |
| Bounds on Powers in Strings | 2008-10-30 | Paper |
| Finding Patterns in Given Intervals | 2008-09-17 | Paper |
| A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching | 2008-09-08 | Paper |
| Property matching and weighted matching | 2008-07-10 | Paper |
| Algorithms for computing variants of the longest common subsequence problem | 2008-07-10 | Paper |
| Algorithms for Computing the Longest Parameterized Common Subsequence | 2008-06-17 | Paper |
| The Constrained Longest Common Subsequence Problem for Degenerate Strings | 2008-06-10 | Paper |
| Algorithms for Computing Variants of the Longest Common Subsequence Problem | 2008-04-24 | Paper |
| Generalized approximate regularities in strings | 2008-03-27 | Paper |
| Indexing Circular Patterns | 2008-03-25 | Paper |
| Indexing Factors with Gaps | 2008-03-07 | Paper |
| A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns | 2008-03-07 | Paper |
| Approximate seeds of strings | 2008-03-06 | Paper |
| Computing the repetitions in a biological weighted sequence | 2008-03-06 | Paper |
| The complexity of the minimum \(k\)-cover problem | 2008-03-06 | Paper |
| Computing the λ-Seeds of a String | 2008-01-04 | Paper |
| A New Efficient Algorithm for Computing the Longest Common Subsequence | 2008-01-04 | Paper |
| Algorithms for extracting motifs from biological weighted sequences | 2007-10-30 | Paper |
| Linear time algorithm for the longest common repeat problem | 2007-10-30 | Paper |
| Computing the \(\lambda \)-covers of a string | 2007-10-10 | Paper |
| Approximate Matching in Weighted Sequences | 2007-09-14 | Paper |
| Property Matching and Weighted Matching | 2007-09-14 | Paper |
| Finding Patterns with Variable Length Gaps or Don’t Cares | 2007-09-10 | Paper |
| Finding Common Motifs with Gaps Using Finite Automata | 2007-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3421028 | 2007-02-12 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Longest repeats with a block of \(k\) don't cares | 2006-10-20 | Paper |
| Computational and Information Science | 2006-10-10 | Paper |
| The subtree max gap problem with application to parallel string covering | 2006-10-10 | Paper |
| The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications | 2006-08-03 | Paper |
| Experimental results in pattern matching on weighted sequences | 2006-02-21 | Paper |
| Implementing approximate regularities | 2006-02-16 | Paper |
| A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS | 2005-12-15 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata | 2005-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024803 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673412 | 2005-04-29 | Paper |
| Approximate string matching for music analysis | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737699 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737695 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471991 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4454548 | 2004-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432970 | 2003-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432974 | 2003-10-29 | Paper |
| Truncated suffix trees and their application to data compression. | 2003-08-17 | Paper |
| Algorithms For Computing Approximate Repetitions In Musical Sequences | 2003-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788550 | 2003-01-29 | Paper |
| A fast and practical bit-vector algorithm for the longest common subsequence problem | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4330724 | 2002-05-14 | Paper |
| Approximate periods of strings | 2002-03-03 | Paper |
| On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150181 | 2002-01-01 | Paper |
| Computing evolutionary chains in musical sequences | 2001-10-16 | Paper |
| Distributed pattern matching using finite automata | 2001-07-29 | Paper |
| A failure function for multiple two-dimensional pattern matching | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939600 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503964 | 2000-09-14 | Paper |
| Optimal parallel analysis and decomposition of partially occluded strings | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250738 | 1999-12-19 | Paper |
| Quasiperiodicity and string covering | 1999-06-21 | Paper |
| Two-dimensional prefix string matching and covering on square matrices | 1998-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128912 | 1997-04-23 | Paper |
| A work-time optimal algorithm for computing all string covers | 1997-02-27 | Paper |
| On the lower bound for parallel string matching | 1997-02-13 | Paper |
| Covering a string | 1996-10-16 | Paper |
| A fast average case algorithm for lyndon decomposition | 1996-10-07 | Paper |
| Parallel RAM algorithms for factorizing words | 1995-01-26 | Paper |
| Optimal algorithms for computing the canonical form of a circular string | 1992-09-26 | Paper |
| Optimal superprimitivity testing for strings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197327 | 1989-01-01 | Paper |
| Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations | 1989-01-01 | Paper |
| Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484354 | 1989-01-01 | Paper |
| On the computational complexity of the Abelian permutation group structure, membership and intersection problems | 1988-01-01 | Paper |
| Parallel construction of a suffix tree with applications | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782811 | 1987-01-01 | Paper |
| Monte Carlo circuits for the abelian permutation group intersection problem | 1986-01-01 | Paper |
| Computing in general Abelian groups is hard | 1985-01-01 | Paper |
| Analysis of algorithms on problems in general abelian groups | 1985-01-01 | Paper |
| Computing a basis for a finite Abelian p-group | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3705594 | 1985-01-01 | Paper |
| Analysis of an algorithm for composition of binary quadratic forms | 1982-01-01 | Paper |
