| An improved bound on the Maximum Agreement Subtree problem. | |
| | |
MedLine Citation:
|
PMID: 20161013 Owner: NLM Status: Publisher |
Abstract/OtherAbstract:
|
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same >/= c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves. |
| | |
Authors:
|
Mike Steel; László A Székely |
Related Documents
:
|
10543853 - Maintaining treatment boundaries in small communities and rural areas. 17740293 - Small shared-memory multiprocessors. 6625523 - Problems in toe-to-hand transfers. |
Publication Detail:
|
Type: JOURNAL ARTICLE |
Journal Detail:
|
Title: Applied mathematics letters Volume: 22 ISSN: 0893-9659 ISO Abbreviation: - Publication Date: 2009 Nov |
Date Detail:
|
Created Date: 2010-7-13 Completed Date: - Revised Date: - |
Medline Journal Info:
|
Nlm Unique ID: 101317302 Medline TA: Appl Math Lett Country: - |
Other Details:
|
Languages: ENG Pagination: 1778-1780 Citation Subset: - |
Affiliation:
|
Biomathematics Research Centre, University of Canterbury, New Zealand, M.Steel@math.canterbury.ac.nz. |
Export Citation:
|
APA/MLA Format Download EndNote Download BibTex |
| MeSH Terms | |
Descriptor/Qualifier:
|
|
| Grant Support | |
ID/Acronym/Agency:
|
R01 GM078991-01//NIGMS NIH HHS |
From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine
Previous Document: When less is more and when more is more: The mediating roles of capacity and speed in brain-behavior...
Next Document: Automatic processing of wh- and NP-movement in agrammatic aphasia: Evidence from eyetracking.