On the public citation graph
A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem
0 signed · 29 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/(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)
inferredcites →https://doi.org/10.1006/jagm.1999.1050openalex-snapshot
Some Open Problems in Computational Molecular Biology
inferredcites →https://doi.org/10.1007/3-540-48481-7_28openalex-snapshot
Quartet Cleaning: Improved Algorithms and Simulations
inferredcites →https://doi.org/10.1007/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferredcites →https://doi.org/10.1016/0020-0271(72)90029-0openalex-snapshot
Computers and artificial intelligence
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/s0022-0000(03)00077-1openalex-snapshot
A fixed-parameter algorithm for minimum quartet inconsistency
inferredcites →https://doi.org/10.1016/s0304-3975(99)00028-6openalex-snapshot
A few logs suffice to build (almost) all trees: Part II
inferredcites →https://doi.org/10.1093/bioinformatics/18.10.1297openalex-snapshot
Optimal algorithms for local vertex quartet cleaning
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040454openalex-snapshot
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
inferredcites →https://doi.org/10.1109/sfcs.1998.743492openalex-snapshot
Orchestrating quartets: approximation and data correction
inferredcites →https://doi.org/10.1109/tcbb.2007.1008openalex-snapshot
Quartet-Based Phylogeny Reconstruction with Answer Set Programming
inferredcites →https://doi.org/10.1111/j.2044-8317.1981.tb00626.xopenalex-snapshot
Tree structures for proximity data
inferredcites →https://doi.org/10.1137/s0097539799361683openalex-snapshot
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
inferredcites →https://doi.org/10.1142/9789811259593_0006openalex-snapshot
Computers and Artificial Intelligence
inferredcites →https://doi.org/10.1145/279069.279078openalex-snapshot
From four-taxon trees to phylogenies (preliminary report)
inferredcites →https://doi.org/10.1145/508791.508827openalex-snapshot
Optimal algorithms for local vertex quartet cleaning
inferredcites →https://doi.org/10.1542/peds.2004-0385openalex-snapshot
Perinatal Stroke in Children With Motor Impairment: A Population-Based Study
inferredcites →https://doi.org/10.5555/338219.338265openalex-snapshot
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)
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-1-4939-6613-4_20openalex-snapshot
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
inferred← citeshttps://doi.org/10.1007/978-1-60327-429-6_21openalex-snapshot
Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems
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/s00224-009-9165-yopenalex-snapshot
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
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.tcs.2018.10.005openalex-snapshot
On the Weighted Quartet Consensus problem
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1109/tcbb.2011.108openalex-snapshot
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility
inferred← citeshttps://doi.org/10.3233/fi-2010-311openalex-snapshot
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2017.28openalex-snapshot
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
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.