| Publication | Date of Publication | Type |
|---|
Order-preserving pattern matching with scaling
Information Processing Letters | 2023-01-30 | Paper |
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
Theoretical Computer Science | 2018-02-16 | Paper |
On representations of ternary order relations in numeric strings
Mathematics in Computer Science | 2017-07-17 | Paper |
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm
Theoretical Computer Science | 2017-02-06 | Paper |
A new graph model and algorithms for consistent superstring problems
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Fast multiple order-preserving matching algorithms
Lecture Notes in Computer Science | 2016-04-04 | Paper |
A simple proof of optimality for the MIN cache replacement policy
Information Processing Letters | 2015-12-01 | Paper |
Improved algorithms for the boxed-mesh permutation pattern matching problem
Combinatorial Pattern Matching | 2015-08-20 | Paper |
A fast algorithm for order-preserving pattern matching
Information Processing Letters | 2014-12-09 | Paper |
Fast order-preserving pattern matching
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Finding consensus and optimal alignment of circular strings
Theoretical Computer Science | 2013-02-19 | Paper |
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Theoretical Computer Science | 2011-10-10 | Paper |
Linear-time construction of two-dimensional suffix trees
Algorithmica | 2011-03-02 | Paper |
Finding the longest common nonsuperstring in linear time
Information Processing Letters | 2010-08-20 | Paper |
Improving on-line construction of two-dimensional suffix trees for square matrices
Information Processing Letters | 2010-08-16 | Paper |
Finding optimal alignment and consensus of circular strings
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Linear-time construction of suffix arrays (extended abstract)
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
Algorithms and Computation | 2009-12-17 | Paper |
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Approximate seeds of strings
| 2008-03-06 | Paper |
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Implementing approximate regularities
Mathematical and Computer Modelling | 2006-02-16 | Paper |
Constructing suffix arrays in linear time
Journal of Discrete Algorithms | 2005-10-27 | Paper |
scientific article; zbMATH DE number 2185637 (Why is no real title available?)
| 2005-07-04 | Paper |
Approximate periods of strings
Theoretical Computer Science | 2002-03-03 | Paper |
