On the public citation graph
Finding Largest Subtrees and Smallest Supertrees
0 signed · 83 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.1006/jagm.1995.1006openalex-snapshot
The Parallel Complexity of Tree Embedding Problems
inferredcites →https://doi.org/10.1007/3-540-58094-8_7openalex-snapshot
Alignment of trees — An alternative to tree edit
inferredcites →https://doi.org/10.1007/3-540-58218-5_16openalex-snapshot
Sequential and parallel algorithms for embedding problems on classes of partial k-trees
inferredcites →https://doi.org/10.1007/3-540-59042-0_91openalex-snapshot
Finding largest common embeddable subtrees
inferredcites →https://doi.org/10.1007/bf00263499openalex-snapshot
Iteration of transformation passes over attributed program trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90170-1openalex-snapshot
Subtree isomorphism is NC reducible to bipartite perfect matching
inferredcites →https://doi.org/10.1016/0020-0190(93)90181-8openalex-snapshot
Kaikoura tree theorems: Computing the maximum agreement subtree
inferredcites →https://doi.org/10.1016/0020-0190(95)00110-xopenalex-snapshot
On the agreement of many trees
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/0166-218x(90)90081-mopenalex-snapshot
Subtree isomorphism is in random NC
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(87)90030-7openalex-snapshot
O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
inferredcites →https://doi.org/10.1016/0304-3975(91)90207-iopenalex-snapshot
Complexity of optimal vector code generation
inferredcites →https://doi.org/10.1016/0304-3975(93)90198-3openalex-snapshot
On finding common subtrees
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferredcites →https://doi.org/10.1016/s0167-5060(08)70324-8openalex-snapshot
Subtree Isomorphism in O(n5/2)
inferredcites →https://doi.org/10.1075/llsee.25.19matopenalex-snapshot
“Linguistic constructions” in transparent intensional logic
inferredcites →https://doi.org/10.1109/sfcs.1989.63475openalex-snapshot
Efficient tree pattern matching
inferredcites →https://doi.org/10.1109/sfcs.1994.365716openalex-snapshot
Optimal evolutionary tree comparison by sparse dynamic programming
inferredcites →https://doi.org/10.1109/sfcs.1994.365717openalex-snapshot
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms
inferredcites →https://doi.org/10.1137/0206053openalex-snapshot
An Analysis of a Good Algorithm for the Subtree Problem
inferredcites →https://doi.org/10.1137/0218062openalex-snapshot
An Analysis of a Good Algorithm for the Subtree Problem, Corrected
inferredcites →https://doi.org/10.1137/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1137/0218082openalex-snapshot
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
inferredcites →https://doi.org/10.1137/s0097539791218202openalex-snapshot
Ordered and Unordered Tree Inclusion
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.5555/313559.313837openalex-snapshot
Tree compatibility and inferring evolutionary history
inferredcites →https://doi.org/10.5555/313852.314079openalex-snapshot
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
inferredcites →https://doi.org/10.5555/314464.314629openalex-snapshot
Fast comparison of evolutionary trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/wcms.5openalex-snapshot
Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review
inferred← citeshttps://doi.org/10.1006/jagm.2001.1163openalex-snapshot
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
inferred← citeshttps://doi.org/10.1007/11531371_38openalex-snapshot
An Experiment on the Matching and Reuse of XML Schemas
inferred← citeshttps://doi.org/10.1007/11533719_14openalex-snapshot
On the Approximation of Computing Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/11563952_100openalex-snapshot
Approximate Common Structures in XML Schema Matching
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_41openalex-snapshot
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_11openalex-snapshot
2D-Structure Drawings of Similar Molecules
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_13openalex-snapshot
A Faster and Unifying Algorithm for Comparing Trees
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_29openalex-snapshot
Finding Smallest Supertrees Under Minor Containment
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_18openalex-snapshot
A Survey of Graph Mining Techniques for Biological Datasets
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_5openalex-snapshot
Graph-Based Methods for Rational Drug Design
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_28openalex-snapshot
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_15openalex-snapshot
Maximum Agreement and Compatible Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-642-14980-1_1openalex-snapshot
From Region Based Image Representation to Object Discovery and Recognition
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_28openalex-snapshot
Dichotomies for Tree Minor Containment with Structural Parameters
inferred← citeshttps://doi.org/10.1007/s00026-025-00803-9openalex-snapshot
A Counterexample to the Order Relation Between Largest Common Subtree and Smallest Common Supertree
inferred← citeshttps://doi.org/10.1007/s10044-021-00971-3openalex-snapshot
Customizable HMM-based measures to accurately compare tree sets
inferred← citeshttps://doi.org/10.1007/s10479-006-6163-1openalex-snapshot
A management system for decompositions in stochastic programming
inferred← citeshttps://doi.org/10.1007/s10878-009-9220-2openalex-snapshot
On the parameterized complexity of the Multi-MCT and Multi-MCST problems
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.023openalex-snapshot
A fast discovery algorithm for large common connected induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.image.2007.05.004openalex-snapshot
A heuristic for the retrieval of objects in video in the framework of the rough indexing paradigm
inferred← citeshttps://doi.org/10.1016/j.jda.2006.08.005openalex-snapshot
Maximum agreement and compatible supertrees
inferred← citeshttps://doi.org/10.1016/j.jtbi.2014.10.001openalex-snapshot
Comparing and distinguishing the structure of biological branching
inferred← citeshttps://doi.org/10.1016/j.patcog.2015.05.010openalex-snapshot
Improving skeletal shape abstraction using multiple optimal solutions
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.030openalex-snapshot
A survey on tree edit distance and related problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.031openalex-snapshot
An algebraic view of the relation between largest common subtrees and smallest common supertrees
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114984openalex-snapshot
Dichotomies for tree minor containment with structural parameters
inferred← citeshttps://doi.org/10.1021/jm050078wopenalex-snapshot
Multiple-Ligand-Based Virtual Screening: Methods and Applications of the MTree Approach
inferred← citeshttps://doi.org/10.1086/431283openalex-snapshot
Congruence, Consensus, and the Comparative Phylogeography of Codistributed Species in California
inferred← citeshttps://doi.org/10.1109/bigdatacongress.2015.32openalex-snapshot
Tree Matching Using Data Shaping
inferred← citeshttps://doi.org/10.1109/cbmi.2007.385404openalex-snapshot
A Heuristic for the Retrieval of Objects in Low Resolution Video
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2016.122openalex-snapshot
Online Distance Measurement for Tree Data Event Streams
inferred← citeshttps://doi.org/10.1109/fskd.2012.6233991openalex-snapshot
OMIM data - standardized input and pair-wise comparison
inferred← citeshttps://doi.org/10.1109/icde.2005.276openalex-snapshot
Schema update operations preserving the expressive power in XML databases
inferred← citeshttps://doi.org/10.1109/icdsca53499.2021.9650214openalex-snapshot
Maximum Similarity Directed Subgraph Searching Algorithm on Subjective Logic
inferred← citeshttps://doi.org/10.1109/tcbb.2006.39openalex-snapshot
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems
inferred← citeshttps://doi.org/10.1109/tcbb.2009.29openalex-snapshot
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
inferred← citeshttps://doi.org/10.1109/tpami.2008.24openalex-snapshot
Unsupervised Category Modeling, Recognition, and Segmentation in Images
inferred← citeshttps://doi.org/10.1137/120897559openalex-snapshot
Fixed-Parameter Algorithms for Finding Agreement Supertrees
inferred← citeshttps://doi.org/10.1142/s0129054100000259openalex-snapshot
FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT
inferred← citeshttps://doi.org/10.1145/1497290.1497299openalex-snapshot
Linear time 3-approximation for the MAST problem
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2010.00838openalex-snapshot
Research on finding connected maximal common subgraph
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.33openalex-snapshot
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
inferred← citeshttps://doi.org/10.46298/arima.9107openalex-snapshot
Accurate comparison of tree sets using HMM-based descriptor vectors
inferred← citeshttps://doi.org/10.46793/match.97-2.12126openalex-snapshot
Exact Enumeration of All Connected Maximum
inferred← citeshttps://doi.org/10.5072/zenodo.243158openalex-snapshot
MODELING HARMONIC SIMILARITY USING A GENERATIVE GRAMMAR OF TONAL HARMONY
inferred← citeshttps://doi.org/10.7155/jgaa.00131openalex-snapshot
Efficient drawing of RNA secondary structure
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.