scientific article; zbMATH DE number 1865935
From MaRDI portal
Publication:4792088
zbMath1043.92026MaRDI QIDQ4792088
Publication date: 10 February 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Taxonomy, cladistics, statistics in mathematical biology (92B10)
Related Items
Compatibility of unrooted phylogenetic trees is FPT, Approximating common fixed points of a family of non-self mappings in CAT(0) spaces, Reticulation-visible networks, Families of multiweights and pseudostars, Kernelizations for the hybridization number problem on multiple nonbinary trees, Matrix group structure and Markov invariants in the strand symmetric phylogenetic substitution model, Determining phylogenetic networks from inter-taxa distances, On joint subtree distributions under two evolutionary models, The space of ultrametric phylogenetic trees, Some axiomatic limitations for consensus and supertree functions on hierarchies, Characterizing local optima for maximum parsimony, Markovian log-supermodularity, and its applications in phylogenetics, An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances, A Hall-type theorem for triplet set systems based on medians in trees, A branch-price-and-cut algorithm for the minimum evolution problem, Phylogenetic invariants for \(\mathbb{Z}_3\) scheme-theoretically, Weighted graphs with distances in given ranges, Folding and unfolding phylogenetic trees and networks, On the variational distance of two trees, Common fixed points for some generalized multivalued nonexpansive mappings in uniformly convex metric spaces, Learning loopy graphical models with latent variables: efficient methods and guarantees, Employing common limit range property to prove unified metrical common fixed point theorems, Using the tangle: A consistent construction of phylogenetic distance matrices for quartets, A minimax inequality and its applications to fixed point theorems in CAT(0) spaces, Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies, Lassoing and corralling rooted phylogenetic trees, Computing the minimum number of hybridization events for a consistent evolutionary history, Reconstruction of certain phylogenetic networks from their tree-average distances, Majority-rule (+) consensus trees, Optimizing tree and character compatibility across several phylogenetic trees, R-LINE: a better randomized 2-server algorithm on the line, Tree reconstruction from triplet cover distances, Tree cumulants and the geometry of binary tree models, Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique, Strong convergence of modified Halpern iterations in \(\mathrm{CAT}(0)\) spaces, Common fixed points for asymptotic pointwise nonexpansive mappings in metric and Banach spaces, Tree-representation of set families and applications to combinatorial decompositions, Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees, Graph triangulations and the compatibility of unrooted phylogenetic trees, Constructing circular phylogenetic networks from weighted quartets using simulated annealing, Edge contractions in subclasses of chordal graphs, Modeling the evolution space of breakage fusion bridge cycles with a stochastic folding process, The split decomposition of a \(k\)-dissimilarity map, An algebraic analysis of the two state Markov model on tripod trees, Trees, tight-spans and point configurations, `Bureaucratic' set systems, and their role in phylogenetics, A simple characterization of the minimal obstruction sets for three-state perfect phylogenies, Bounding the maximum size of a minimal definitive set of quartets, Comparing and aggregating partially resolved trees, Tree metrics and edge-disjoint \(S\)-paths, Enhanced negative type for finite metric trees, Slim sets of binary trees, Improved approximation algorithm for convex recoloring of trees, Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable, Split decomposition over an Abelian group. I: Generalities, Convex recolorings of strings and trees: Definitions, hardness results and algorithms, A regular decomposition of the edge-product space of phylogenetic trees, Parsimonious cluster systems, The link between segregation and phylogenetic diversity, Geometry of phylogenetic group-based models, Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs, Reconstructing a phylogenetic level-1 network from quartets, Birth-death models and coalescent point processes: the shape and probability of reconstructed phylogenies, Encoding phylogenetic trees in terms of weighted quartets, On the information content of discrete phylogenetic characters, Recovering normal networks from shortest inter-taxa distance information, The combinatorics of tandem duplication, On the fixed parameter tractability of agreement-based phylogenetic distances, Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree, Comparing and simplifying distinct-cluster phylogenetic networks, A characterization of dissimilarity families of trees, Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets, Phase transition in the sample complexity of likelihood-based phylogeny inference, Size of a phylogenetic network, Discriminative measures for comparison of phylogenetic trees, Phylogenetic mixtures and linear invariants for equal input models, Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions, Robustness analysis of leader-follower consensus for multi-agent systems characterized by double integrators, The sum of the distances between the leaves of a tree and the `semi-regular' property, Experiments with the site frequency spectrum, The neighbor-net algorithm, Peeling phylogenetic `oranges', Building species trees from larger parts of phylogenomic databases, A generalization of Suzuki's Lemma, On the maximum size of minimal definitive quartet sets, Computing nearest neighbour interchange distances between ranked phylogenetic trees, The combinatorics of discrete time-trees: theory and open problems, Discrete coalescent trees, Global alignment of molecular sequences via ancestral state reconstruction, Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture, Fast compatibility testing for rooted phylogenetic trees, A note on convex characters, Fibonacci numbers and exponential-time algorithms, Phylogenetic diversity and the maximum coverage problem, There are no caterpillars in a wicked forest, The Buneman index via polyhedral split decomposition, Lie geometry of \(2\times 2\) Markov matrices, Phylogenetic networks with every embedded phylogenetic tree a base tree, On the maximum parsimony distance between phylogenetic trees, Rayleigh processes, real trees, and root growth with re-grafting, Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices, A basic limitation on inferring phylogenies by pairwise sequence comparisons, Markov invariants and the isotropy subgroup of a quartet tree, Phylogenetic information complexity: is testing a tree easier than finding it?, Counting consistent phylogenetic trees is \#P-complete, Cyclic permutations and evolutionary trees, Peripheral Wiener index of trees and related questions, Replacing cliques by stars in quasi-median graphs, An algorithm for finding a representation of a subtree distance, Robust reconstruction on trees is determined by the second eigenvalue., Treewidth distance on phylogenetic trees, Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem, Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees, Reconstructing unrooted phylogenetic trees from symbolic ternary metrics, Reconstruction of LGT networks from tri-LGT-nets, Phylogenetic mixtures: concentration of measure in the large-tree limit, Orthology relations, symbolic ultrametrics, and cographs, Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model, Generating Markov evolutionary matrices for a given branch length, Urysohn integral equations approach by common fixed points in complex-valued metric spaces, Ancestral sequence reconstruction with maximum parsimony, Walks in phylogenetic treespace, The quadratic M-convexity testing problem, Beyond representing orthology relations by trees, Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis, On the complexity of computing the temporal hybridization number for two phylogenies, UPGMA and the normalized equidistant minimum evolution problem, Fast phylogeny reconstruction through learning of ancestral sequences, Split probabilities and species tree inference under the multispecies coalescent model, Implicit inequality constraints in a binary tree model, Phylogenetic complexity of the Kimura 3-parameter model, The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics, Identifying a species tree subject to random lateral gene transfer, Estimating trees from filtered data: identifiability of models for morphological phylogenetics, PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion, The Shapley value of phylogenetic trees, Lie-Markov models derived from finite semigroups, Identifiability and reconstructibility of species phylogenies under a modified coalescent, Identifiability of phylogenetic parameters from \(k\)-mer data under the coalescent, Identifying species network features from gene tree quartets under the coalescent model, Phylogenetic flexibility via Hall-type inequalities and submodularity, On the Shapley value of unrooted phylogenetic trees, Ishikawa iterative process for hemicontractive multi-valued non-self mappings in CAT(0) spaces, Note on extremal graphs with given matching number, Compatible decompositions and block realizations of finite metrics, New analytic results for speciation times in neutral models, Mixed-up trees: the structure of phylogenetic mixtures, Deciding the existence of a cherry-picking sequence is hard on two trees, The matroid structure of representative triple sets and triple-closure computation, New Gromov-inspired metrics on phylogenetic tree space, Trees within trees: simple nested coalescents, Inferring phylogenetic trees from the knowledge of rare evolutionary events, On compatibility and incompatibility of collections of unrooted phylogenetic trees, Analysis of comparative data with hierarchical autocorrelation, On unrooted and root-uncertain variants of several well-known phylogenetic network problems, Reconstructing trees from subtree weights., Two further links between MP and ML under the Poisson model., Dimensional reduction for the general Markov model on phylogenetic trees, Reconstructing pedigrees using probabilistic analysis of ISSR amplification, The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations, Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination, Exact leaf powers, Exchangeable hierarchies and mass-structure of weighted real trees, Probability distributions of ancestries and genealogical distances on stochastically generated rooted binary trees, Lie Markov models, Determining species tree topologies from clade probabilities under the coalescent, Quarnet inference rules for level-1 networks, Reconstructing gene trees from Fitch's xenology relation, Extremal values of the Sackin tree balance index, On the comparison of incompatibility of split systems across different numbers of taxa, Evolutionarily distinctive species often capture more phylogenetic diversity than expected, Markov invariants, plethysms, and phylogenetics, The conditioned reconstructed process, Gibbs fragmentation trees, Quasi-median hulls in Hamming space are Steiner hulls, Sequence length bounds for resolving a deep phylogenetic divergence, Quasisymmetric mappings in b-metric spaces, Fixed point results for multimaps in CAT(0) spaces, On the approximability of the fixed-tree balanced minimum evolution problem, Characterizing weak compatibility in terms of weighted quartets, On fuzzy fixed-point results in complex valued extended \(b\)-metric spaces with application, A 3-approximation algorithm for the subtree distance between phylogenies, Why neighbor-joining works, Best match graphs with binary trees, On quasisymmetric mappings between ultrametric spaces, Consistency of the QNet algorithm for generating planar split networks from weighted quartets, Split decomposition over an Abelian group. II: Group-valued split systems with weakly compatible support, Overlaid species forests, Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties, Reflections on kernelizing and computing unrooted agreement forests, Algebraic geometry of Gaussian Bayesian networks, From modular decomposition trees to rooted median graphs, Simplicial powers of graphs, The edge-product space of phylogenetic trees is not shellable, A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers, Encoding and ordering \(X\)-cactuses, Characterizing phylogenetically decisive taxon coverage, EmbAssi: embedding assignment costs for similarity search in large graph databases, Identifiability of local and global features of phylogenetic networks from average distances, The tree of blobs of a species network: identifiability under the coalescent, Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods, Strong convergence of modified Ishikawa iterative-type algorithm in CAT(0) spaces, Circular Networks from Distorted Metrics, A new efficient algorithm for finding common fixed points of multivalued demicontractive mappings and solutions of split generalized equilibrium problems in Hilbert spaces, Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree, Bounds on the Expected Size of the Maximum Agreement Subtree, Do tree split probabilities determine the branch lengths?, Axiomatic characterization of transit functions of hierarchies, Dispersal routes reconstruction and the minimum cost arborescence problem, Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts, Leaf-induced subtrees of leaf-Fibonacci trees, Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations, Efficient approximation of convex recolorings, Information geometry for phylogenetic trees, Complete characterization of incorrect orthology assignments in best match graphs, Least resolved trees for two-colored best match graphs, Non-binary universal tree-based networks, Complexity of modification problems for best match graphs, A tutorial on the balanced minimum evolution problem, Common \(\alpha\)-fuzzy fixed point results for Kannan type contractions with application, Minimum Average Distance Clique Trees, Complete edge-colored permutation graphs, When Can Splits be Drawn in the Plane?, L-Infinity Optimization to Linear Spaces and Phylogenetic Trees, Inducibility in Binary Trees and Crossings in Random Tanglegrams, Autopolyploidy, allopolyploidy, and phylogenetic networks with horizontal arcs, Forest-based networks, Breaking the 2-competitiveness barrier for two servers in a tree, Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks, On the enumeration of leaf-labeled increasing trees with arbitrary node-degree, Defining binary phylogenetic trees using parsimony, Defining binary phylogenetic trees using parsimony: new bounds, Representing and extending ensembles of parsimonious evolutionary histories with a directed acyclic graph, Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees, Computing consensus networks for collections of 1-nested phylogenetic networks, Building a small and informative phylogenetic supertree, The agreement distance of unrooted phylogenetic networks, On the quartet distance given partial information, Injective split systems, Combinatorial statistics and the sciences, Phylogenomic Models from Tree Symmetries, Enumeration of rooted binary unlabeled galled trees, Convexity in Tree Spaces, Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections, Parsimony and the rank of a flattening matrix, A duality based 2-approximation algorithm for maximum agreement forest, A Space of Phylogenetic Networks, Quasi-best match graphs, A representation-theoretic approach to the calculation of evolutionary distance in bacteria, Phylogenetic Networks, Random ultrametric trees and applications, Limit distribution of the quartet balance index for Aldous’s $(\beta \ge 0)$-model, Recent Developments in Discrete Convex Analysis, MULTIPLICATIVELY CLOSED MARKOV MODELS MUST FORM LIE ALGEBRAS, Cograph editing: Merging modules is equivalent to editing P_4s, Unnamed Item, Modeling the distribution of distance data in Euclidean space, Clades, clans, and reciprocal monophyly under neutral evolutionary models, PICK TWO POINTS IN A TREE, Identifiability of a Markovian model of molecular evolution with gamma-distributed rates, Quasi-metric trees and $q$-hyperconvex hulls, Random tree growth by vertex splitting, Edge Conflicts do not Determine Geodesics in the Associahedron, Edge Contractions in Subclasses of Chordal Graphs, A characterization of distance matrices of weighted cubic graphs and Peterson graphs, Learning nonsingular phylogenies and hidden Markov models, Species Tree Inference from Genomic Sequences Using the Log-Det Distance, Fixed-Parameter Algorithms for Finding Agreement Supertrees, Unnamed Item, Unnamed Item, Unnamed Item, Limit Theorems for the Inductive Mean on Metric Trees, On the Maximum Quartet Distance between Phylogenetic Trees, Some Convergence Results of the $$K^{*}$$ Iteration Process in CAT(0) Spaces, Comparing and Aggregating Partially Resolved Trees, A Representation Theorem for Union-Difference Families and Application, Unnamed Item, A central limit theorem for additive functionals of increasing trees, L-Infinity Optimization to Bergman Fans of Matroids with an Application to Phylogenetics, A Tractable Class of Binary VCSPs via M-Convex Intersection, Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape, Representation theorems of ℝ-trees and Brownian motions indexed by ℝ-trees, Comments on: ``Static and dynamic source locations in undirected networks, Treewidth of display graphs: bounds, brambles and applications, The Tropical Cayley--Menger Variety, Large-Scale Multiple Sequence Alignment and Phylogeny Estimation, Heading in the right direction? Using head moves to traverse phylogenetic network space, Spectral Neighbor Joining for Reconstruction of Latent Tree Models, Identifying phylogenetic trees, Simplicial Powers of Graphs, On Computing the Maximum Parsimony Score of a Phylogenetic Network, Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters, Brownian motion tree models are toric, Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings, The Bergman complex of a matroid and phylogenetic trees, Krasnoselskii-Mann method for multi-valued non-self mappings in CAT(0) spaces, Distinguished Minimal Topological Lassos, Systematics and symmetry in molecular phylogenetic modelling: perspectives from physics, On the Largest Common Subtree of Random Leaf-Labeled Binary Trees, On the Maximum Agreement Subtree Conjecture for Balanced Trees, Tropical medians by transportation, Total positivity in multivariate extremes, Convex Characters, Algorithms, and Matchings, The ultrametric Gromov-Wasserstein distance, A distance-based model for convergent evolution, Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics, A note on generalized four-point inequality, Visualizing multispecies coalescent trees: drawing gene trees inside species trees, Distances and isomorphism between networks: stability and convergence of network invariants, A new iterative method for approximating common fixed points of two non-self mappings in a CAT(0) space, Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model, Expanding the class of global objective functions for dissimilarity-based hierarchical clustering, The space of equidistant phylogenetic cactuses, The rotation distance of brooms, Unnamed Item, On minimum spanning tree-like metric spaces, On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters, Asymptotic enumeration and distributional properties of galled networks, Sharp upper and lower bounds on a restricted class of convex characters, Identifiability of species network topologies from genomic sequences using the logDet distance, Compatibility of partitions with trees, hierarchies, and split systems, The positive Bergman complex of an oriented matroid, A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements, Topics on phylogenetic algebraic geometry, Classes of explicit phylogenetic networks and their biological and mathematical significance, Encoding and constructing 1-nested phylogenetic networks with trinets, Bijections for ranked tree-child networks, Well-partitioned chordal graphs, Bounding component sizes of two-connected Steiner networks, Closure operations in phylogenetics, Reconstructing phylogenetic trees from multipartite quartet systems, Minimum spanning paths and Hausdorff distance in finite ultrametric spaces, Order distances and split systems, Finding optimal triangulations parameterized by edge clique cover, Estimation of the covariance structure from SNP allele frequencies, Distributions of topological tree metrics between a species tree and a gene tree, On the quirks of maximum parsimony and likelihood on phylogenetic networks, On the effect of intralocus recombination on triplet-based species tree estimation, Completion of tree metrics and rank 2 matrices, On finding the Adams consensus tree, Uprooted phylogenetic networks, Fundamental polytopes of metric trees via parallel connections of matroids, Trees within trees. II: Nested fragmentations, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, Combinatorial views on persistent characters in phylogenetics, Approximation of common solution of finite family of monotone inclusion and fixed point problems for demicontractive multivalued mappings in CAT(0) spaces, On the minimum value of the Colless index and the bifurcating trees that achieve it, A causal discovery algorithm based on the prior selection of leaf nodes, Statistical inconsistency of maximum parsimony for \(k\)-tuple-site data, New families of stable simplicial filtration functors, The ancestral matrix of a rooted tree, Initial ideals of Pfaffian ideals, Best match graphs, The space of tree-based phylogenetic networks, Extremal distances for subtree transfer operations in binary trees, A high quartet distance construction, Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees, Counting and enumerating tree-child networks and their subclasses, Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics, Exact-2-relation graphs, Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace, Computing quadratic entropy in evolutionary trees, The algebra of the general Markov model on phylogenetic trees and networks, Reconstructing pedigrees: a combinatorial perspective, Does random tree puzzle produce Yule-Harding trees in the many-taxon limit?, Caterpillars on three and four leaves are sufficient to binary normal networks, Optimizing phylogenetic diversity under constraints, New reduction rules for the tree bisection and reconnection distance, Computing the rooted triplet distance between galled trees by counting triangles, Subset feedback vertex sets in chordal graphs, Single-crossover recombination and ancestral recombination trees, Toric geometry of the Cavender-Farris-Neyman model with a molecular clock, Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm, Trinets encode orchard phylogenetic networks, Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes, Maximum agreement and compatible supertrees, On geometry of binary symmetric models of phylogenetic trees, Defining phylogenetic networks using ancestral profiles, Trinets encode tree-child and level-2 phylogenetic networks, Detecting fixed patterns in chordal graphs in polynomial time, Tripartitions do not always discriminate phylogenetic networks, Identifiability of 3-class Jukes-Cantor mixtures, Lie Markov models with purine/pyrimidine symmetry, Recovering a phylogenetic tree using pairwise closure operations, Entanglement invariants and phylogenetic branching, Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, Subtree prune and regraft: a reversible real tree-valued Markov process, Phylogenetic networks from multi-labelled trees, Inducibility of \(d\)-ary trees, Phylogenetic networks that are their own fold-ups, Recognizing and realizing cactus metrics, Biodiversity, Shapley value and phylogenetic trees: some remarks, Most parsimonious likelihood exhibits multiple optima for compatible characters, Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks, Three-way symbolic tree-maps and ultrametrics, Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study, Maximum likelihood estimation in Gaussian models under total positivity, Distribution and asymptotic behavior of the phylogenetic transfer distance, Alternative characterizations of Fitch's xenology relation, Treelike families of multiweights, Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees, Properties and morphisms of finite ultrametric spaces and their representing trees, A class of phylogenetic networks reconstructable from ancestral profiles, Finding the best resolution for the Kingman-Tajima coalescent: theory and applications, Limit theorems for patterns in phylogenetic trees, Counting phylogenetic networks, Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution?, Clades and clans: a comparison study of two evolutionary models, A parsimony-based metric for phylogenetic trees, Polyhedral computational geometry for averaging metric phylogenetic trees, Fishing for minimum evolution trees with neighbor-nets, How probable is common ancestry according to different evolutionary processes?, The Stein effect for Fréchet means, Neighborhoods of trees in circular orderings, Recursion over partitions
