File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
| Title | An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees |
|---|---|
| Authors | |
| Issue Date | 2004 |
| Publisher | Springer 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? |
| Abstract | This 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 Identifier | http://hdl.handle.net/10722/152367 |
| ISSN | 2020 SCImago Journal Rankings: 0.249 |
| References |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Peng, Z | en_US |
| dc.contributor.author | Ting, H | en_US |
| dc.date.accessioned | 2012-06-26T06:37:39Z | - |
| dc.date.available | 2012-06-26T06:37:39Z | - |
| dc.date.issued | 2004 | en_US |
| dc.identifier.citation | Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3341, p. 754-765 | en_US |
| dc.identifier.issn | 0302-9743 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/152367 | - |
| dc.description.abstract | This 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.language | eng | en_US |
| dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_US |
| dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
| dc.title | An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees | en_US |
| dc.type | Article | en_US |
| dc.identifier.email | Ting, H:hfting@cs.hku.hk | en_US |
| dc.identifier.authority | Ting, H=rp00177 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.scopus | eid_2-s2.0-35048864845 | en_US |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-35048864845&selection=ref&src=s&origin=recordpage | en_US |
| dc.identifier.volume | 3341 | en_US |
| dc.identifier.spage | 754 | en_US |
| dc.identifier.epage | 765 | en_US |
| dc.publisher.place | Germany | en_US |
| dc.identifier.scopusauthorid | Peng, Z=8853602300 | en_US |
| dc.identifier.scopusauthorid | Ting, H=7005654198 | en_US |
| dc.identifier.issnl | 0302-9743 | - |