File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees

TitleAn O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Authors
KeywordsDesign Of Algorithms
Maximum Agreement Subtree
Phylogenetic Analysis
Issue Date2006
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl
Citation
Information Processing Letters, 2006, v. 100 n. 4, p. 137-144 How to Cite?
AbstractThis paper introduces the maximum constrained agreement subtree problem, which is a generalization of the classical maximum agreement subtree problem. This new problem is motivated by the understood constraint when we compare the evolutionary trees. We give an O (n log n)-time algorithm for solving the problem when the input trees are binary. The time complexity of our algorithm matches the fastest known algorithm for the maximum agreement subtree problem for binary trees. © 2006 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152344
ISSN
2015 Impact Factor: 0.605
2015 SCImago Journal Rankings: 0.698
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorPeng, ZSen_US
dc.contributor.authorTing, HFen_US
dc.date.accessioned2012-06-26T06:37:20Z-
dc.date.available2012-06-26T06:37:20Z-
dc.date.issued2006en_US
dc.identifier.citationInformation Processing Letters, 2006, v. 100 n. 4, p. 137-144en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/10722/152344-
dc.description.abstractThis paper introduces the maximum constrained agreement subtree problem, which is a generalization of the classical maximum agreement subtree problem. This new problem is motivated by the understood constraint when we compare the evolutionary trees. We give an O (n log n)-time algorithm for solving the problem when the input trees are binary. The time complexity of our algorithm matches the fastest known algorithm for the maximum agreement subtree problem for binary trees. © 2006 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/iplen_US
dc.relation.ispartofInformation Processing Lettersen_US
dc.subjectDesign Of Algorithmsen_US
dc.subjectMaximum Agreement Subtreeen_US
dc.subjectPhylogenetic Analysisen_US
dc.titleAn O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary treesen_US
dc.typeArticleen_US
dc.identifier.emailTing, HF:hfting@cs.hku.hken_US
dc.identifier.authorityTing, HF=rp00177en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.ipl.2006.06.013en_US
dc.identifier.scopuseid_2-s2.0-33747481728en_US
dc.identifier.hkuros134743-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33747481728&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume100en_US
dc.identifier.issue4en_US
dc.identifier.spage137en_US
dc.identifier.epage144en_US
dc.identifier.isiWOS:000240572600002-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridPeng, ZS=8853602300en_US
dc.identifier.scopusauthoridTing, HF=7005654198en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats