File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An efficient reduction from constrained to unconstrained maximum agreement subtree

TitleAn efficient reduction from constrained to unconstrained maximum agreement subtree
Authors
Issue Date2005
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 5th International Workshop on Algorithms in Bioinformatics (WABI 2005), Mallorca, Spain, 3-6 October 2005. In Lecture Notes In Computer Science, 2005, v. 3692, p. 104-115 How to Cite?
AbstractWe propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST problem efficiently and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST. © Springer-Verlag Berlin Heidelberg 2005.
Persistent Identifierhttp://hdl.handle.net/10722/151881
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:20Z-
dc.date.available2012-06-26T06:30:20Z-
dc.date.issued2005en_US
dc.identifier.citationThe 5th International Workshop on Algorithms in Bioinformatics (WABI 2005), Mallorca, Spain, 3-6 October 2005. In Lecture Notes In Computer Science, 2005, v. 3692, p. 104-115en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/151881-
dc.description.abstractWe propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST problem efficiently and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST. © Springer-Verlag Berlin Heidelberg 2005.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.titleAn efficient reduction from constrained to unconstrained maximum agreement subtreeen_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.doi10.1007/11557067_9en_US
dc.identifier.scopuseid_2-s2.0-33646195303en_US
dc.identifier.hkuros111888-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33646195303&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3692 LNBIen_US
dc.identifier.spage104en_US
dc.identifier.epage115en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridPeng, ZS=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