File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
  • Find via Find It@HKUL
Supplementary

Article: Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time

TitleComputing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time
Authors
Lam, TWSung, WKTing, HF
Issue Date1996
PublisherUniversity of Helsinki, Department of Computer Science. The Journal's web site is located at http://www.cs.helsinki.fi/njc/
Citation
Nordic Journal of Computing, 1996, v. 3, p. 295-322 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/88990
ISSN
1236-6064

 

DC FieldValueLanguage
dc.contributor.authorLam, TWen_HK
dc.contributor.authorSung, WKen_HK
dc.contributor.authorTing, HFen_HK
dc.date.accessioned2010-09-06T09:51:00Z-
dc.date.available2010-09-06T09:51:00Z-
dc.date.issued1996en_HK
dc.identifier.citationNordic Journal of Computing, 1996, v. 3, p. 295-322en_HK
dc.identifier.issn1236-6064en_HK
dc.identifier.urihttp://hdl.handle.net/10722/88990-
dc.languageengen_HK
dc.publisherUniversity of Helsinki, Department of Computer Science. The Journal's web site is located at http://www.cs.helsinki.fi/njc/en_HK
dc.relation.ispartofNordic Journal of Computingen_HK
dc.titleComputing the Unrooted Maximum Agreement Subtree in Sub-quadratic Timeen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1236-6064&volume=3&spage=295&epage=322&date=1996&atitle=Computing+the+Unrooted+Maximum+Agreement+Subtree+in+Sub-quadratic+Timeen_HK
dc.identifier.emailLam, TW: twlam@cs.hku.hken_HK
dc.identifier.emailTing, HF: hfting@cs.hku.hken_HK
dc.identifier.authorityLam, TW=rp00135en_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.identifier.hkuros25140en_HK
dc.identifier.issnl1236-6064-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats