| Publication | Date of Publication | Type |
|---|
On the computation of longest previous non-overlapping factors
| 2024-04-19 | Paper |
On the optimisation of the GSACA suffix array construction algorithm
String Processing and Information Retrieval | 2023-08-04 | Paper |
Trickier XBWT tricks
String Processing and Information Retrieval | 2023-07-28 | Paper |
Combinations of simplifying conditional term rewriting systems
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
Edge minimization in de Bruijn graphs
Information and Computation | 2022-06-08 | Paper |
Fast and Lightweight LCP-Array Construction Algorithms
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Space-efficient parallel construction of succinct representations of suffix tree topologies
ACM Journal of Experimental Algorithmics | 2017-07-03 | Paper |
Alphabet-independent algorithms for finding context-sensitive repeats in linear time
Journal of Discrete Algorithms | 2015-08-24 | Paper |
Efficient construction of a compressed de Bruijn graph for pan-genome analysis
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Compressed suffix trees, efficient computation and storage of LCP-values
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Computing the Burrows-Wheeler transform of a string and its reverse in parallel
Journal of Discrete Algorithms | 2014-04-01 | Paper |
Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
| 2014-02-25 | Paper |
Conditional term graph rewriting with indirect sharing
| 2013-08-27 | Paper |
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Computing the Burrows-Wheeler Transform of a String and Its Reverse
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Information and Computation | 2012-05-24 | Paper |
Lempel-Ziv Factorization Revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
Information Processing Letters | 2010-09-02 | Paper |
Bidirectional search in a string with wavelet trees
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Multiple genome alignment: chaining algorithms revisited
Combinatorial Pattern Matching | 2010-04-06 | Paper |
A Compressed Enhanced Suffix Array Supporting Fast String Matching
String Processing and Information Retrieval | 2009-09-29 | Paper |
A linear time algorithm for the inversion median problem in circular bacterial genomes
Journal of Discrete Algorithms | 2008-05-29 | Paper |
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Chaining algorithms for multiple genome comparison
Journal of Discrete Algorithms | 2005-10-27 | Paper |
scientific article; zbMATH DE number 1995150 (Why is no real title available?)
| 2003-10-22 | Paper |
scientific article; zbMATH DE number 1995131 (Why is no real title available?)
| 2003-10-21 | Paper |
scientific article; zbMATH DE number 1945184 (Why is no real title available?)
| 2003-07-02 | Paper |
Hierarchical termination revisited.
Information Processing Letters | 2003-01-21 | Paper |
Relative undecidability in term rewriting. I: The termination hierarchy
Information and Computation | 2003-01-14 | Paper |
Relative undecidability in term rewriting. II: The confluence hierarchy
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1696594 (Why is no real title available?)
| 2002-07-09 | Paper |
scientific article; zbMATH DE number 1729952 (Why is no real title available?)
| 2002-04-16 | Paper |
Pushing the frontiers of combining rewrite systems farther outwards
| 2002-04-03 | Paper |
Implementing conditional term rewriting by graph rewriting
Theoretical Computer Science | 2002-03-03 | Paper |
Termination of logic programs: Transformational methods revisited
Applicable Algebra in Engineering, Communication and Computing | 2001-08-26 | Paper |
scientific article; zbMATH DE number 1615245 (Why is no real title available?)
| 2001-07-08 | Paper |
A uniform framework for term and graph rewriting applied to combined systems
Information Processing Letters | 2000-10-26 | Paper |
scientific article; zbMATH DE number 1508936 (Why is no real title available?)
| 2000-09-18 | Paper |
scientific article; zbMATH DE number 1456966 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 1405447 (Why is no real title available?)
| 2000-02-23 | Paper |
scientific article; zbMATH DE number 1236372 (Why is no real title available?)
| 1999-03-11 | Paper |
On the equivalence problem for E-pattern languages
Theoretical Computer Science | 1998-06-30 | Paper |
scientific article; zbMATH DE number 1086665 (Why is no real title available?)
| 1998-04-01 | Paper |
scientific article; zbMATH DE number 1088027 (Why is no real title available?)
| 1997-11-17 | Paper |
Termination is not modular for confluent variable-preserving term rewriting systems
Information Processing Letters | 1997-02-28 | Paper |
On the modularity of termination of term rewriting systems
Theoretical Computer Science | 1997-02-27 | Paper |
Modular properties of composable term rewriting systems
Journal of Symbolic Computation | 1996-04-28 | Paper |
scientific article; zbMATH DE number 8328 (Why is no real title available?)
| 1992-06-25 | Paper |
