| Publication | Date of Publication | Type |
|---|
| Some notes on the nearest neighbour interchange distance | 2024-01-29 | Paper |
| Small weight bases for hamming codes | 2023-12-12 | Paper |
| The \(K\)-Robinson Foulds measures for labeled trees | 2023-12-12 | Paper |
| The tree-child network problem for line trees and the shortest common supersequences for permutations | 2023-07-10 | Paper |
| Routing on trees via matchings | 2022-12-16 | Paper |
| Two results about the Sackin and Colless indices for phylogenetic trees and their shapes | 2022-12-08 | Paper |
| The Sackin index of simplex networks | 2022-08-11 | Paper |
| Asymptotic enumeration and distributional properties of galled networks | 2022-04-01 | Paper |
| On the asymptotic growth of the number of tree-child networks | 2021-02-08 | Paper |
| Counting and enumerating tree-child networks and their subclasses | 2020-09-07 | Paper |
| Recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks | 2020-07-22 | Paper |
| Counting and enumerating galled networks | 2020-06-29 | Paper |
| Generating Normal Networks via Leaf Insertion and Nearest Neighbor Interchange | 2019-06-28 | Paper |
| A PTAS for the \(k\)-consensus structures problem under squared Euclidean distance | 2018-08-20 | Paper |
| Solving the tree containment problem in linear time for nearly stable phylogenetic networks | 2018-06-27 | Paper |
| Reconciliation With Nonbinary Gene Trees Revisited | 2018-05-17 | Paper |
| Online buffer management for transmitting packets with processing cycles | 2018-04-04 | Paper |
| A decomposition theorem and two algorithms for reticulation-visible networks | 2016-12-22 | Paper |
| Locating a Tree in a Phylogenetic Network in Quadratic Time | 2016-06-22 | Paper |
| Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time | 2016-04-04 | Paper |
| Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction | 2015-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501820 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501822 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934650 | 2014-12-18 | Paper |
| A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree | 2013-12-10 | Paper |
| APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM | 2013-06-06 | Paper |
| Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees | 2010-12-15 | Paper |
| Superiority and complexity of the spaced seeds | 2010-08-16 | Paper |
| Approximating the Spanning k-Tree Forest Problem | 2009-07-14 | Paper |
| Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment | 2009-06-22 | Paper |
| Sequence comparison. Theory and methods | 2008-10-02 | Paper |
| A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457044 | 2008-04-14 | Paper |
| Algorithmic and complexity issues of three clustering methods in microarray data analysis | 2007-10-10 | Paper |
| The consecutive ones submatrix problem for sparse matrices | 2007-08-20 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Sensitivity analysis and efficient method for identifying optimal spaced seeds | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474131 | 2004-08-04 | Paper |
| Distinguishing string selection problems. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410119 | 2003-07-02 | Paper |
| From Gene Trees to Species Trees | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247446 | 2000-04-17 | Paper |
| SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS | 2000-01-01 | Paper |
| Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions | 1999-11-23 | Paper |
| Fitting distances by tree metrics with increment error | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252342 | 1999-09-15 | Paper |
| Optimal Bounds for Matching Routing on Trees | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218410 | 1999-02-14 | Paper |
| Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis | 1998-08-13 | Paper |
| Small weight bases for Hamming codes | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348040 | 1998-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347991 | 1997-11-09 | Paper |
| On the approximation of longest common nonsupersequences and shortest common nonsubsequences | 1997-02-28 | Paper |
| On the descriptive power of special Thue systems | 1997-01-14 | Paper |
| Applying rewriting methods to special monoids | 1994-03-10 | Paper |
| On weakly confluent monadic string-rewriting systems | 1994-01-09 | Paper |
| ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER | 1993-06-01 | Paper |
| The pre-NTS property is undecidable for context-free grammars | 1993-05-16 | Paper |
| Some properties of finite special string-rewriting systems | 1993-01-17 | Paper |
| A Short Proof of a Theorem of Adjan | 1993-01-17 | Paper |
| Conjugacy in special monoids | 1992-06-26 | Paper |
| Decision problems for finite special string-rewriting systems that are confluent on some congruence class | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358947 | 1990-01-01 | Paper |
| An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group | 1989-01-01 | Paper |
| Rational strong codes and structure of rational group languages | 1987-01-01 | Paper |
| A characterization of rational star languages generated by strong codes | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030263 | 1987-01-01 | Paper |
