| Publication | Date of Publication | Type |
|---|
Order-preserving squares in strings
| 2024-10-21 | Paper |
Reconstructing parameterized strings from parameterized suffix and LCP arrays
Theoretical Computer Science | 2024-02-23 | Paper |
Reconstructing parameterized strings from parameterized suffix and LCP arrays
String Processing and Information Retrieval | 2023-08-04 | Paper |
Double string tandem repeats
Algorithmica | 2023-04-21 | Paper |
scientific article; zbMATH DE number 7651094 (Why is no real title available?)
| 2023-02-07 | Paper |
On Indeterminate Strings Matching.
| 2023-02-07 | Paper |
Top Tree Compression of Tries.
| 2023-02-03 | Paper |
Cartesian Tree Matching and Indexing
| 2022-07-18 | Paper |
Lower bounds for the number of repetitions in 2D strings
| 2022-06-15 | Paper |
Top tree compression of tries
Algorithmica | 2022-01-18 | Paper |
Fast entropy-bounded string dictionary look-up with mismatches
| 2021-08-04 | Paper |
Two-dimensional maximal repetitions
| 2021-08-04 | Paper |
A faster construction of greedy consensus trees
| 2021-07-28 | Paper |
Finding patterns and periods in Cartesian tree matching
Theoretical Computer Science | 2020-10-22 | Paper |
Finding periods in Cartesian tree matching
| 2020-02-25 | Paper |
Two-dimensional maximal repetitions
Theoretical Computer Science | 2020-02-20 | Paper |
Period recovery of strings over the Hamming and edit distances
Theoretical Computer Science | 2018-02-16 | Paper |
The nearest colored node in a tree
Theoretical Computer Science | 2018-02-16 | Paper |
String cadences
Theoretical Computer Science | 2017-11-06 | Paper |
The nearest colored node in a tree
| 2017-10-17 | Paper |
Locating maximal approximate runs in a string
Theoretical Computer Science | 2017-10-17 | Paper |
Random access to grammar-compressed strings
| 2017-09-29 | Paper |
On Cartesian trees and range minimum queries
Algorithmica | 2017-05-17 | Paper |
Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
Theoretical Computer Science | 2017-02-06 | Paper |
Fast computation of a string duplication history under no-breakpoint-reuse
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Online timestamped text indexing
Information Processing Letters | 2016-06-16 | Paper |
Sequence similarity measures based on bounded Hamming distance
Theoretical Computer Science | 2016-06-16 | Paper |
Longest common extensions in trees
Theoretical Computer Science | 2016-06-16 | Paper |
Efficient special cases of pattern matching with swaps
Information Processing Letters | 2016-06-09 | Paper |
Period recovery over the Hamming and edit distances
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Algorithmica | 2015-11-19 | Paper |
Dynamic text and static pattern matching
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Longest common extensions in trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Range minimum query indexes in higher dimensions
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Random access to grammar-compressed strings and trees
SIAM Journal on Computing | 2015-06-11 | Paper |
Tree compression with top trees
Information and Computation | 2015-06-09 | Paper |
Computing the Burrows-Wheeler transform in place and in small space
Journal of Discrete Algorithms | 2015-05-04 | 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 |
On approximating string selection problems with outliers
Theoretical Computer Science | 2014-01-10 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Tree compression with top trees
Automata, Languages, and Programming | 2013-08-06 | Paper |
A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Locating all maximal approximate runs in a string
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Detecting Approximate Periodic Patterns
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Unified compression-based acceleration of edit-distance computation
Algorithmica | 2013-03-05 | Paper |
NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
International Journal of Computational Methods | 2013-02-21 | Paper |
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters | 2012-10-23 | Paper |
On approximating string selection problems with outliers
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Local exact pattern matching for non-fixed RNA structures
Combinatorial Pattern Matching | 2012-08-14 | Paper |
A unified algorithm for accelerating edit-distance computation via text-compression
| 2012-04-24 | Paper |
Range LCP
Algorithms and Computation | 2011-12-16 | Paper |
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Theoretical Computer Science | 2011-10-10 | Paper |
Fast RNA structure alignment for crossing input structures
Journal of Discrete Algorithms | 2011-05-03 | Paper |
LCS approximation via embedding into locally non-repetitive strings
Information and Computation | 2011-04-28 | Paper |
Indexing a Dictionary for Subset Matching Queries
Algorithms and Applications | 2010-05-04 | Paper |
Dynamic text and static pattern matching.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Sparse LCS Common Substring Alignment
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Two-dimensional pattern matching with rotations
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters | 2010-01-18 | Paper |
Interchange rearrangement: the element-cost model
Theoretical Computer Science | 2009-10-09 | Paper |
Scaled and permuted string matching
Information Processing Letters | 2009-08-27 | Paper |
On Cartesian Trees and Range Minimum Queries
Automata, Languages and Programming | 2009-07-14 | Paper |
Sparse LCS common substring alignment
Information Processing Letters | 2009-07-09 | Paper |
LCS Approximation via Embedding into Local Non-repetitive Strings
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Fast RNA Structure Alignment for Crossing Input Structures
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Haplotype Inference Constrained by Plausible Haplotype Data
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Approximating the 2-interval pattern problem
Theoretical Computer Science | 2008-07-10 | Paper |
Computing similarity of run-length encoded strings with affine gap penalty
Theoretical Computer Science | 2008-07-10 | Paper |
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Two algorithms for LCS consecutive suffix alignment
Journal of Computer and System Sciences | 2007-08-27 | 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 |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Sparse normalized local alignment
Algorithmica | 2006-03-21 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
scientific article; zbMATH DE number 2185612 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2119727 (Why is no real title available?)
| 2004-11-29 | Paper |
Two-dimensional pattern matching with rotations
Theoretical Computer Science | 2004-10-27 | Paper |
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2079423 (Why is no real title available?)
| 2004-07-28 | Paper |
Inplace 2D matching in compressed images
Journal of Algorithms | 2004-03-14 | Paper |
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
SIAM Journal on Computing | 2004-01-08 | Paper |
Inplace run-length 2d compressed search.
Theoretical Computer Science | 2003-08-17 | Paper |
Edit distance of run-length encoded strings.
Information Processing Letters | 2003-01-21 | Paper |
On the common substring alignment problem
Journal of Algorithms | 2002-07-08 | Paper |
Text Indexing and Dictionary Matching with One Error
Journal of Algorithms | 2001-04-02 | Paper |
scientific article; zbMATH DE number 1445380 (Why is no real title available?)
| 2001-04-01 | Paper |
Pattern Matching with Swaps
Journal of Algorithms | 2000-12-19 | Paper |
Parallel algorithms for contour extraction and coding on an EREW PRAM computer
Pattern Recognition Letters | 2000-08-01 | Paper |
scientific article; zbMATH DE number 1445382 (Why is no real title available?)
| 2000-05-10 | Paper |
Matching for run-length encoded strings
Journal of Complexity | 1999-05-11 | Paper |
Incremental String Comparison
SIAM Journal on Computing | 1998-05-10 | Paper |
Parallel Suffix–Prefix-Matching Algorithm and Applications
SIAM Journal on Computing | 1996-11-07 | Paper |
Pattern matching in a digitized image
Algorithmica | 1996-02-26 | Paper |
scientific article; zbMATH DE number 826056 (Why is no real title available?)
| 1995-12-13 | Paper |
scientific article; zbMATH DE number 742993 (Why is no real title available?)
| 1995-04-11 | Paper |
scientific article; zbMATH DE number 432781 (Why is no real title available?)
| 1994-09-20 | Paper |
Identifying periodic occurrences of a template with applications to protein structure
Information Processing Letters | 1993-05-16 | Paper |
An efficient algorithm for the all pairs suffix-prefix problem
Information Processing Letters | 1992-09-26 | Paper |
Efficient pattern matching with scaling
Journal of Algorithms | 1992-06-28 | Paper |
Fast parallel and serial multidimensional approximate array matching
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4126689 (Why is no real title available?)
| 1990-01-01 | Paper |
The power of multimedia: Combining point-to-point and multi-access networks
Information and Computation | 1990-01-01 | Paper |
Fast parallel and serial approximate string matching
Journal of Algorithms | 1989-01-01 | Paper |
Parallel construction of a suffix tree with applications
Algorithmica | 1988-01-01 | Paper |
Fast string matching with k differences
Journal of Computer and System Sciences | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4047160 (Why is no real title available?)
| 1987-01-01 | Paper |
Distributed algorithms in synchronous broadcasting networks
Theoretical Computer Science | 1987-01-01 | Paper |
Efficient string matching with k mismatches
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3990833 (Why is no real title available?)
| 1985-01-01 | Paper |
