| Publication | Date of Publication | Type |
|---|
Quasi-linear-time algorithm for a longest common circular factor
Theoretical Computer Science | 2026-05-11 | Paper |
Internal quasiperiod queries
Theoretical Computer Science | 2026-02-12 | Paper |
Finding the cyclic covers of a string
Information Processing Letters | 2025-10-23 | Paper |
| 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
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Maximal degenerate palindromes with gaps and mismatches
Theoretical Computer Science | 2023-10-12 | Paper |
Efficient computation of sequence mappability
String Processing and Information Retrieval | 2023-07-28 | Paper |
Longest common prefixes with k-errors and applications
String Processing and Information Retrieval | 2023-07-28 | Paper |
Longest property-preserved common factor
String Processing and Information Retrieval | 2023-07-28 | Paper |
Maximal motif discovery in a sliding window
String Processing and Information Retrieval | 2023-07-28 | Paper |
Property Suffix Array with Applications in Indexing Weighted Sequences
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
| Finding the Anticover of a String | 2023-02-07 | Paper |
Internal Quasiperiod Queries
1511.681 | 2022-12-22 | Paper |
| Degenerate string comparison and applications | 2022-07-18 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
(available as arXiv preprint) | 2022-07-18 | Paper |
| Computing the Antiperiod(s) of a String | 2022-07-18 | Paper |
Efficient computation of sequence mappability
Algorithmica | 2022-05-03 | Paper |
Efficient pattern matching in elastic-degenerate strings
Information and Computation | 2021-07-21 | Paper |
Comparing Degenerate Strings
Fundamenta Informaticae | 2021-05-20 | Paper |
Efficient identification of k-closed strings
International Journal of Foundations of Computer Science | 2021-04-19 | 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 |
Linear-time algorithm for long LCF with k mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Longest common prefixes with k-mismatches and applications
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Searching and indexing circular patterns
Algorithms for Next-Generation Sequencing Data | 2020-08-07 | Paper |
Shortest covers of all cyclic shifts of a string
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Optimal computation of overabundant words
(available as arXiv preprint) | 2020-05-27 | Paper |
| On-line pattern matching on similar texts | 2020-05-25 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
| Property suffix array with applications | 2020-02-12 | Paper |
Off-line and on-line algorithms for closed string factorization
Theoretical Computer Science | 2019-10-07 | Paper |
On overabundant words and their application to biological sequence analysis
Theoretical Computer Science | 2019-10-07 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
On-line weighted pattern matching
Information and Computation | 2019-05-02 | Paper |
Efficient Computation of Palindromes in Sequences with Uncertainties*
Fundamenta Informaticae | 2019-01-17 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
(available as arXiv preprint) | 2018-10-17 | Paper |
| Recent advances of palindromic factorization | 2018-06-15 | Paper |
How to answer a small batch of RMQs or LCA queries in practice
(available as arXiv preprint) | 2018-06-15 | Paper |
Faster algorithms for 1-mappability of a sequence
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Optimal computation of avoided words
(available as arXiv preprint) | 2018-03-23 | 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 |
Text redundancies
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
Two strings at Hamming distance 1 cannot be both quasiperiodic
Information Processing Letters | 2017-09-19 | Paper |
Palindromic decompositions with gaps and errors
(available as arXiv preprint) | 2017-08-22 | Paper |
Circular sequence comparison with q-grams
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Efficient pattern matching in elastic-degenerate texts
Lecture Notes in Computer Science | 2017-06-01 | Paper |
| Quasiperiodicities in Fibonacci strings. | 2017-04-21 | Paper |
The longest common substring problem
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Fast circular dictionary-matching algorithm
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Algorithms for longest common abelian factors
International Journal of Foundations of Computer Science | 2016-11-18 | Paper |
Closed factorization
Discrete Applied Mathematics | 2016-09-12 | Paper |
The swap matching problem revisited
Theoretical Computer Science | 2016-06-27 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
On the appearance of seeds in words
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Average-case optimal approximate circular string matching
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Linear-time superbubble identification algorithm for genome assembly
Theoretical Computer Science | 2015-12-08 | Paper |
Accurate and efficient methods to improve multiple circular sequence alignment
Experimental Algorithms | 2015-09-30 | Paper |
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
Fast and simple computations using prefix tables under Hamming and edit distance
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Covering problems for partial words and for indeterminate strings
Lecture Notes in Computer Science | 2015-09-11 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
Global and local sequence alignment with a bounded number of gaps
Theoretical Computer Science | 2015-04-29 | Paper |
Antimagicness of generalized corona and snowflake graphs
Mathematics in Computer Science | 2015-03-25 | Paper |
Bipartite Ramsey numbers involving stars, stripes and trees
Electronic Journal of Graph Theory and Applications | 2015-03-05 | Paper |
Tree template matching in unranked ordered trees
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Maximizing the size of planar graphs under girth constraints
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2014-08-12 | Paper |
| Verifying an enhanced cover array in linear time | 2014-07-10 | Paper |
Abelian borders in binary words
Discrete Applied Mathematics | 2014-05-06 | Paper |
Degree/diameter problem for trees and pseudotrees
AKCE International Journal of Graphs and Combinatorics | 2014-04-25 | Paper |
Order-preserving matching
Theoretical Computer Science | 2014-03-13 | Paper |
On the average number of regularities in a word
Theoretical Computer Science | 2014-03-13 | Paper |
Extending alignments with k-mismatches and -gaps
Theoretical Computer Science | 2014-03-13 | Paper |
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science | 2014-01-22 | Paper |
Suffix tree of alignment: an efficient index for similar data
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Enhanced string covering
Theoretical Computer Science | 2014-01-16 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
Overlapping factors in words
The Australasian Journal of Combinatorics | 2013-12-13 | Paper |
Tree template matching in ranked ordered trees by pushdown automata
Journal of Discrete Algorithms | 2013-06-24 | Paper |
On left and right seeds of a string
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Identifying all abelian periods of a string in quadratic time and relevant problems
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Generic Algorithms for Factoring Strings
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Computing all subtree repeats in ordered trees
Information Processing Letters | 2013-03-21 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
| scientific article; zbMATH DE number 6146456 (Why is no real title available?) | 2013-03-19 | Paper |
NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
International Journal of Computational Methods | 2013-02-21 | Paper |
Construction of antimagic labeling for the Cartesian product of regular graphs
Mathematics in Computer Science | 2012-12-03 | Paper |
Computing the longest previous factor
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 |
Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Improved algorithms for the range next value problem and applications
Theoretical Computer Science | 2012-06-25 | Paper |
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms | 2012-05-11 | Paper |
An algorithm for mapping short reads to a dynamically changing genomic sequence
Journal of Discrete Algorithms | 2012-05-11 | Paper |
On the right-seed array of a string
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Tree template matching in ranked ordered trees by pushdown automata
Implementation and Application of Automata | 2011-07-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
New complexity results for the k-covers problem
Information Sciences | 2011-06-22 | Paper |
Finding patterns in given intervals
Fundamenta Informaticae | 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
SOFSEM 2002: Theory and Practice of Informatics | 2011-04-01 | Paper |
NUMBER OF OCCURRENCES OF POWERS IN STRINGS
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
| Optimal prefix and suffix queries on texts | 2010-08-02 | Paper |
Cover array string reconstruction
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Algorithms for Three Versions of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Varieties of Regularities in Weighted Sequences
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Optimal prefix and suffix queries on texts
Information Processing Letters | 2010-06-09 | Paper |
| Algorithms for two versions of LCS problem for indeterminate strings | 2010-06-07 | Paper |
| On diregularity of digraphs of defect at most two | 2010-06-07 | Paper |
| scientific article; zbMATH DE number 5717259 (Why is no real title available?) | 2010-06-07 | Paper |
An algorithmic framework for motif discovery problems in weighted sequences
Lecture Notes in Computer Science | 2010-05-28 | Paper |
On the maximal number of cubic runs in a string
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Finite automata based algorithms on subsequences and supersequences of degenerate strings
Journal of Discrete Algorithms | 2010-05-25 | Paper |
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
Algorithms and Applications | 2010-05-04 | Paper |
New efficient algorithms for the LCS and constrained LCS problems
Information Processing Letters | 2010-04-19 | Paper |
Faster index for property matching
Information Processing Letters | 2010-03-24 | Paper |
A bit-parallel suffix automaton approach for \((\delta,\gamma)\)-matching in music retrieval.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Faster algorithms for computing maximal multirepeats in multiple sequences
Fundamenta Informaticae | 2010-02-05 | Paper |
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae | 2010-02-05 | Paper |
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
LPF computation revisited
Lecture Notes in Computer Science | 2009-12-11 | Paper |
A new efficient algorithm for computing the longest common subsequence
Theory of Computing Systems | 2009-10-19 | Paper |
Indexing factors with gaps
Algorithmica | 2009-07-24 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
On special families of morphisms related to \(\delta \)-matching and don't care symbols
Information Processing Letters | 2009-03-23 | Paper |
| scientific article; zbMATH DE number 5499319 (Why is no real title available?) | 2009-01-28 | Paper |
| Algorithms for computing the \(\lambda\)-regularities in strings | 2009-01-28 | Paper |
IDENTIFYING RHYTHMS IN MUSICAL TEXTS
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
Bounds on Powers in Strings
Developments in Language Theory | 2008-10-30 | Paper |
Finding Patterns in Given Intervals
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
Mathematics in Computer Science | 2008-09-08 | Paper |
Property matching and weighted matching
Theoretical Computer Science | 2008-07-10 | Paper |
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science | 2008-07-10 | Paper |
Algorithms for Computing the Longest Parameterized Common Subsequence
Combinatorial Pattern Matching | 2008-06-17 | Paper |
The Constrained Longest Common Subsequence Problem for Degenerate Strings
Implementation and Application of Automata | 2008-06-10 | Paper |
Algorithms for Computing Variants of the Longest Common Subsequence Problem
Algorithms and Computation | 2008-04-24 | Paper |
Generalized approximate regularities in strings
International Journal of Computer Mathematics | 2008-03-27 | Paper |
Indexing Circular Patterns
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Indexing Factors with Gaps
Lecture Notes in Computer Science | 2008-03-07 | 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 |
| Approximate seeds of strings | 2008-03-06 | Paper |
A New Efficient Algorithm for Computing the Longest Common Subsequence
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Computing the λ-Seeds of a String
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Computing the \(\lambda \)-covers of a string
Information Sciences | 2007-10-10 | Paper |
Approximate Matching in Weighted Sequences
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Property Matching and Weighted Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Finding Patterns with Variable Length Gaps or Don’t Cares
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Finding Common Motifs with Gaps Using Finite Automata
Implementation and Application of Automata | 2007-09-06 | Paper |
| scientific article; zbMATH DE number 5124574 (Why is no real title available?) | 2007-02-12 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Longest repeats with a block of \(k\) don't cares
Theoretical Computer Science | 2006-10-20 | Paper |
Computational and Information Science
Lecture Notes in Computer Science | 2006-10-10 | Paper |
The subtree max gap problem with application to parallel string covering
Information and Computation | 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
Mathematical and Computer Modelling | 2006-02-16 | 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 |
Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
Journal of Discrete Algorithms | 2005-10-27 | Paper |
| scientific article; zbMATH DE number 2185637 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2163025 (Why is no real title available?) | 2005-04-29 | Paper |
Approximate string matching for music analysis
Soft Computing | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2087053 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087049 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079867 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 2052918 (Why is no real title available?) | 2004-03-08 | Paper |
| scientific article; zbMATH DE number 1998335 (Why is no real title available?) | 2003-12-15 | Paper |
| scientific article; zbMATH DE number 1998339 (Why is no real title available?) | 2003-10-29 | Paper |
Truncated suffix trees and their application to data compression.
Theoretical Computer Science | 2003-08-17 | Paper |
Algorithms For Computing Approximate Repetitions In Musical Sequences
International Journal of Computer Mathematics | 2003-02-06 | Paper |
| scientific article; zbMATH DE number 1857503 (Why is no real title available?) | 2003-01-29 | Paper |
A fast and practical bit-vector algorithm for the longest common subsequence problem
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1740162 (Why is no real title available?) | 2002-05-14 | Paper |
Approximate periods of strings
Theoretical Computer Science | 2002-03-03 | Paper |
On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice
International Journal of Computer Mathematics | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1809602 (Why is no real title available?) | 2002-01-01 | Paper |
Computing evolutionary chains in musical sequences
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
Computing evolutionary chains in musical sequences
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
Distributed pattern matching using finite automata
Journal of Automata, Languages and Combinatorics | 2001-07-29 | Paper |
A failure function for multiple two-dimensional pattern matching
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1400047 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1507240 (Why is no real title available?) | 2000-09-14 | Paper |
Optimal parallel analysis and decomposition of partially occluded strings
Parallel Computing | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1304054 (Why is no real title available?) | 1999-12-19 | Paper |
Quasiperiodicity and string covering
Theoretical Computer Science | 1999-06-21 | Paper |
Two-dimensional prefix string matching and covering on square matrices
Algorithmica | 1998-05-24 | Paper |
| scientific article; zbMATH DE number 1003282 (Why is no real title available?) | 1997-04-23 | Paper |
A work-time optimal algorithm for computing all string covers
Theoretical Computer Science | 1997-02-27 | Paper |
On the lower bound for parallel string matching
International Journal of Computer Mathematics | 1997-02-13 | Paper |
Covering a string
Algorithmica | 1996-10-16 | Paper |
A fast average case algorithm for lyndon decomposition
International Journal of Computer Mathematics | 1996-10-07 | Paper |
Parallel RAM algorithms for factorizing words
Theoretical Computer Science | 1995-01-26 | Paper |
Optimal algorithms for computing the canonical form of a circular string
Theoretical Computer Science | 1992-09-26 | Paper |
Optimal superprimitivity testing for strings
Information Processing Letters | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4155884 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4172389 (Why is no real title available?) | 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
SIAM Journal on Computing | 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
SIAM Journal on Computing | 1989-01-01 | Paper |
Parallel construction of a suffix tree with applications
Algorithmica | 1988-01-01 | Paper |
On the computational complexity of the Abelian permutation group structure, membership and intersection problems
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4045190 (Why is no real title available?) | 1987-01-01 | Paper |
Monte Carlo circuits for the abelian permutation group intersection problem
Acta Informatica | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3931234 (Why is no real title available?) | 1985-01-01 | Paper |
Computing in general Abelian groups is hard
Theoretical Computer Science | 1985-01-01 | Paper |
Analysis of algorithms on problems in general abelian groups
Information Processing Letters | 1985-01-01 | Paper |
Computing a basis for a finite Abelian p-group
Information Processing Letters | 1985-01-01 | Paper |
Analysis of an algorithm for composition of binary quadratic forms
Journal of Algorithms | 1982-01-01 | Paper |
