File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleAn O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Authors
Issue Date2004
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3341, p. 754-765 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. © Springer-Verlag 2004.
Persistent Identifierhttp://hdl.handle.net/10722/152367
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorPeng, Zen_US
dc.contributor.authorTing, Hen_US
dc.date.accessioned2012-06-26T06:37:39Z-
dc.date.available2012-06-26T06:37:39Z-
dc.date.issued2004en_US
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3341, p. 754-765en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/152367-
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. © Springer-Verlag 2004.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.titleAn O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary treesen_US
dc.typeArticleen_US
dc.identifier.emailTing, H:hfting@cs.hku.hken_US
dc.identifier.authorityTing, H=rp00177en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-35048864845en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35048864845&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3341en_US
dc.identifier.spage754en_US
dc.identifier.epage765en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridPeng, Z=8853602300en_US
dc.identifier.scopusauthoridTing, H=7005654198en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats