On the public citation graph

Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters

0 signed · 52 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.
Claim with ORCID
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.
See reference health

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.1006/jagm.1993.1035openalex-snapshot
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
inferredcites →https://doi.org/10.1007/11415770_17openalex-snapshot
A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters
inferredcites →https://doi.org/10.1007/11415770_18openalex-snapshot
Reconstruction of Reticulate Networks from Gene Trees
inferredcites →https://doi.org/10.1007/11415770_43openalex-snapshot
Improved Recombination Lower Bounds for Haplotype Data
inferredcites →https://doi.org/10.1007/11732990openalex-snapshot
Research in Computational Molecular Biology
inferredcites →https://doi.org/10.1007/11758525_107openalex-snapshot
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
inferredcites →https://doi.org/10.1007/11786986_58openalex-snapshot
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
inferredcites →https://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferredcites →https://doi.org/10.1007/978-3-540-73951-7_38openalex-snapshot
Kernelization Algorithms for d-Hitting Set Problems
inferredcites →https://doi.org/10.1007/978-3-642-12683-3openalex-snapshot
Research in Computational Molecular Biology
inferredcites →https://doi.org/10.1007/978-3-642-29627-7openalex-snapshot
Research in Computational Molecular Biology
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/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferredcites →https://doi.org/10.1007/s00453-007-0094-3openalex-snapshot
A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0025-5564(76)90035-3openalex-snapshot
A mathematical foundation for the analysis of cladistic character compatibility
inferredcites →https://doi.org/10.1016/0893-9659(92)90026-6openalex-snapshot
Convex tree realizations of partitions
inferredcites →https://doi.org/10.1016/j.dam.2005.05.044openalex-snapshot
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
inferredcites →https://doi.org/10.1016/j.jcss.2004.12.009openalex-snapshot
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
inferredcites →https://doi.org/10.1016/s1570-8667(03)00009-1openalex-snapshot
An efficient fixed-parameter algorithm for 3-Hitting Set
inferredcites →https://doi.org/10.1086/283157openalex-snapshot
On the Problem of Discovering the Most Parsimonious Tree
inferredcites →https://doi.org/10.1089/10665270360688048openalex-snapshot
Haplotyping as Perfect Phylogeny: A Direct Approach
inferredcites →https://doi.org/10.1089/1066527042432206openalex-snapshot
A Note on Efficient Computation of Haplotypes via Perfect Phylogeny
inferredcites →https://doi.org/10.1089/cmb.2006.0137openalex-snapshot
A Decomposition Theory for Phylogenetic Networks and Incompatible Characters
inferredcites →https://doi.org/10.1089/cmb.2006.13.522openalex-snapshot
A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem
inferredcites →https://doi.org/10.1089/cmb.2006.13.897openalex-snapshot
An Optimal Algorithm for Perfect Phylogeny Haplotyping
inferredcites →https://doi.org/10.1093/bioinformatics/bth149openalex-snapshot
Haplotype reconstruction from genotype data using Imperfect Phylogeny
inferredcites →https://doi.org/10.1093/bioinformatics/btl262openalex-snapshot
Constructing Near-Perfect Phylogenies with multiple homoplasy events
inferredcites →https://doi.org/10.1093/genetics/111.1.147openalex-snapshot
STATISTICAL PROPERTIES OF THE NUMBER OF RECOMBINATION EVENTS IN THE HISTORY OF A SAMPLE OF DNA SEQUENCES
inferredcites →https://doi.org/10.1109/tcbb.2004.23openalex-snapshot
The number of recombination events in a sample history: conflict graph and lower bounds
inferredcites →https://doi.org/10.1109/tcbb.2007.1070openalex-snapshot
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
inferredcites →https://doi.org/10.1137/0406023openalex-snapshot
Triangulating Three-Colored Graphs in Linear Time and Linear Space
inferredcites →https://doi.org/10.1137/s0097539791222171openalex-snapshot
Inferring Evolutionary History From DNA Sequences
inferredcites →https://doi.org/10.1137/s0097539793244587openalex-snapshot
A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
inferredcites →https://doi.org/10.1137/s0097539794279067openalex-snapshot
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
inferredcites →https://doi.org/10.1142/s0219720003000174openalex-snapshot
EFFICIENT RECONSTRUCTION OF HAPLOTYPE STRUCTURE VIA PERFECT PHYLOGENY
inferredcites →https://doi.org/10.1142/s0219720004000521openalex-snapshot
OPTIMAL, EFFICIENT RECONSTRUCTION OF PHYLOGENETIC NETWORKS WITH CONSTRAINED RECOMBINATION
inferredcites →https://doi.org/10.1145/565196.565218openalex-snapshot
Haplotyping as perfect phylogeny
inferredcites →https://doi.org/10.5555/127787.127850openalex-snapshot
Triangulating three-colored graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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-23038-7_10openalex-snapshot
Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters
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.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.tcs.2012.12.048openalex-snapshot
Unique perfect phylogeny is intractable
inferred← citeshttps://doi.org/10.1093/sysbio/syz009openalex-snapshot
A Third Strike Against Perfect Phylogeny
inferred← citeshttps://doi.org/10.1137/130924469openalex-snapshot
Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters
inferred← citeshttps://doi.org/10.1137/15m1021052openalex-snapshot
Minimum Average Distance Clique Trees
inferred← citeshttps://doi.org/10.1186/1748-7188-7-26openalex-snapshot
Constructing perfect phylogenies and proper triangulations for three-state characters
inferred← citeshttps://doi.org/10.1186/1748-7188-8-11openalex-snapshot
Incompatible quartets, triplets, and characters
inferred← citeshttps://doi.org/10.48550/arxiv.1011.5737openalex-snapshot
Unique perfect phylogeny is NP-hard
inferred← citeshttps://doi.org/10.48550/arxiv.1205.5779openalex-snapshot
Improved Lower Bounds on the Compatibility of Multi-State Characters
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.