| Publication | Date of Publication | Type |
|---|
| Finding the cyclic covers of a string | 2023-11-24 | Paper |
| Computing the unrooted maximum agreement subtree in sub-quadratic time | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002740 | 2021-07-28 | Paper |
| Computing the rooted triplet distance between phylogenetic networks | 2021-06-11 | Paper |
| Efficient Identification of k-Closed Strings | 2021-04-19 | Paper |
| A linear time algorithm for the \(r\)-gathering problem on the line | 2021-04-14 | Paper |
| Computing the rooted triplet distance between phylogenetic networks | 2020-02-25 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2020-02-20 | Paper |
| A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract) | 2019-10-15 | Paper |
| Greedy consensus tree and maximum greedy consensus tree problems | 2019-10-15 | Paper |
| Off-line and on-line algorithms for closed string factorization | 2019-10-07 | Paper |
| Improved Algorithms for Constructing Consensus Trees | 2019-05-15 | Paper |
| Improved Algorithms for Constructing Consensus Trees | 2018-08-02 | Paper |
| Computing asymmetric median tree of two trees via better bipartite matching algorithm | 2018-06-15 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2018-03-26 | Paper |
| Determining the consistency of resolved triplets and fan triplets | 2018-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608616 | 2018-03-21 | Paper |
| On finding the Adams consensus tree | 2017-09-28 | Paper |
| An efficient algorithm for the rooted triplet distance between galled trees | 2017-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955018 | 2017-01-24 | Paper |
| Faster algorithms for computing the R* consensus tree | 2016-12-21 | Paper |
| Faster Algorithms for Computing the R* Consensus Tree | 2015-09-11 | Paper |
| Linked dynamic tries with applications to LZ-compression in sublinear time and space | 2015-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934640 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921689 | 2014-10-13 | Paper |
| Partial convex recolorings of trees and galled networks | 2014-09-09 | Paper |
| Fast relative Lempel-Ziv self-index for similar sequences | 2014-04-15 | Paper |
| Compressed directed acyclic word graph with application in local alignment | 2013-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2845521 | 2013-08-30 | Paper |
| CRAM: Compressed Random Access Memory | 2013-08-12 | Paper |
| Constructing the R* consensus tree of two trees in subcubic time | 2013-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910733 | 2013-03-19 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Fast Relative Lempel-Ziv Self-index for Similar Sequences | 2012-07-16 | Paper |
| Ultra-succinct representation of ordered trees with applications | 2012-05-11 | Paper |
| A linear size index for approximate pattern matching | 2012-01-04 | Paper |
| Algorithms for Building Consensus MUL-trees | 2011-12-16 | Paper |
| Succinct data structures for searchable partial sums with optimal worst-case performance | 2011-10-10 | Paper |
| On All-Substrings Alignment Problems | 2011-03-18 | Paper |
| Improved algorithms for maximum agreement and compatible supertrees | 2011-03-02 | Paper |
| Compressed indexes for approximate string matching | 2010-09-16 | Paper |
| Constructing the R* Consensus Tree of Two Trees in Subcubic Time | 2010-09-06 | Paper |
| Indexing Similar DNA Sequences | 2010-07-20 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Breaking a Time-and-Space Barrier in Constructing Full-Text Indices | 2010-01-06 | Paper |
| Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets | 2009-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3183513 | 2009-10-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Non-shared edges and nearest neighbor interchanges revisited | 2009-07-21 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| An Experimental Study of Compressed Indexing and Local Alignments of DNA | 2009-03-03 | Paper |
| Non-overlapping common substrings allowing mutations | 2008-09-08 | Paper |
| Improved approximate string matching using compressed suffix data structures | 2008-07-01 | Paper |
| Space Efficient Indexes for String Matching with Don’t Cares | 2008-05-27 | Paper |
| Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space | 2008-04-24 | Paper |
| Compressed Indexes for Approximate String Matching | 2008-03-11 | Paper |
| A Linear Size Index for Approximate Pattern Matching | 2007-09-14 | Paper |
| A space and time efficient algorithm for constructing compressed suffix arrays | 2007-07-19 | Paper |
| Fast algorithms for computing the tripartition-based distance between phylogenetic networks | 2007-07-19 | Paper |
| Inferring a level-1 phylogenetic network from a dense set of rooted triplets | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment | 2006-11-06 | Paper |
| Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network | 2006-06-01 | Paper |
| Approximate string matching using compressed suffix arrays | 2006-03-24 | Paper |
| Rooted maximum agreement supertrees | 2006-03-21 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing the maximum agreement of phylogenetic networks | 2005-06-10 | Paper |
| SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808661 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472521 | 2004-08-04 | Paper |
| The enhanced double digest problem for DNA physical mapping | 2003-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410152 | 2003-07-02 | Paper |
| An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings | 2002-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721996 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723946 | 2001-07-08 | Paper |
| A Decomposition Theorem for Maximum Weight Bipartite Matchings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526970 | 2001-02-28 | Paper |
| Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953351 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938785 | 2000-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370211 | 1998-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129918 | 1997-04-22 | Paper |
