File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: An O(nlogn)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
Title | An O(nlogn)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees |
---|---|
Authors | |
Issue Date | 2004 |
Citation | Proceedings of the 15th Annual International Symposium on Algorithms and Computation, p. 754-765 How to Cite? |
Persistent Identifier | http://hdl.handle.net/10722/93273 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Peng, Z | en_HK |
dc.contributor.author | Ting, HF | en_HK |
dc.date.accessioned | 2010-09-25T14:56:07Z | - |
dc.date.available | 2010-09-25T14:56:07Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | Proceedings of the 15th Annual International Symposium on Algorithms and Computation, p. 754-765 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93273 | - |
dc.language | eng | en_HK |
dc.relation.ispartof | Proceedings of the 15th Annual International Symposium on Algorithms and Computation | en_HK |
dc.title | An O(nlogn)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Peng, Z: zspeng@cs.hku.hk | en_HK |
dc.identifier.email | Ting, HF: hfting@cs.hku.hk | en_HK |
dc.identifier.authority | Ting, HF=rp00177 | en_HK |
dc.identifier.hkuros | 109465 | en_HK |
dc.identifier.spage | 754 | en_HK |
dc.identifier.epage | 765 | en_HK |