| Publication | Date of Publication | Type |
|---|
Order-preserving pattern matching with scaling
Information Processing Letters | 2023-01-30 | Paper |
Faster filters for approximate string matching
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
Theoretical Computer Science | 2018-02-16 | Paper |
FM-index of alignment with gaps
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 |
FM-index of alignment: a compressed index for similar strings
Theoretical Computer Science | 2016-06-16 | 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 |
Suffix tree of alignment: an efficient index for similar data
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Fast order-preserving pattern matching
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
On-line construction of parameterized suffix trees for large alphabets
Information Processing Letters | 2013-04-04 | 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 |
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 |
Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
Theoretical Computer Science | 2007-10-18 | Paper |
On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
Algorithmica | 2007-10-10 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Truncated suffix trees and their application to data compression.
Theoretical Computer Science | 2003-08-17 | Paper |
