PAUP*

swMATH7834MaRDI QIDQ19850FDOQ19850

Author name not available (Why is that?)

Cited In (50)

• A more efficient algorithm for MPR problems in phylogeny
• Constructing rooted supertrees using distances
• Phylogenetic estimation with partial likelihood tensors
• On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization
• Algorithms in Computational Molecular Biology
• Effects of discordance between species and gene trees on phylogenetic diversity conservation
• Two‐Sample Tests for Comparing Intra‐Individual Genetic Sequence Diversity between Populations
• Estimating phylogenetic trees from pairwise likelihoods and posterior probabilities of substitution counts
• EdiPy: A resource to simulate the evolution of plant mitochondrial genes under the RNA editing
• Concentration inequality for evolutionary trees
• A tabu search algorithm for maximum parsimony phylogeny inference
• Identifiability and reconstructibility of species phylogenies under a modified coalescent
• Title not available (Why is that?)
• Approximating geodesic tree distance
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• Lattice-theoretic properties of MPR-posets in phylogeny
• Reconstruction of large phylogenetic trees: a parallel approach
• A comparison of ancestral state reconstruction methods for quantitative characters
• Characterizing local optima for maximum parsimony
• On a matching distance between rooted phylogenetic trees
• An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies
• The universal ancestor was a thermophile or a hyperthermophile: tests and further evidence
• A lower bound for the breakpoint phylogeny problem
• Majority-rule (+) consensus trees
• Computing and Combinatorics
• Phylogenetic analysis of nucleotide sequences: An algebraic approach
• Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis
• Jungles: A new solution to the host/parasite phylogeny reconciliation problem
• Reconstructing ancestral character states under Wagner parsimony
• A distance measure based on binary character data and its application to phylogeny reconstruction
• An improved bound on the maximum agreement subtree problem
• Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
• Applying the bootstrap in phylogeny reconstruction
• The minimum evolution problem: Overview and classification
• Inferring phylogenetic trees using answer set programming
• Error Detection and Correction of Gene Trees
• Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
• Tumor classification using phylogenetic methods on expression data
• Bayesian-weighted triplet and quartet methods for species tree inference
• The agreement metric for labeled binary trees
• Title not available (Why is that?)
• DASACT: a decision aiding software for axiomatic consensus theory
• Time-dependent-asymmetric-linear-parsimonious ancestral state reconstruction
• A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
• Phylogenetics of artificial manuscripts
• Tropical Sufficient Statistics for Persistent Homology
• On finding the Adams consensus tree
• The size of the character state space affects the occurrence and detection of homoplasy: modelling the probability of incompatibility for unordered phylogenetic characters
• Using the Ornstein-Uhlenbeck process to model the evolution of interacting populations
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time

This page was built for software: PAUP*