The following pages link to Katharina T. Huber (Q307585):
Displayed 50 items.
- Item:Q307585 (redirect page) (← links)
- An algorithm for computing cutpoints in finite metric spaces (Q263276) (← links)
- Recognizing treelike \(k\)-dissimilarities (Q263358) (← links)
- Transforming phylogenetic networks: moving beyond tree space (Q307586) (← links)
- Folding and unfolding phylogenetic trees and networks (Q338372) (← links)
- Lassoing and corralling rooted phylogenetic trees (Q376433) (← links)
- Tree reconstruction from triplet cover distances (Q405205) (← links)
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers (Q455729) (← links)
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- Recovering normal networks from shortest inter-taxa distance information (Q667692) (← links)
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex (Q696831) (← links)
- On the structure of the tight-span of a totally split-decomposable metric (Q820090) (← links)
- Block realizations of finite metrics and the tight-span construction. I: The embedding theorem (Q847398) (← links)
- Some uses of the Farris transform in mathematics and phylogenetics -- A review (Q880922) (← links)
- Cut points in metric spaces (Q926762) (← links)
- Encoding phylogenetic trees in terms of weighted quartets (Q938146) (← links)
- Compatible decompositions and block realizations of finite metrics (Q942132) (← links)
- Characterizing cell-decomposable metrics (Q1010659) (← links)
- Characterizing weak compatibility in terms of weighted quartets (Q1012157) (← links)
- A graph-theoretical invariant of topological spaces (Q1027486) (← links)
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction (Q1293419) (← links)
- On the number of vertices and edges of the Buneman graph (Q1293464) (← links)
- Some variations on a theme by Buneman (Q1293465) (← links)
- Antipodal metrics and split systems (Q1348745) (← links)
- The relation graph (Q1349084) (← links)
- Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (Q1400780) (← links)
- Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (Q1400781) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← links)
- Connectivity calculus (Q1431949) (← links)
- Affine maps that induce polyhedral complex isomorphisms (Q1577547) (← links)
- Quasi-median graphs from sets of partitions (Q1613411) (← links)
- Combinatorial properties of triplet covers for binary trees (Q1637594) (← links)
- Minimum triplet covers of binary phylogenetic \(X\)-trees (Q1679026) (← links)
- Beyond representing orthology relations by trees (Q1702121) (← links)
- The polytopal structure of the tight-span of a totally split-decomposable metric (Q1712535) (← links)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
- Bounds for phylogenetic network space metrics (Q1741907) (← links)
- Tree-based unrooted phylogenetic networks (Q1742650) (← links)
- Geometric medians in reconciliation spaces of phylogenetic trees (Q1751430) (← links)
- Quarnet inference rules for level-1 networks (Q1786927) (← links)
- Replacing cliques by stars in quasi-median graphs (Q1887054) (← links)
- The tight span of an antipodal metric space. II: Geometrical properties (Q1889915) (← links)
- Orthology relations, symbolic ultrametrics, and cographs (Q1937881) (← links)
- An exceptional split geometry (Q1977728) (← links)
- Optimal realizations and the block decomposition of a finite metric space (Q2043363) (← links)
- Overlaid species forests (Q2065769) (← links)
- Encoding and ordering \(X\)-cactuses (Q2081908) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)