File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Guided forest edit distance: Better structure comparisons by using domain-knowledge

TitleGuided forest edit distance: Better structure comparisons by using domain-knowledge
Authors
Issue Date2007
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), London, ON., Canada, 9-11 July 2007. In Lecture Notes In Computer Science, 2007, v. 4580, p. 195-204 How to Cite?
AbstractWe introduce the guided forest edit distance problem, which measures the similarity of two forests under the guidance of a third forest. We give an efficient algorithm for the problem. Our problem is a natural generalization of many important structure comparison problems such as the forest edit distance problem, constrained sequence alignment problem and the longest constrained common subsequence problem. Our algorithm matches the performance of the best known algorithms for these problems. © Springer-Verlag Berlin Heidelberg 2007.
Persistent Identifierhttp://hdl.handle.net/10722/151906
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorPeng, Zen_US
dc.contributor.authorTing, HFen_US
dc.date.accessioned2012-06-26T06:30:38Z-
dc.date.available2012-06-26T06:30:38Z-
dc.date.issued2007en_US
dc.identifier.citationThe 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), London, ON., Canada, 9-11 July 2007. In Lecture Notes In Computer Science, 2007, v. 4580, p. 195-204en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/151906-
dc.description.abstractWe introduce the guided forest edit distance problem, which measures the similarity of two forests under the guidance of a third forest. We give an efficient algorithm for the problem. Our problem is a natural generalization of many important structure comparison problems such as the forest edit distance problem, constrained sequence alignment problem and the longest constrained common subsequence problem. Our algorithm matches the performance of the best known algorithms for these problems. © Springer-Verlag Berlin Heidelberg 2007.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 Scienceen_US
dc.titleGuided forest edit distance: Better structure comparisons by using domain-knowledgeen_US
dc.typeConference_Paperen_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.scopuseid_2-s2.0-37849024388en_US
dc.identifier.hkuros134754-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-37849024388&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume4580en_US
dc.identifier.spage195en_US
dc.identifier.epage204en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridPeng, Z=8853602300en_US
dc.identifier.scopusauthoridTing, HF=7005654198en_US
dc.customcontrol.immutablesml 160111 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats