Katharina T. Huber

Andreas Spillner

J. Graph Algorithms Appl., 2023

Shared ancestry graphs and symbolic arboreal maps.

[BibT_eX]

[DOI]

CoRR, 2023

Encoding and ordering <i>X</i>-cactuses.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2023

2022

Overlaid species forests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Level-2 networks from shortest and longest distances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Optimal realizations and the block decomposition of a finite metric space.

[BibT_eX]

[DOI]

Andreas Spillner

Discret. Appl. Math., 2021

Invited Talks.

[BibT_eX]

[DOI]

Henning Fernau

Joseph (Seffi) Naor

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes.

[BibT_eX]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Recognizing and realizing cactus metrics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Weakly displaying trees in temporal tree-child network.

[BibT_eX]

[DOI]

Simone Linz

Miguel Sautie Castellanos

CoRR, 2020

Evolution through segmental duplications and losses: a Super-Reconciliation approach.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

Phylogenetic networks that are their own fold-ups.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

2019

The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The polytopal structure of the tight-span of a totally split-decomposable metric.

[BibT_eX]

[DOI]

Jack H. Koolen

Discret. Math., 2019

Rooting for phylogenetic networks.

[BibT_eX]

[DOI]

CoRR, 2019

Hierarchies from Lowest Stable Ancestors in Nonbinary Phylogenetic Networks.

[BibT_eX]

[DOI]

Taoyang Wu

J. Classif., 2019

Three-Way Symbolic Tree-Maps and Ultrametrics.

[BibT_eX]

[DOI]

J. Classif., 2019

2018

Geometric medians in reconciliation spaces of phylogenetic trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Beyond Representing Orthology Relations by Trees.

[BibT_eX]

[DOI]

Miguel Sautie Castellanos

Algorithmica, 2018

Combinatorial properties of triplet covers for binary trees.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

Reconstructing the History of Syntenies Through Super-Reconciliation.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 16th International Conference, 2018

2017

Recovering tree-child networks from shortest inter-taxa distance information.

[BibT_eX]

[DOI]

CoRR, 2017

Quarnet inference rules for level-1 networks.

[BibT_eX]

[DOI]

CoRR, 2017

Tree-based unrooted phylogenetic networks.

[BibT_eX]

[DOI]

Andrew R. Francis

CoRR, 2017

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Characterizing block graphs in terms of their vertex-induced partitions.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

2015

Distinguished Minimal Topological Lassos.

[BibT_eX]

[DOI]

George Kettleborough

SIAM J. Discret. Math., 2015

PSIKO2: a fast and versatile tool to infer population stratification on various levels in GWAS.

[BibT_eX]

[DOI]

Andrei-Alin Popescu

Bioinform., 2015

2014

Representing Partitions on Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

A matroid associated with a phylogenetic tree.

[BibT_eX]

[DOI]

Mike A. Steel

Discret. Math. Theor. Comput. Sci., 2014

Tree Reconstruction from Triplet Cover Distances.

[BibT_eX]

[DOI]

Mike A. Steel

Electron. J. Comb., 2014

2013

Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets.

[BibT_eX]

[DOI]

Maribel Hernandez-Rosales

Algorithmica, 2013

2012

Recognizing Treelike k-Dissimilarities.

[BibT_eX]

[DOI]

J. Classif., 2012

From event-labeled gene trees to species trees.

[BibT_eX]

[DOI]

BMC Bioinform., 2012

ape 3.0: New tools for distance-based phylogenetics and evolutionary analysis in R.

[BibT_eX]

[DOI]

Andrei-Alin Popescu

Emmanuel Paradis

Bioinform., 2012

Computing a Consensus of Multilabeled Trees.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Basic Phylogenetic Combinatorics.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-76832-0, 2012

2011

Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Blocks and Cut Vertices of the Buneman Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers

[BibT_eX]

[DOI]

Michael Anthony Steel

CoRR, 2011

2010

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

An Algorithm for Computing Cutpoints in Finite Metric Spaces.

[BibT_eX]

[DOI]

J. Classif., 2010

2009

Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

PADRE: a package for analyzing and displaying reticulate evolution.

[BibT_eX]

[DOI]

Bioinform., 2009

A graph-theoretical invariant of topological spaces.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Characterizing weak compatibility in terms of weighted quartets.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2008

The Complexity of Deriving Multi-Labeled Trees from Bipartitions.

[BibT_eX]

[DOI]

J. Comput. Biol., 2008

Compatible decompositions and block realizations of finite metrics.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Counting vertices and cubes in median graphs of circular split systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Characterizing Cell-Decomposable Metrics.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Block realizations of finite metrics and the tight-span construction I: The embedding theorem.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

Cut points in metric spaces.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

2007

An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

Phylogenetic networks.

[BibT_eX]

Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006

On the structure of the tight-span of a totally split-decomposable metric.

[BibT_eX]

[DOI]

Jacobus H. Koolen

Eur. J. Comb., 2006

Imputing Supertrees and Supernetworks from Quartets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005

Four Characters Suffice to Convexly Define a Phylogenetic Tree.

[BibT_eX]

[DOI]

Michael Anthony Steel

SIAM J. Discret. Math., 2005

The tight span of an antipodal metric space - Part I: : Combinatorial properties.

[BibT_eX]

[DOI]

Jacobus H. Koolen

Discret. Math., 2005

Identifying phylogenetic trees.

[BibT_eX]

[DOI]

Magnus Bordewich

Charles Semple

Discret. Math., 2005

Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Recovering a phylogenetic tree using pairwise closure operations.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2005

2004

Recovering trees from well-separated multi-state characters.

[BibT_eX]

[DOI]

Discret. Math., 2004

The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties.

[BibT_eX]

[DOI]

Jacobus H. Koolen

Discret. Comput. Geom., 2004

Replacing cliques by stars in quasi-median graphs.

[BibT_eX]

[DOI]

Charles Semple

Discret. Appl. Math., 2004

2003

Connectivity calculus.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2003

2002

Antipodal Metrics and Split Systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

The relation graph.

[BibT_eX]

[DOI]

Discret. Math., 2002

Quasi-median graphs from sets of partitions.

[BibT_eX]

[DOI]

Hans-Jürgen Bandelt

Discret. Appl. Math., 2002

2001

Six Points Suffice: How to Check for Metric Consistency.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

2000

Affine Maps That Induce Polyhedral Complex Isomorphisms.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

1999

Some new perspectives regarding sparse continuous models for discrete data structures.

[BibT_eX]

[DOI]