| Publication | Date of Publication | Type |
|---|
A new class of string transformations for compressed text indexing
Information and Computation | 2023-09-27 | Paper |
An index data structure for matrices, with applications to fast two-dimensional pattern matching
Lecture Notes in Computer Science | 2023-01-18 | Paper |
A new class of searchable and provably highly compressible string transformations
| 2022-07-18 | Paper |
On-line construction of two-dimensional suffix trees
Algorithms — ESA '97 | 2021-12-20 | Paper |
The alternating BWT: an algorithmic perspective
Theoretical Computer Science | 2020-02-20 | Paper |
DNA combinatorial messages and epigenomics: the case of chromatin organization and nucleosome occupancy in eukaryotic genomes
Theoretical Computer Science | 2019-10-07 | Paper |
On the construction of classes of suffix trees for square matrices: algorithms and applications
Automata, Languages and Programming | 2019-01-10 | Paper |
Block sorting-based transformations on words: beyond the magic BWT
| 2018-11-22 | Paper |
Improving table compression with combinatorial optimization
Journal of the ACM | 2015-11-12 | Paper |
Textual data compression in computational biology: algorithmic techniques
Computer Science Review | 2014-10-24 | Paper |
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
Theoretical Computer Science | 2012-05-30 | Paper |
scientific article; zbMATH DE number 5782168 (Why is no real title available?)
| 2010-09-10 | Paper |
Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
Combinatorial Pattern Matching | 2010-04-06 | Paper |
The myriad virtues of wavelet trees
Information and Computation | 2009-07-15 | Paper |
The Myriad Virtues of Wavelet Trees
Automata, Languages and Programming | 2009-03-12 | Paper |
Boosting textual compression in optimal linear time
Journal of the ACM | 2008-12-21 | Paper |
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science | 2008-11-18 | Paper |
Periodicity and repetitions in parameterized strings
Discrete Applied Mathematics | 2008-09-29 | Paper |
A tutorial on computational cluster analysis with applications to pattern discovery in microarray data
Mathematics in Computer Science | 2008-09-08 | Paper |
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
Lecture Notes in Computer Science | 2008-03-11 | Paper |
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Theoretical Computer Science | 2007-12-19 | Paper |
On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
Algorithmica | 2007-10-10 | Paper |
Periodicity and Repetitions in Parameterized Strings
Electronic Notes in Discrete Mathematics | 2007-05-29 | 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 |
scientific article; zbMATH DE number 2119663 (Why is no real title available?)
| 2004-11-29 | Paper |
On finding common neighborhoods in massive graphs.
Theoretical Computer Science | 2003-05-25 | Paper |
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
Journal of Algorithms | 2002-07-11 | Paper |
An approximate determinization algorithm for weighted finite-state automata
Algorithmica | 2001-08-09 | Paper |
scientific article; zbMATH DE number 1615267 (Why is no real title available?)
| 2001-07-08 | Paper |
On the determinization of weighted finite automata
SIAM Journal on Computing | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1456957 (Why is no real title available?)
| 2000-06-07 | Paper |
On-line construction of two-dimensional suffix trees
Journal of Complexity | 1999-07-20 | Paper |
scientific article; zbMATH DE number 1305083 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1301593 (Why is no real title available?)
| 1999-06-16 | Paper |
Parallel construction and query of index data structures for pattern matching on square matrices
Journal of Complexity | 1999-05-11 | Paper |
scientific article; zbMATH DE number 1223726 (Why is no real title available?)
| 1998-11-15 | Paper |
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
Journal of Algorithms | 1998-06-11 | Paper |
On the construction of classes of suffix trees for square matrices: Algorithms and applications
Information and Computation | 1997-03-06 | Paper |
A Generalization of the Suffix Tree to Square Matrices, with Applications
SIAM Journal on Computing | 1996-03-18 | Paper |
Dynamic dictionary matching
Journal of Computer and System Sciences | 1996-02-26 | Paper |
scientific article; zbMATH DE number 826057 (Why is no real title available?)
| 1995-12-13 | Paper |
Sparse dynamic programming II
Journal of the ACM | 1995-07-13 | Paper |
scientific article; zbMATH DE number 437565 (Why is no real title available?)
| 1994-11-29 | Paper |
Sparse dynamic programming I
Journal of the ACM | 1994-08-21 | Paper |
scientific article; zbMATH DE number 432798 (Why is no real title available?)
| 1993-12-15 | Paper |
On the Exact Complexity of String Matching: Upper Bounds
SIAM Journal on Computing | 1993-01-16 | Paper |
On the Exact Complexity of String Matching: Lower Bounds
SIAM Journal on Computing | 1992-06-27 | Paper |
scientific article; zbMATH DE number 4126696 (Why is no real title available?)
| 1990-01-01 | Paper |
Speeding up dynamic programming with applications to molecular biology
Theoretical Computer Science | 1989-01-01 | Paper |
Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa
IEEE Transactions on Circuits and Systems | 1988-01-01 | Paper |
Data structures and algorithms for approximate string matching
Journal of Complexity | 1988-01-01 | Paper |
Optimal parallel parsing of bracket languages
Theoretical Computer Science | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4041248 (Why is no real title available?)
| 1987-01-01 | Paper |
Parallel string matching with k mismatches
Theoretical Computer Science | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4022660 (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 |
Bounds on the redundancy of Huffman codes (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3984596 (Why is no real title available?)
| 1985-01-01 | Paper |
