On the public citation graph
The complexity of reconstructing trees from qualitative characters and subtrees
0 signed · 507 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230210104openalex-snapshot
Efficient algorithms for inferring evolutionary trees
inferredcites →https://doi.org/10.1007/11538.1522-9602openalex-snapshot
Bulletin of Mathematical Biology
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-3-642-69024-2_34openalex-snapshot
Theoretical and Computational Considerations of the Compatibility of Qualitative Taxonomic Characters
inferredcites →https://doi.org/10.1007/bf00275985openalex-snapshot
When are two qualitative taxonomic characters compatible?
inferredcites →https://doi.org/10.1007/bf01733209openalex-snapshot
A non-sequential method for constructing trees and hierarchical classifications
inferredcites →https://doi.org/10.1007/bf01890075openalex-snapshot
Invariants of phylogenies in a simple case with discrete states
inferredcites →https://doi.org/10.1007/bf01894195openalex-snapshot
Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
inferredcites →https://doi.org/10.1007/bf01894196openalex-snapshot
Tree enumeration modulo a consensus
inferredcites →https://doi.org/10.1007/bf01908061openalex-snapshot
Optimal algorithms for comparing trees with labeled leaves
inferredcites →https://doi.org/10.1007/bf02462853openalex-snapshot
On the compatibility of binary qualitative taxonomic characters
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90141-2openalex-snapshot
An algebraic analysis of cladistic characters
inferredcites →https://doi.org/10.1016/0022-5193(78)90137-6openalex-snapshot
On the similarity of dendrograms
inferredcites →https://doi.org/10.1016/0025-5564(79)90071-3openalex-snapshot
How to determine the compatibility of undirected character state trees
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/0196-8858(86)90038-2openalex-snapshot
Reconstructing the shape of a tree from observed dissimilarity data
inferredcites →https://doi.org/10.1016/0196-8858(89)90026-2openalex-snapshot
Applications of antilexicographic order. I. An enumerative theory of trees
inferredcites →https://doi.org/10.1016/0893-9659(92)90026-6openalex-snapshot
Convex tree realizations of partitions
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0022-5193(05)80303-0openalex-snapshot
Quadratic tree invariants for multivalued characters
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0196-8858(82)80004-3openalex-snapshot
The steiner problem in phylogeny is NP-complete
inferredcites →https://doi.org/10.1093/sysbio/30.3.309openalex-snapshot
Taxonomic Congruence in the Leptopodomorpha Re-examined
inferredcites →https://doi.org/10.1093/sysbio/35.2.224openalex-snapshot
Computational Complexity of Inferring Phylogenies by Compatibility
inferredcites →https://doi.org/10.1093/sysbio/35.3.325openalex-snapshot
Analysis of Quartet Dissimilarity Measures Between Undirected Phylogenetic Trees
inferredcites →https://doi.org/10.1109/fscs.1990.89555openalex-snapshot
Inferring evolutionary history from DNA sequences
inferredcites →https://doi.org/10.1111/j.1558-5646.1967.tb03411.xopenalex-snapshot
PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES
inferredcites →https://doi.org/10.1111/j.2044-8317.1981.tb00626.xopenalex-snapshot
Tree structures for proximity data
inferredcites →https://doi.org/10.1112/blms/2.2.252openalex-snapshot
Mathematics in the Archaeological and Historical Sciences
inferredcites →https://doi.org/10.1137/0210030openalex-snapshot
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
inferredcites →https://doi.org/10.1137/0403005openalex-snapshot
On the Distribution of Lengths of Evolutionary Trees
inferredcites →https://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferredcites →https://doi.org/10.1146/annurev.ge.22.120188.002513openalex-snapshot
PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITY
inferredcites →https://doi.org/10.2307/2413252openalex-snapshot
Taxonomic Congruence in the Leptopodomorpha Re-Examined
inferredcites →https://doi.org/10.2307/2413326openalex-snapshot
Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units
inferredcites →https://doi.org/10.2307/2413385openalex-snapshot
Analysis of Quartet Dissimilarity Measures Between Undirected Phylogenetic Trees
inferredcites →https://doi.org/10.2307/2413432openalex-snapshot
Computational Complexity of Inferring Phylogenies by Compatibility
inferredcites →https://doi.org/10.2307/2419216openalex-snapshot
The Necessity of Convex Groups in Biological Classification
inferredcites →https://doi.org/10.2307/2992397openalex-snapshot
The Relationship Between Simple Evolutionary Tree Models and Observable Sequence Data
inferredcites →https://doi.org/10.2307/sysbio/34.2.193openalex-snapshot
Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199903)14:2<153::aid-rsa3>3.0.co;2-ropenalex-snapshot
A few logs suffice to build (almost) all trees (I)
inferred← citeshttps://doi.org/10.1002/9781119487845.ch7openalex-snapshot
The Multispecies Coalescent
inferred← citeshttps://doi.org/10.1002/gepi.20024openalex-snapshot
Algorithms for inferring haplotypes
inferred← citeshttps://doi.org/10.1002/jgt.22776openalex-snapshot
On the quartet distance given partial information
inferred← citeshttps://doi.org/10.1006/aama.1995.1020openalex-snapshot
Extension Operations on Sets of Leaf-Labeled Trees
inferred← citeshttps://doi.org/10.1006/aama.1996.0503openalex-snapshot
Trees, Taxonomy, and Strongly Compatible Multi-state Characters
inferred← citeshttps://doi.org/10.1006/aama.2001.0772openalex-snapshot
Tree Reconstruction from Multi-State Characters
inferred← citeshttps://doi.org/10.1006/jagm.1994.1018openalex-snapshot
Tree Compatibility and Inferring Evolutionary History
inferred← citeshttps://doi.org/10.1006/jagm.1997.0897openalex-snapshot
Constructing Computer Virus Phylogenies
inferred← citeshttps://doi.org/10.1006/jagm.1998.0965openalex-snapshot
Acyclic Hypergraph Projections
inferred← citeshttps://doi.org/10.1006/jagm.1999.1050openalex-snapshot
Some Open Problems in Computational Molecular Biology
inferred← citeshttps://doi.org/10.1006/jagm.2000.1116openalex-snapshot
Algorithmic Aspects of Tree Amalgamation
inferred← citeshttps://doi.org/10.1006/jagm.2000.1133openalex-snapshot
Constructing Optimal Trees from Quartets
inferred← citeshttps://doi.org/10.1007/1-84628-119-9_4openalex-snapshot
Introduction to Statistical Phylogenetics
inferred← citeshttps://doi.org/10.1007/11415770_23openalex-snapshot
Maximum Likelihood of Evolutionary Trees Is Hard
inferred← citeshttps://doi.org/10.1007/11428848_121openalex-snapshot
Experimental Analysis of a New Algorithm for Partial Haplotype Completion
inferred← citeshttps://doi.org/10.1007/11534273_20openalex-snapshot
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
inferred← citeshttps://doi.org/10.1007/11538462_17openalex-snapshot
Efficient Approximation of Convex Recolorings
inferred← citeshttps://doi.org/10.1007/11557067_6openalex-snapshot
A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem
inferred← citeshttps://doi.org/10.1007/11557067_8openalex-snapshot
Using Semi-definite Programming to Enhance Supertree Resolvability
inferred← citeshttps://doi.org/10.1007/11758525_107openalex-snapshot
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/11786986_58openalex-snapshot
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_3openalex-snapshot
Combinatorial Problems Arising in SNP and Haplotype Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_14openalex-snapshot
Incomplete Directed Perfect Phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-45727-5_11openalex-snapshot
Tree Reconstruction via a Closure Operation on Partial Splits
inferred← citeshttps://doi.org/10.1007/3-540-45727-5_8openalex-snapshot
Phylogenetic Reconstruction Algorithms Based on Weighted 4-Trees
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_23openalex-snapshot
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_28openalex-snapshot
Quartet Cleaning: Improved Algorithms and Simulations
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_3openalex-snapshot
From Quartets to Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_265openalex-snapshot
Tree reconstruction from partial orders
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_41openalex-snapshot
Algorithms and complexity of sandwich problems in graphs (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_31openalex-snapshot
Of chicken teeth and mouse eyes, or generalized character compatibility
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_38openalex-snapshot
Minimizing phylogenetic number to find good evolutionary trees
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_65openalex-snapshot
Intervalizing k-colored graphs
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_49openalex-snapshot
Hypothesis testing in perfect phylogeny for a bounded number of characters
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_19openalex-snapshot
Constructing computer virus phylogenies
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_168openalex-snapshot
A polynomial-time algorithm for near-perfect phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot
Tree contractions and evolutionary trees
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_235openalex-snapshot
Constructing big trees from short sequences
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_56openalex-snapshot
Approximation algorithms for the fixed-topology phylogenetic number problem
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_288openalex-snapshot
Perfect Phylogeny (Bounded Number of States)
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_12openalex-snapshot
Taxonomy, Supertrees, and the Tree of Life
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_18openalex-snapshot
A Critique of Matrix Representation with Parsimony Supertrees
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_6openalex-snapshot
Tangled Tales from Multiple Markers
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_7openalex-snapshot
Supertree Methods for Ancestral Divergence Dates and other Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_6openalex-snapshot
The Perfect Phylogeny Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_288openalex-snapshot
Perfect Phylogeny (Bounded Number of States)
inferred← citeshttps://doi.org/10.1007/978-1-60327-159-2_24openalex-snapshot
Fixed-Parameter Algorithms in Phylogenetics
inferred← citeshttps://doi.org/10.1007/978-3-030-00834-5_13openalex-snapshot
Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-00834-5_15openalex-snapshot
NJMerge: A Generic Technique for Scaling Phylogeny Estimation Methods and Its Application to Species Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-10837-3_5openalex-snapshot
Gene Family Evolution—An Algorithmic Framework
inferred← citeshttps://doi.org/10.1007/978-3-030-10837-3_6openalex-snapshot
Divide-and-Conquer Tree Estimation: Opportunities and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-030-15843-9_1openalex-snapshot
Improved Variable Neighbourhood Search Heuristic for Quartet Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-18174-1_1openalex-snapshot
New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_22openalex-snapshot
Realization Problems on Reachability Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_34openalex-snapshot
Minimal Triangulation Algorithms for Perfect Phylogeny Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07953-0_6openalex-snapshot
On Low Treewidth Graphs and Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_23openalex-snapshot
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
inferred← citeshttps://doi.org/10.1007/978-3-319-38782-6_18openalex-snapshot
Path-Difference Median Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_5openalex-snapshot
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_45openalex-snapshot
Combinatorial Scoring of Phylogenetic Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-43681-4_8openalex-snapshot
Fast Compatibility Testing for Phylogenies with Nested Taxa
inferred← citeshttps://doi.org/10.1007/978-3-319-56970-3_6openalex-snapshot
Determining the Consistency of Resolved Triplets and Fan Triplets
inferred← citeshttps://doi.org/10.1007/978-3-319-67979-2_15openalex-snapshot
Statistical Consistency of Coalescent-Based Species Tree Methods Under Models of Missing Data
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_29openalex-snapshot
On Strongly Chordal Graphs That Are Not Leaf Powers
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_53openalex-snapshot
Rooted Maximum Agreement Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-540-24719-7_3openalex-snapshot
A Survey of Computational Methods for Determining Haplotypes
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_49openalex-snapshot
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_1openalex-snapshot
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_9openalex-snapshot
The Core of a Countably Categorical Structure
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_16openalex-snapshot
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_5openalex-snapshot
Constraint Satisfaction with Countable Homogeneous Templates
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_8openalex-snapshot
Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data
inferred← citeshttps://doi.org/10.1007/978-3-540-78839-3_40openalex-snapshot
Constructing Level-2 Phylogenetic Networks from Triplets
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_8openalex-snapshot
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_44openalex-snapshot
New Results on Optimizing Rooted Triplets Consistency
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_60openalex-snapshot
From Gene Trees to Species Trees through a Supertree Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-01536-6_11openalex-snapshot
Classification of Complex Molecules
inferred← citeshttps://doi.org/10.1007/978-3-642-02008-7_18openalex-snapshot
The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-02008-7_4openalex-snapshot
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_23openalex-snapshot
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_27openalex-snapshot
On the Generalised Character Compatibility Problem for Non-branching Character Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_34openalex-snapshot
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04241-6_18openalex-snapshot
Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters
inferred← citeshttps://doi.org/10.1007/978-3-642-04241-6_7openalex-snapshot
Constructing Majority-Rule Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_12openalex-snapshot
A Parameterized Algorithm for Chordal Sandwich
inferred← citeshttps://doi.org/10.1007/978-3-642-13078-6_8openalex-snapshot
Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_23openalex-snapshot
Kernel and Fast Algorithm for Dense Triplet Inconsistency
inferred← citeshttps://doi.org/10.1007/978-3-642-15294-8_22openalex-snapshot
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
inferred← citeshttps://doi.org/10.1007/978-3-642-15294-8_23openalex-snapshot
Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data
inferred← citeshttps://doi.org/10.1007/978-3-642-17103-1_38openalex-snapshot
Phylogenetic Closure Operations and Homoplasy-Free Evolution
inferred← citeshttps://doi.org/10.1007/978-3-642-21260-4_41openalex-snapshot
Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_13openalex-snapshot
Unique Perfect Phylogeny Is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_29openalex-snapshot
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_10openalex-snapshot
Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_11openalex-snapshot
On a Conjecture about Compatibility of Multi-states Characters
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_24openalex-snapshot
Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing Values
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_6openalex-snapshot
Constructing Large Conservative Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_288-2openalex-snapshot
Perfect Phylogeny (Bounded Number of States)
inferred← citeshttps://doi.org/10.1007/978-3-642-29627-7_23openalex-snapshot
Recovering the Tree-Like Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-30191-9_29openalex-snapshot
Phylogenetic Tree Reconstruction with Protein Linkage
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_30openalex-snapshot
Fixed-Parameter Algorithms for Finding Agreement Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_15openalex-snapshot
Improved Lower Bounds on the Compatibility of Quartets, Triplets, and Multi-state Characters
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_7openalex-snapshot
Extracting Conflict-Free Information from Multi-labeled Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_8openalex-snapshot
Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_24openalex-snapshot
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40453-5_15openalex-snapshot
Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-59789-3_20openalex-snapshot
A General Approach to Test the Pertinence of a Consensus Classification
inferred← citeshttps://doi.org/10.1007/978-3-642-72253-0_11openalex-snapshot
Consensus of classifications: the case of trees
inferred← citeshttps://doi.org/10.1007/978-4-431-65950-1_6openalex-snapshot
How to validate phylogenetic trees? A stepwise procedure
inferred← citeshttps://doi.org/10.1007/bf01188585openalex-snapshot
A robust model for finding optimal evolutionary trees
inferred← citeshttps://doi.org/10.1007/bfb0009482openalex-snapshot
On the approximability of the Steiner tree problem in phylogeny
inferred← citeshttps://doi.org/10.1007/bfb0045078openalex-snapshot
Inferring evolutionary trees with strong combinatorial evidence
inferred← citeshttps://doi.org/10.1007/pl00008280openalex-snapshot
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
inferred← citeshttps://doi.org/10.1007/s00026-006-0276-8openalex-snapshot
A Novel Insight into the Perfect Phylogeny Problem
inferred← citeshttps://doi.org/10.1007/s00026-009-0017-xopenalex-snapshot
Groves of Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/s00026-018-0411-3openalex-snapshot
A High Quartet Distance Construction
inferred← citeshttps://doi.org/10.1007/s00224-008-9145-7openalex-snapshot
Approximability of Clausal Constraints
inferred← citeshttps://doi.org/10.1007/s00224-009-9165-yopenalex-snapshot
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
inferred← citeshttps://doi.org/10.1007/s00224-010-9276-5openalex-snapshot
A Property Tester for Tree-Likeness of Quartet Topologies
inferred← citeshttps://doi.org/10.1007/s00239-018-9833-0openalex-snapshot
The Performance of Two Supertree Schemes Compared Using Synthetic and Real Data Quartet Input
inferred← citeshttps://doi.org/10.1007/s00285-010-0355-7openalex-snapshot
Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent
inferred← citeshttps://doi.org/10.1007/s00285-011-0450-4openalex-snapshot
‘Lassoing’ a phylogenetic tree I: basic properties, shellings, and covers
inferred← citeshttps://doi.org/10.1007/s00285-016-1068-3openalex-snapshot
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
inferred← citeshttps://doi.org/10.1007/s00357-006-0005-3openalex-snapshot
On the Complexity of Ordinal Clustering
inferred← citeshttps://doi.org/10.1007/s00357-010-9053-9openalex-snapshot
Minimum Tree Cost Quartet Puzzling
inferred← citeshttps://doi.org/10.1007/s00453-004-1147-5openalex-snapshot
Rooted Maximum Agreement Supertrees
inferred← citeshttps://doi.org/10.1007/s00453-009-9303-6openalex-snapshot
Improved Algorithms for Maximum Agreement and Compatible Supertrees
inferred← citeshttps://doi.org/10.1007/s00453-017-0330-4openalex-snapshot
Fast Compatibility Testing for Rooted Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/s00453-022-00945-9openalex-snapshot
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems
inferred← citeshttps://doi.org/10.1007/s00453-026-01400-9openalex-snapshot
MUL-Tree Pruning for Consistency and Compatibility
inferred← citeshttps://doi.org/10.1007/s10107-025-02305-1openalex-snapshot
Getting to the root of the problem: sums of squares for limits of trees
inferred← citeshttps://doi.org/10.1007/s10288-018-0394-2openalex-snapshot
An exact algorithm for the minimum quartet tree cost problem
inferred← citeshttps://doi.org/10.1007/s10601-007-9040-xopenalex-snapshot
Combining Tree Partitioning, Precedence, and Incomparability Constraints
inferred← citeshttps://doi.org/10.1007/s10898-019-00871-1openalex-snapshot
Improved metaheuristics for the quartet method of hierarchical clustering
inferred← citeshttps://doi.org/10.1007/s11538-014-0022-zopenalex-snapshot
Reconstructing a Phylogenetic Level-1 Network from Quartets
inferred← citeshttps://doi.org/10.1007/s11538-017-0260-yopenalex-snapshot
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/s11538-018-0450-2openalex-snapshot
Quarnet Inference Rules for Level-1 Networks
inferred← citeshttps://doi.org/10.1007/s11538-024-01338-5openalex-snapshot
Variational Supertrees for Bayesian Phylogenetics
inferred← citeshttps://doi.org/10.1007/s11538-025-01510-5openalex-snapshot
When are Quarnets Sufficient to Reconstruct Semi-directed Phylogenetic Networks?
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00074-2openalex-snapshot
Reconstruction of rooted trees from subtrees
inferred← citeshttps://doi.org/10.1016/0893-9659(92)90026-6openalex-snapshot
Convex tree realizations of partitions
inferred← citeshttps://doi.org/10.1016/j.aam.2003.08.006openalex-snapshot
Counting consistent phylogenetic trees is #P-complete
inferred← citeshttps://doi.org/10.1016/j.aam.2004.03.003openalex-snapshot
Peeling phylogenetic ‘oranges’
inferred← citeshttps://doi.org/10.1016/j.aam.2016.10.003openalex-snapshot
A note on convex characters, Fibonacci numbers and exponential-time algorithms
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102952openalex-snapshot
Coconvex characters on collections of phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.aml.2004.01.007openalex-snapshot
Recovering a phylogenetic tree using pairwise closure operations
inferred← citeshttps://doi.org/10.1016/j.aml.2009.08.009openalex-snapshot
Characterizing phylogenetically decisive taxon coverage
inferred← citeshttps://doi.org/10.1016/j.aml.2010.12.015openalex-snapshot
Graph triangulations and the compatibility of unrooted phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.aml.2012.02.060openalex-snapshot
A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
inferred← citeshttps://doi.org/10.1016/j.artint.2006.12.004openalex-snapshot
Determining the consistency of partial tree descriptions
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103880openalex-snapshot
Solving infinite-domain CSPs using the patchwork property
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2005.04.001openalex-snapshot
Integer linear programming as a tool for constructing trees from quartet data
inferred← citeshttps://doi.org/10.1016/j.csbr.2024.100022openalex-snapshot
A practical study of the proportion of non-unique neighbor-joining trees of microsatellite markers
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.038openalex-snapshot
Consistency of the QNet algorithm for generating planar split networks from weighted quartets
inferred← citeshttps://doi.org/10.1016/j.dam.2010.03.004openalex-snapshot
New results on optimizing rooted triplets consistency
inferred← citeshttps://doi.org/10.1016/j.dam.2017.05.002openalex-snapshot
On compatibility and incompatibility of collections of unrooted phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.028openalex-snapshot
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.042openalex-snapshot
Simultaneous separation in bounded degree trees
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.015openalex-snapshot
Identifying phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.013openalex-snapshot
The matroid structure of representative triple sets and triple-closure computation
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.056openalex-snapshot
Compatibility, Incompatibility, Tree-Width, and Forbidden Phylogenetic Minors
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.022openalex-snapshot
Building species trees from larger parts of phylogenomic databases
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.009openalex-snapshot
Phylogeny- and parsimony-based haplotype inference with constraints
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.013openalex-snapshot
A polynomial time algorithm for the minimum quartet inconsistency problem with quartet errors
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.08.006openalex-snapshot
Testing consistency of quartet topologies: A parameterized approach
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.006openalex-snapshot
Efficient approximation of convex recolorings
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.10.003openalex-snapshot
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
inferred← citeshttps://doi.org/10.1016/j.jtbi.2014.10.033openalex-snapshot
The size of the character state space affects the occurrence and detection of homoplasy: Modelling the probability of incompatibility for unordered phylogenetic characters
inferred← citeshttps://doi.org/10.1016/j.mbs.2006.11.005openalex-snapshot
Closure operations in phylogenetics
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.08.033openalex-snapshot
A Fast Quartet tree heuristic for hierarchical clustering
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.004openalex-snapshot
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.033openalex-snapshot
Compatibility of unrooted phylogenetic trees is FPT
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.022openalex-snapshot
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.015openalex-snapshot
Influence of tree topology restrictions on the complexity of haplotyping with missing data
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.032openalex-snapshot
Kernel and fast algorithm for dense triplet inconsistency
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.048openalex-snapshot
Unique perfect phylogeny is intractable
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.015openalex-snapshot
Optimizing tree and character compatibility across several phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.015openalex-snapshot
A colored graph approach to perfect phylogeny with persistent characters
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.005openalex-snapshot
On the Weighted Quartet Consensus problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.034openalex-snapshot
Realization problems on reachability sequences
inferred← citeshttps://doi.org/10.1016/j.tpb.2016.02.002openalex-snapshot
Consistency and inconsistency of consensus methods for inferring species trees from gene trees in the presence of ancestral population structure
inferred← citeshttps://doi.org/10.1016/j.tree.2004.03.015openalex-snapshot
The evolution of supertrees
inferred← citeshttps://doi.org/10.1016/j.ympev.2011.06.021openalex-snapshot
Quartet MaxCut: A fast algorithm for amalgamating quartet trees
inferred← citeshttps://doi.org/10.1016/j.ympev.2014.06.008openalex-snapshot
Hide and vanish: Data sets where the most parsimonious tree is known but hard to find, and their implications for tree search methods
inferred← citeshttps://doi.org/10.1016/j.ympev.2017.08.007openalex-snapshot
Toxic genes present a unique phylogenetic signature
inferred← citeshttps://doi.org/10.1016/j.ympev.2018.01.020openalex-snapshot
On defining a unique phylogenetic tree with homoplastic characters
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00174-1openalex-snapshot
A characterization for a set of partial partitions to define an X-tree
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00249-8openalex-snapshot
Recovering trees from well-separated multi-state characters
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00077-1openalex-snapshot
A fixed-parameter algorithm for minimum quartet inconsistency
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10075-1openalex-snapshot
Matrix sandwich problems
showing the first 200 of 465 · page through all 465
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.