Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,715,044 papers from all fields of science
Search
Sign In
Create Free Account
Maximum agreement subtree problem
The maximum agreement subtree problem is any of several closely related problems problems in graph theory and computer science. In all of these…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computer science
Frequent subtree mining
Homeomorphism (graph theory)
Minimum spanning tree
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Managing and analyzing phylogenetic databases
A. Deepak
2013
Corpus ID: 12821858
The ever growing availability of phylogenomic data makes it increasingly possible to study and analyze phylogenetic relationships…
Expand
2006
2006
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Z. Peng
,
H. Ting
Information Processing Letters
2006
Corpus ID: 42030225
2004
2004
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
Anders Dessmark
,
J. Jansson
,
A. Lingas
,
Eva-Marta Lundell
Algorithmica
2004
Corpus ID: 4576534
AbstractFor a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks…
Expand
2004
2004
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
Z. Peng
,
H. Ting
International Symposium on Algorithms and…
2004
Corpus ID: 46430059
2003
2003
Consensus Algorithms for Trees and Strings
J. Jansson
2003
Corpus ID: 119779532
This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial…
Expand
2002
2002
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
Ganeshkumar Ganapathy
,
T. Warnow
International Workshop on Approximation…
2002
Corpus ID: 14543685
We address a combinatorial problem which arises in computational phylogenetics. In this problem we are given a set of unrooted…
Expand
1996
1996
Sparse dynamic programming for maximum agreement subtree problem
T. Przytycka
Mathematical Hierarchies and Biology
1996
Corpus ID: 32595328
1994
1994
Optimal evolutionary tree comparison by sparse dynamic programming
Martín Farach-Colton
,
M. Thorup
Proceedings 35th Annual Symposium on Foundations…
1994
Corpus ID: 12156126
In computational biology one is often interested in finding the concensus between different evolutionary trees for the same set…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE