On the public citation graph
Computational Complexity of Inferring Phylogenies by Compatibility
0 signed · 78 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 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/prot.24799openalex-snapshot
Method for identification of rigid domains and hinge residues in proteins based on exhaustive enumeration
inferred← citeshttps://doi.org/10.1006/jagm.2000.1133openalex-snapshot
Constructing Optimal Trees from Quartets
inferred← citeshttps://doi.org/10.1006/mpev.1997.0450openalex-snapshot
Escaping from the Felsenstein Zone by Detecting Long Branches in Phylogenetic Data
inferred← citeshttps://doi.org/10.1007/11415770_23openalex-snapshot
Maximum Likelihood of Evolutionary Trees Is Hard
inferred← citeshttps://doi.org/10.1007/11758525_109openalex-snapshot
Robustness of Greedy Type Minimum Evolution Algorithms
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-49477-4_3openalex-snapshot
From Quartets to Phylogenetic Trees
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-61258-0_18openalex-snapshot
The asymmetric median tree — A new model for building consensus trees
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-1-4471-5298-9_3openalex-snapshot
How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree
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-27801-6_17openalex-snapshot
Small Phylogeny Problem: Character Evolution Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-30557-6_5openalex-snapshot
Character-Based Cladistics and Answer Set Programming
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-642-02008-7_32openalex-snapshot
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_36openalex-snapshot
Computing Weighted Solutions in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_59openalex-snapshot
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_26openalex-snapshot
Applications of Answer Set Programming in Phylogenetic Systematics
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_1openalex-snapshot
Preserving Inversion Phylogeny Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_14openalex-snapshot
The complexity of the median procedure for binary trees
inferred← citeshttps://doi.org/10.1007/bf02458863openalex-snapshot
Computational complexity of inferring phylogenies from dissimilarity matrices
inferred← citeshttps://doi.org/10.1007/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferred← citeshttps://doi.org/10.1007/s10472-004-9431-2openalex-snapshot
A Parsimony Tree for the SAT2002 Competition
inferred← citeshttps://doi.org/10.1007/s10472-011-9242-1openalex-snapshot
Computing weighted solutions in ASP: representation-based method vs. search-based method
inferred← citeshttps://doi.org/10.1007/s10817-007-9082-1openalex-snapshot
Inferring Phylogenetic Trees Using Answer Set Programming
inferred← citeshttps://doi.org/10.1007/s11390-010-9302-8openalex-snapshot
Challenges in Understanding Genome-Wide DNA Methylation
inferred← citeshttps://doi.org/10.1016/0025-5564(86)90161-6openalex-snapshot
The computational complexity of inferring rooted phylogenies by parsimony
inferred← citeshttps://doi.org/10.1016/0893-9659(96)00012-2openalex-snapshot
Finding a maximum compatible tree is NP-hard for sequences and trees
inferred← citeshttps://doi.org/10.1016/j.aml.2012.02.026openalex-snapshot
‘Bureaucratic’ set systems, and their role in phylogenetics
inferred← citeshttps://doi.org/10.1016/j.jtbi.2017.03.001openalex-snapshot
Cases in which ancestral maximum likelihood will be confusingly misleading
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.022openalex-snapshot
Is the Protein Model Assignment problem under linked branch lengths NP-hard?
inferred← citeshttps://doi.org/10.1016/s0022-5193(87)80263-1openalex-snapshot
Computational complexity of inferring phylogenies from chromosome inversion data
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00060-1openalex-snapshot
Minimizing phylogenetic number to find good evolutionary trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00071-6openalex-snapshot
The asymmetric median tree — A new model for building consensus trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70210-3openalex-snapshot
Chapter 2 Phylogenetic Trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00342-9openalex-snapshot
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00235-2openalex-snapshot
Inferring evolutionary trees with strong combinatorial evidence
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00129-1openalex-snapshot
Molecular phylogenetics: parallelized parameter estimation and quartet puzzling
inferred← citeshttps://doi.org/10.1073/pnas.94.13.6585openalex-snapshot
Mathematical approaches to comparative linguistics
inferred← citeshttps://doi.org/10.1080/0028825x.1993.10419501openalex-snapshot
Constructing phylogenetic trees efficiently using compatibility criteria
inferred← citeshttps://doi.org/10.1080/10635150802422308openalex-snapshot
A Justification for Reporting the Majority-Rule Consensus Tree in Bayesian Phylogenetics
inferred← citeshttps://doi.org/10.1089/106652701300099119openalex-snapshot
Perfect Phylogenetic Networks with Recombination
inferred← citeshttps://doi.org/10.1089/cmb.1996.3.275openalex-snapshot
Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration, and Optimization
inferred← citeshttps://doi.org/10.1089/cmb.1998.5.377openalex-snapshot
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships
inferred← citeshttps://doi.org/10.1089/cmb.1998.5.391openalex-snapshot
Better Methods for Solving Parsimony and Compatibility
inferred← citeshttps://doi.org/10.1093/molbev/mss264openalex-snapshot
A Method of Alignment Masking for Refining the Phylogenetic Signal of Multiple Sequence Alignments
inferred← citeshttps://doi.org/10.1093/sysbio/syv008openalex-snapshot
Circumstances in Which Parsimony but not Compatibility will be Provably Misleading
inferred← citeshttps://doi.org/10.1109/ciss.2009.5054819openalex-snapshot
Random tree optimization for the construction of the most parsimonious phylogenetic trees
inferred← citeshttps://doi.org/10.1109/ciss.2010.5464727openalex-snapshot
Analysis on the complexity of the problem to construct the most parsimonious phylogenetic trees
inferred← citeshttps://doi.org/10.1109/csb.2003.1227337openalex-snapshot
Efficient reconstruction of phylogenetic networks with constrained recombination
inferred← citeshttps://doi.org/10.1109/fccm.2007.8openalex-snapshot
FPGA Acceleration of Gene Rearrangement Analysis
inferred← citeshttps://doi.org/10.1109/focs.2008.77openalex-snapshot
Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier
inferred← citeshttps://doi.org/10.1109/fscs.1990.89555openalex-snapshot
Inferring evolutionary history from DNA sequences
inferred← citeshttps://doi.org/10.1109/icci.1993.315409openalex-snapshot
The synthesis of two compatible rooted trees in a rooted supertree by an algorithm on sets
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366873openalex-snapshot
A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
inferred← citeshttps://doi.org/10.1109/tcbb.2006.4openalex-snapshot
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard
inferred← citeshttps://doi.org/10.1109/tcbb.2007.1070openalex-snapshot
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
inferred← citeshttps://doi.org/10.1111/j.1095-8312.1991.tb00573.xopenalex-snapshot
A unifying theory for methods of systematic analysis
inferred← citeshttps://doi.org/10.1137/s0097539791222171openalex-snapshot
Inferring Evolutionary History From DNA Sequences
inferred← citeshttps://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferred← citeshttps://doi.org/10.1137/s0097539793244587openalex-snapshot
A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
inferred← citeshttps://doi.org/10.1137/s0097539794279067openalex-snapshot
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
inferred← citeshttps://doi.org/10.1137/s0097539796324636openalex-snapshot
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
inferred← citeshttps://doi.org/10.1142/s0217732321502552openalex-snapshot
Deconstruction hierarchies and locality diagrams of conformal models
inferred← citeshttps://doi.org/10.1142/s0219720004000521openalex-snapshot
OPTIMAL, EFFICIENT RECONSTRUCTION OF PHYLOGENETIC NETWORKS WITH CONSTRAINED RECOMBINATION
inferred← citeshttps://doi.org/10.1142/s0219720004000557openalex-snapshot
ANCESTRAL MAXIMUM LIKELIHOOD OF EVOLUTIONARY TREES IS HARD
inferred← citeshttps://doi.org/10.1142/s0219720006002478openalex-snapshot
CHARACTERIZATION OF THE EXISTENCE OF GALLED-TREE NETWORKS
inferred← citeshttps://doi.org/10.1145/1183907.1183909openalex-snapshot
Finding a maximum likelihood tree is hard
inferred← citeshttps://doi.org/10.1145/279069.279081openalex-snapshot
Better methods for solving parsimony and compatibility
inferred← citeshttps://doi.org/10.1145/372202.372271openalex-snapshot
Perfect phylogenetic networks with recombination
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0099openalex-snapshot
The Fine Structure of Galls in Phylogenetic Networks
inferred← citeshttps://doi.org/10.24963/ijcai.2018/183openalex-snapshot
Conflict Directed Clause Learning for Maximum Weighted Clique Problem
inferred← citeshttps://doi.org/10.53846/goediss-9762openalex-snapshot
Alignment-free Phylogenetic Placement and its Applications
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.