| Publication | Date of Publication | Type |
|---|
Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Graph compression by BFS
Algorithms | 2018-08-20 | Paper |
String cadences
Theoretical Computer Science | 2017-11-06 | Paper |
Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
Theoretical Computer Science | 2017-02-06 | Paper |
Efficient Alignment Free Sequence Comparison with Bounded Mismatches
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Sequence similarity measures based on bounded Hamming distance
Theoretical Computer Science | 2016-06-16 | Paper |
A PTAS for the square tiling problem
Theoretical Computer Science | 2014-12-02 | Paper |
Range LCP
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Detecting approximate periodic patterns
Theoretical Computer Science | 2014-03-13 | Paper |
Modulated string searching
Theoretical Computer Science | 2014-03-13 | Paper |
Efficient algorithms for the periodic subgraphs mining problem
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Detecting Approximate Periodic Patterns
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Speedup for a periodic subgraph miner
Information Processing Letters | 2013-03-28 | Paper |
Parameterized searching with mismatches for run-length encoded strings
Theoretical Computer Science | 2012-10-11 | Paper |
Range LCP
Algorithms and Computation | 2011-12-16 | Paper |
Optimal extraction of irredundant motif bases
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Maximal Words in Sequence Comparisons Based on Subword Composition
Algorithms and Applications | 2010-05-04 | Paper |
Ask not what stringology can do for you: advances in pattern matching driven by computational biology
Communications in Information and Systems | 2010-04-15 | Paper |
The subsequence composition of a string
Theoretical Computer Science | 2009-10-09 | Paper |
Discovering subword associations in strings in time linear in the output size
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Optimal Offline Extraction of Irredundant Motif Bases
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Bridging Lossy and Lossless Compression by Motif Pattern Discovery
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
Theoretical Computer Science | 2008-12-12 | Paper |
Periodicity and repetitions in parameterized strings
Discrete Applied Mathematics | 2008-09-29 | Paper |
Scoring unusual words with varying mismatch errors
Mathematics in Computer Science | 2008-09-08 | Paper |
Parameterized matching with mismatches
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Motif patterns in 2D
Theoretical Computer Science | 2008-03-05 | Paper |
Fast gapped variants for Lempel-Ziv-Welch compression
Information and Computation | 2007-07-16 | Paper |
Bridging Lossy and Lossless Compression by Motif Pattern Discovery
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Periodicity and Repetitions in Parameterized Strings
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Motif discovery by monotone scores
Discrete Applied Mathematics | 2007-04-18 | Paper |
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics | 2005-11-07 | Paper |
Discovery Science
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms | 2004-08-06 | Paper |
Truncated suffix trees and their application to data compression.
Theoretical Computer Science | 2003-08-17 | Paper |
A speed-up for the commute between subword trees and DAWGs.
Information Processing Letters | 2003-01-21 | Paper |
Compact recognizers of episode sequences
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1792103 (Why is no real title available?)
| 2002-11-11 | Paper |
Fibonacci arrays and their two-dimensional repetitions
Theoretical Computer Science | 2000-06-04 | Paper |
scientific article; zbMATH DE number 1414294 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1301593 (Why is no real title available?)
| 1999-06-16 | Paper |
Matching for run-length encoded strings
Journal of Complexity | 1999-05-11 | Paper |
Inverse Pattern Matching
Journal of Algorithms | 1997-10-20 | Paper |
Parallel detection of all palindromes in a string
Theoretical Computer Science | 1997-02-28 | Paper |
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
SIAM Journal on Computing | 1997-02-24 | Paper |
Data structures and algorithms for the string statistics problem
Algorithmica | 1996-05-27 | Paper |
Fast parallel Lyndon factorization with applications
Mathematical Systems Theory | 1995-04-05 | Paper |
The Set Union Problem with Unlimited Backtracking
SIAM Journal on Computing | 1994-12-21 | Paper |
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science | 1993-11-28 | Paper |
Erratum to: New clique and independent set algorithms for circle graphs
Discrete Applied Mathematics | 1993-05-16 | Paper |
Efficient CRCW-PRAM algorithms for universal substring searching
Theoretical Computer Science | 1993-05-16 | Paper |
Self-alignments in words and their applications
Journal of Algorithms | 1993-01-16 | Paper |
Optimal parallel detection of squares in strings
Algorithmica | 1992-09-27 | Paper |
Optimal canonization of all substrings of a string
Information and Computation | 1992-06-28 | Paper |
New clique and independent set algorithms for circle graphs
Discrete Applied Mathematics | 1992-06-28 | Paper |
Optimal superprimitivity testing for strings
Information Processing Letters | 1991-01-01 | Paper |
Efficient Parallel Algorithms for String Editing and Related Problems
SIAM Journal on Computing | 1990-01-01 | Paper |
Parallel construction of a suffix tree with applications
Algorithmica | 1988-01-01 | Paper |
Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
The longest common subsequence problem revisited
Algorithmica | 1987-01-01 | Paper |
Finding maximum cliques on circular-arc graphs
Information Processing Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4045190 (Why is no real title available?)
| 1987-01-01 | Paper |
The Boyer–Moore–Galil String Searching Strategies Revisited
SIAM Journal on Computing | 1986-01-01 | Paper |
Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
Information Processing Letters | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3913711 (Why is no real title available?)
| 1985-01-01 | Paper |
Structural properties of the string statistics problem
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Systolic Algorithms for String Manipulations
IEEE Transactions on Computers | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3864532 (Why is no real title available?)
| 1984-01-01 | Paper |
Optimal off-line detection of repetitions in a string
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3793440 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3954313 (Why is no real title available?)
| 1979-01-01 | Paper |
C-calculus: An elementary approach to some problems in pattern recognition
Pattern Recognition | 1978-01-01 | Paper |
