| Publication | Date of Publication | Type |
|---|
| Exact counts of binary phylogenetic networks with two and three reticulation events (extended abstract) | 2026-02-26 | Paper |
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings
Journal of Computer and System Sciences | 2024-07-01 | Paper |
Some notes on the nearest neighbour interchange distance
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Small weight bases for hamming codes
Lecture Notes in Computer Science | 2023-12-12 | Paper |
The \(K\)-Robinson Foulds measures for labeled trees
Comparative Genomics | 2023-12-12 | Paper |
| The tree-child network problem for line trees and the shortest common supersequences for permutations | 2023-07-10 | Paper |
| The Bourque distances for mutation trees of cancers | 2023-02-07 | Paper |
Routing on trees via matchings
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Two results about the Sackin and Colless indices for phylogenetic trees and their shapes
Journal of Mathematical Biology | 2022-12-08 | Paper |
The Sackin index of simplex networks
(available as arXiv preprint) | 2022-08-11 | Paper |
Asymptotic enumeration and distributional properties of galled networks
Journal of Combinatorial Theory. Series A | 2022-04-01 | Paper |
On the asymptotic growth of the number of tree-child networks
European Journal of Combinatorics | 2021-02-08 | Paper |
Counting and enumerating tree-child networks and their subclasses
Journal of Computer and System Sciences | 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
Discrete Applied Mathematics | 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
Algorithms | 2018-08-20 | Paper |
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
Discrete Applied Mathematics | 2018-06-27 | Paper |
Reconciliation with nonbinary gene trees revisited
Journal of the ACM | 2018-05-17 | Paper |
Online buffer management for transmitting packets with processing cycles
Theoretical Computer Science | 2018-04-04 | Paper |
A decomposition theorem and two algorithms for reticulation-visible networks
Information and Computation | 2016-12-22 | Paper |
Locating a tree in a phylogenetic network in quadratic time
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Solving the tree containment problem for genetically stable networks in quadratic time
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
| scientific article; zbMATH DE number 6472618 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472620 (Why is no real title available?) | 2015-08-14 | Paper |
| Approximating the spanning star forest problem and its applications to genomic sequence alignment | 2014-12-18 | Paper |
A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Approximating the spanning \(k\)-tree forest problem
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees
Bulletin of Mathematical Biology | 2010-12-15 | Paper |
Superiority and complexity of the spaced seeds
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximating the Spanning k-Tree Forest Problem
Frontiers in Algorithmics | 2009-07-14 | Paper |
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
SIAM Journal on Computing | 2009-06-22 | Paper |
Sequence comparison. Theory and methods
Computational Biology | 2008-10-02 | Paper |
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance
Frontiers in Algorithmics | 2008-06-19 | Paper |
| On computing the nearest neighbor interchange distance | 2008-04-14 | Paper |
Algorithmic and complexity issues of three clustering methods in microarray data analysis
Algorithmica | 2007-10-10 | Paper |
The consecutive ones submatrix problem for sparse matrices
Algorithmica | 2007-08-20 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Sensitivity analysis and efficient method for identifying optimal spaced seeds
Journal of Computer and System Sciences | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2081029 (Why is no real title available?) | 2004-08-04 | Paper |
Distinguishing string selection problems.
Information and Computation | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1945157 (Why is no real title available?) | 2003-07-02 | Paper |
From Gene Trees to Species Trees
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1302179 (Why is no real title available?) | 2000-04-17 | Paper |
SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS
International Journal of Foundations of Computer Science | 2000-01-01 | Paper |
Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
Journal of Algorithms | 1999-11-23 | Paper |
Fitting distances by tree metrics with increment error
Journal of Combinatorial Optimization | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1305456 (Why is no real title available?) | 1999-09-15 | Paper |
Optimal Bounds for Matching Routing on Trees
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1222822 (Why is no real title available?) | 1999-02-14 | Paper |
Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis
Theoretical Computer Science | 1998-08-13 | Paper |
Small weight bases for Hamming codes
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1047959 (Why is no real title available?) | 1998-02-22 | Paper |
| scientific article; zbMATH DE number 1047912 (Why is no real title available?) | 1997-11-09 | Paper |
On the approximation of longest common nonsupersequences and shortest common nonsubsequences
Theoretical Computer Science | 1997-02-28 | Paper |
On the descriptive power of special Thue systems
Discrete Mathematics | 1997-01-14 | Paper |
Applying rewriting methods to special monoids
Mathematical Proceedings of the Cambridge Philosophical Society | 1994-03-10 | Paper |
On weakly confluent monadic string-rewriting systems
Theoretical Computer Science | 1994-01-09 | Paper |
ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
International Journal of Algebra and Computation | 1993-06-01 | Paper |
The pre-NTS property is undecidable for context-free grammars
Information Processing Letters | 1993-05-16 | Paper |
Some properties of finite special string-rewriting systems
Journal of Symbolic Computation | 1993-01-17 | Paper |
| A Short Proof of a Theorem of Adjan | 1993-01-17 | Paper |
Conjugacy in special monoids
Journal of Algebra | 1992-06-26 | Paper |
Decision problems for finite special string-rewriting systems that are confluent on some congruence class
Acta Informatica | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4210423 (Why is no real title available?) | 1990-01-01 | Paper |
An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group
Theoretical Computer Science | 1989-01-01 | Paper |
Rational strong codes and structure of rational group languages
Semigroup Forum | 1987-01-01 | Paper |
A characterization of rational star languages generated by strong codes
Semigroup Forum | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4018405 (Why is no real title available?) | 1987-01-01 | Paper |
