On the public citation graph

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

0 signed · 374 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.1137/0202024openalex-snapshot
Set Merging Algorithms
inferredcites →https://doi.org/10.1137/0208017openalex-snapshot
Equivalences among Relational Expressions
inferredcites →https://doi.org/10.1145/320071.320072openalex-snapshot
Optimization of query evaluation algorithms
inferredcites →https://doi.org/10.1145/320107.320112openalex-snapshot
Efficient optimization of a class of relational expressions
inferredcites →https://doi.org/10.1145/320473.320479openalex-snapshot
Decomposition—a strategy for query processing
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118301081.biblioopenalex-snapshot
Bibliography
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.1999.0662openalex-snapshot
Tree Representations of Non-symmetric Group-Valued Proximities
inferred← citeshttps://doi.org/10.1006/jagm.1996.0035openalex-snapshot
Determining the Evolutionary Tree Using Experiments
inferred← citeshttps://doi.org/10.1006/jagm.1999.1033openalex-snapshot
Decremental Dynamic Connectivity
inferred← citeshttps://doi.org/10.1006/jagm.2000.1116openalex-snapshot
Algorithmic Aspects of Tree Amalgamation
inferred← citeshttps://doi.org/10.1007/11557067_8openalex-snapshot
Using Semi-definite Programming to Enhance Supertree Resolvability
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_1openalex-snapshot
Dynamic Graph Algorithms with Applications
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_14openalex-snapshot
Incomplete Directed Perfect Phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_42openalex-snapshot
Supertrees by Flipping
inferred← citeshttps://doi.org/10.1007/3-540-45784-4_41openalex-snapshot
Modified Mincut Supertrees
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot
Tree contractions and evolutionary trees
inferred← citeshttps://doi.org/10.1007/978-1-0716-3838-5_1openalex-snapshot
The Theory of Gene Family Histories
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_1openalex-snapshot
New uses for old phylogenies
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_11openalex-snapshot
Some Desiderata for Liberal Supertrees
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_3openalex-snapshot
An Assessment of Matrix Representation with Compatibility in Supertree Construction
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_4openalex-snapshot
MRF 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-4020-2330-9_8openalex-snapshot
Supertree Algorithms for Nested Taxa
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_92openalex-snapshot
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
inferred← citeshttps://doi.org/10.1007/978-1-59745-251-9_7openalex-snapshot
Trees from Trees: Construction of Phylogenetic Supertrees Using Clann
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_10openalex-snapshot
Reconstructing the History of Syntenies Through Super-Reconciliation
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_7openalex-snapshot
Taxonomic Supertree Construction with Incertae sedis Taxa
inferred← citeshttps://doi.org/10.1007/978-3-030-20242-2_1openalex-snapshot
Computing a Consensus Phylogeny via Leaf Removal
inferred← citeshttps://doi.org/10.1007/978-3-030-57821-3_12openalex-snapshot
Testing the Agreement of Trees with Internal Labels
inferred← citeshttps://doi.org/10.1007/978-3-030-74432-8_6openalex-snapshot
Best Match Graphs With Binary Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_23openalex-snapshot
Complexity and Algorithms for MUL-Tree Pruning
inferred← citeshttps://doi.org/10.1007/978-3-031-58072-7_5openalex-snapshot
REvolutionH-tl: Reconstruction of Evolutionary Histories tool
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_15openalex-snapshot
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_10openalex-snapshot
Simultaneously Building and Reconciling a Synteny Tree
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-21233-3_8openalex-snapshot
Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis
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-41324-2_21openalex-snapshot
From Sequence Data Including Orthologs, Paralogs, and Xenologs to Gene and Species Trees
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-91938-6_4openalex-snapshot
Polynomial-Time Algorithms for Phylogenetic Inference Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_36openalex-snapshot
Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome
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-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-31856-9_9openalex-snapshot
The Core of a Countably Categorical Structure
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_14openalex-snapshot
Efficient Generation of Uniform Samples from Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_28openalex-snapshot
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
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-92182-0_43openalex-snapshot
Constructing the Simplest Possible Phylogenetic Network from Triplets
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-540-92800-3_8openalex-snapshot
Constraint Satisfaction Problems with Infinite Templates
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-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-02441-2_25openalex-snapshot
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-04141-9_4openalex-snapshot
Modeling and Extracting Deep-Web Query Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_121openalex-snapshot
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
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-16001-1_16openalex-snapshot
Polynomial Supertree Methods Revisited
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-22685-4_4openalex-snapshot
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
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-22993-0_45openalex-snapshot
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_76openalex-snapshot
Algorithms for Building Consensus MUL-trees
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_92-2openalex-snapshot
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
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-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-662-48221-6_5openalex-snapshot
Orthology Relation and Gene Tree Correction: Complexity Results
inferred← citeshttps://doi.org/10.1007/bf01188585openalex-snapshot
A robust model for finding optimal evolutionary trees
inferred← citeshttps://doi.org/10.1007/bf01202270openalex-snapshot
An efficient algorithm for supertrees
inferred← citeshttps://doi.org/10.1007/bf01894196openalex-snapshot
Tree enumeration modulo a consensus
inferred← citeshttps://doi.org/10.1007/bf02618470openalex-snapshot
The complexity of reconstructing trees from qualitative characters and subtrees
inferred← citeshttps://doi.org/10.1007/bfb0045080openalex-snapshot
On the complexity of computing evolutionary trees
inferred← citeshttps://doi.org/10.1007/pl00009268openalex-snapshot
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology
inferred← citeshttps://doi.org/10.1007/s00026-006-0272-zopenalex-snapshot
Extending the Limits of Supertree Methods
inferred← citeshttps://doi.org/10.1007/s00026-009-0017-xopenalex-snapshot
Groves of Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/s00224-004-1155-5openalex-snapshot
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
inferred← citeshttps://doi.org/10.1007/s00224-025-10259-2openalex-snapshot
FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees
inferred← citeshttps://doi.org/10.1007/s00285-012-0525-xopenalex-snapshot
Orthology relations, symbolic ultrametrics, and cographs
inferred← citeshttps://doi.org/10.1007/s00285-013-0683-5openalex-snapshot
Trinets encode tree-child and level-2 phylogenetic networks
inferred← citeshttps://doi.org/10.1007/s00285-015-0950-8openalex-snapshot
Determining phylogenetic networks from inter-taxa distances
inferred← citeshttps://doi.org/10.1007/s00285-018-1260-8openalex-snapshot
Reconstructing gene trees from Fitch’s xenology relation
inferred← citeshttps://doi.org/10.1007/s00285-019-01332-9openalex-snapshot
Best match graphs
inferred← citeshttps://doi.org/10.1007/s00285-019-01444-2openalex-snapshot
Reciprocal best match graphs
inferred← citeshttps://doi.org/10.1007/s00285-020-01533-7openalex-snapshot
Caterpillars on three and four leaves are sufficient to reconstruct binary normal networks
inferred← citeshttps://doi.org/10.1007/s00285-021-01631-0openalex-snapshot
Indirect identification of horizontal gene transfer
inferred← citeshttps://doi.org/10.1007/s00285-021-01654-7openalex-snapshot
Trinets encode orchard phylogenetic networks
inferred← citeshttps://doi.org/10.1007/s00285-022-01746-yopenalex-snapshot
Classes of explicit phylogenetic networks and their biological and mathematical significance
inferred← citeshttps://doi.org/10.1007/s00357-018-9274-xopenalex-snapshot
Three-Way Symbolic Tree-Maps and Ultrametrics
inferred← citeshttps://doi.org/10.1007/s00453-004-1147-5openalex-snapshot
Rooted Maximum Agreement Supertrees
inferred← citeshttps://doi.org/10.1007/s00453-009-9333-0openalex-snapshot
Constructing the Simplest Possible Phylogenetic Network from Triplets
inferred← citeshttps://doi.org/10.1007/s00453-012-9659-xopenalex-snapshot
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets
inferred← citeshttps://doi.org/10.1007/s00453-012-9698-3openalex-snapshot
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s00453-015-0069-8openalex-snapshot
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
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/s10601-007-9040-xopenalex-snapshot
Combining Tree Partitioning, Precedence, and Incomparability Constraints
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-017-0275-4openalex-snapshot
Binets: Fundamental Building Blocks for Phylogenetic Networks
inferred← citeshttps://doi.org/10.1007/s11538-018-0419-1openalex-snapshot
Phylogenetic Flexibility via Hall-Type Inequalities and Submodularity
inferred← citeshttps://doi.org/10.1007/s12064-023-00398-wopenalex-snapshot
Clustering systems of phylogenetic networks
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90008-3openalex-snapshot
Algebraic dependencies
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00074-2openalex-snapshot
Reconstruction of rooted trees from subtrees
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90092-1openalex-snapshot
Applications of scheduling theory to formal language theory
inferred← citeshttps://doi.org/10.1016/b978-0-12-800049-6.00222-5openalex-snapshot
Supertree Methods, Phylogenetic
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.amc.2007.03.077openalex-snapshot
An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
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.artint.2023.103880openalex-snapshot
Solving infinite-domain CSPs using the patchwork property
inferred← citeshttps://doi.org/10.1016/j.bulm.2004.04.006openalex-snapshot
Constructing rooted supertrees using distances
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.2019.06.015openalex-snapshot
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.015openalex-snapshot
Quasi-best match graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.007openalex-snapshot
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods
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.2023.105082openalex-snapshot
Building a small and informative phylogenetic supertree
inferred← citeshttps://doi.org/10.1016/j.ins.2006.12.004openalex-snapshot
Graph-theoretic method for merging security system specifications
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106664openalex-snapshot
Efficient reconstruction of arboreal networks
inferred← citeshttps://doi.org/10.1016/j.jda.2006.08.005openalex-snapshot
Maximum agreement and compatible supertrees
inferred← citeshttps://doi.org/10.1016/j.jda.2009.01.004openalex-snapshot
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
inferred← citeshttps://doi.org/10.1016/j.jda.2013.06.001openalex-snapshot
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.jtbi.2016.06.016openalex-snapshot
Some axiomatic limitations for consensus and supertree functions on hierarchies
inferred← citeshttps://doi.org/10.1016/j.jtbi.2019.110144openalex-snapshot
NCHB: A method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
inferred← citeshttps://doi.org/10.1016/j.jtbi.2025.112236openalex-snapshot
“Normal” phylogenetic networks may be emerging as the leading class
inferred← citeshttps://doi.org/10.1016/j.mbs.2006.11.005openalex-snapshot
Closure operations in phylogenetics
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.2006.10.028openalex-snapshot
Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
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.2013.10.015openalex-snapshot
Optimizing tree and character compatibility across several phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.021openalex-snapshot
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
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.037openalex-snapshot
Complexity of modification problems for best match graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.027openalex-snapshot
MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.tpb.2026.01.001openalex-snapshot
Strategies for resolving cellular phylogenies from sequential lineage tracing data
inferred← citeshttps://doi.org/10.1016/j.tree.2004.03.015openalex-snapshot
The evolution of supertrees
inferred← citeshttps://doi.org/10.1016/s0076-6879(05)95038-6openalex-snapshot
Supertree Construction in the Genomic Age
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00202-xopenalex-snapshot
A supertree method for rooted trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00250-0openalex-snapshot
Reconstructing minimal rooted trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00160-2openalex-snapshot
The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees
inferred← citeshttps://doi.org/10.1016/s0169-5347(97)01242-1openalex-snapshot
Phylogenetic supertrees: Assembling the trees of life
inferred← citeshttps://doi.org/10.1016/s1360-1385(03)00165-1openalex-snapshot
The challenge of constructing large phylogenetic trees
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00222-7openalex-snapshot
On the Complexity of Inferring Rooted Evolutionary Trees
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1017/cbo9781139019767openalex-snapshot
Basic Phylogenetic Combinatorics
inferred← citeshttps://doi.org/10.1017/jsl.2016.37openalex-snapshot
THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION
inferred← citeshttps://doi.org/10.1017/s1471068415000265openalex-snapshot
Optimizing phylogenetic supertrees using answer set programming
inferred← citeshttps://doi.org/10.1023/a:1009833626004openalex-snapshot
On the Complexity of Constructing Evolutionary Trees
inferred← citeshttps://doi.org/10.1023/b:joco.0000021936.04215.68openalex-snapshot
Constructing the Maximum Consensus Tree from Rooted Triples
inferred← citeshttps://doi.org/10.1038/s41598-020-79484-8openalex-snapshot
Phylogenetic supertree reveals detailed evolution of SARS-CoV-2
inferred← citeshttps://doi.org/10.1071/sb07006openalex-snapshot
Construction and annotation of large phylogenetic trees
inferred← citeshttps://doi.org/10.1073/pnas.1205818109openalex-snapshot
Phylogenomics and a posteriori data partitioning resolve the Cretaceous angiosperm radiation Malpighiales
inferred← citeshttps://doi.org/10.1073/pnas.1412770112openalex-snapshot
Phylogenomics with paralogs
inferred← citeshttps://doi.org/10.1080/01621459.2016.1240081openalex-snapshot
Statistical Tests for Large Tree-Structured Data
inferred← citeshttps://doi.org/10.1080/10635150490423719openalex-snapshot
Performance of Flip Supertree Construction with a Heuristic Algorithm
inferred← citeshttps://doi.org/10.1080/10635150490522728openalex-snapshot
Molecular Clock Fork Phylogenies: Closed Form Analytic Maximum Likelihood Solutions
inferred← citeshttps://doi.org/10.1080/10635150500481556openalex-snapshot
Discriminating Supported and Unsupported Relationships in Supertrees Using Triplets
inferred← citeshttps://doi.org/10.1080/10635150500541649openalex-snapshot
Fast Computation of Supertrees for Compatible Phylogenies with Nested Taxa
inferred← citeshttps://doi.org/10.1080/10635150590949832openalex-snapshot
The Shape of Supertrees to Come: Tree Shape Related Properties of Fourteen Supertree Methods
inferred← citeshttps://doi.org/10.1080/10635150590950362openalex-snapshot
Measuring Support and Finding Unsupported Relationships in Supertrees
inferred← citeshttps://doi.org/10.1080/10635150701639754openalex-snapshot
PhySIC: A Veto Supertree Method with Desirable Properties
inferred← citeshttps://doi.org/10.1080/10635159950173870openalex-snapshot
Points of View Simple but Fundamental Limitations on Supertree and Consensus Tree Methods
inferred← citeshttps://doi.org/10.1089/cmb.2012.0008openalex-snapshot
Polynomial-Time Algorithms for Building a Consensus MUL-Tree
inferred← citeshttps://doi.org/10.1089/cmb.2017.0256openalex-snapshot
Determining the Consistency of Resolved Triplets and Fan Triplets
inferred← citeshttps://doi.org/10.1089/cmb.2019.0269openalex-snapshot
Computing a Consensus Phylogeny via Leaf Removal
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.002.0004openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.002.0005openalex-snapshot
PREFACE
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0001openalex-snapshot
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0002openalex-snapshot
PRELIMINARIES AND AGREEMENTS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0003openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY—A PRIMER
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0004openalex-snapshot
VERTEX COVER—AN ILLUSTRATIVE EXAMPLE
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0005openalex-snapshot
THE ART OF PROBLEM PARAMETERIZATION
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0006openalex-snapshot
SUMMARY AND CONCLUDING REMARKS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0007openalex-snapshot
DATA REDUCTION AND PROBLEM KERNELS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0008openalex-snapshot
DEPTH-BOUNDED SEARCH TREES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0009openalex-snapshot
DYNAMIC PROGRAMMING
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0010openalex-snapshot
TREE DECOMPOSITIONS OF GRAPHS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0011openalex-snapshot
FURTHER ADVANCED TECHNIQUES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0012openalex-snapshot
SUMMARY AND CONCLUDING REMARKS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0014openalex-snapshot
CONNECTIONS TO APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0015openalex-snapshot
SELECTED CASE STUDIES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0016openalex-snapshot
ZUKUNFTSMUSIK
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa676openalex-snapshot
Triplet-based similarity score for fully multilabeled trees with poly-occurring labels
inferred← citeshttps://doi.org/10.1093/bioinformatics/bth246openalex-snapshot
Supertree algorithms for ancestral divergence dates and nested taxa
inferred← citeshttps://doi.org/10.1093/bioinformatics/btn364openalex-snapshot
EPoS: a modular software framework for phylogenetic analysis
inferred← citeshttps://doi.org/10.1093/biolinnean/blab046openalex-snapshot
Information content of trees: three-taxon statements, inference rules and dependency
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.2.162openalex-snapshot
Inferring Pedigree Graphs from Genetic Distances
inferred← citeshttps://doi.org/10.1093/molbev/msj069openalex-snapshot
Maximum Likelihood Jukes-Cantor Triplets: Analytic Solutions
showing the first 200 of 367 · page through all 367
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.