File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: From constrained to unconstrained maximum agreement subtree in linear time

TitleFrom constrained to unconstrained maximum agreement subtree in linear time
Authors
KeywordsBioinformatics
Consensus
Constrained maximum agreement subtrees
Evolutionary trees
Maximum agreement subtrees
Reduction
Issue Date2008
PublisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00453/index.htm
Citation
Algorithmica (New York), 2008, v. 50 n. 3, p. 369-385 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 in linear time and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST. © 2007 Springer Science+Business Media, LLC.
Persistent Identifierhttp://hdl.handle.net/10722/88899
ISSN
2015 Impact Factor: 0.795
2015 SCImago Journal Rankings: 0.898
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorBerry, Ven_HK
dc.contributor.authorPeng, ZSen_HK
dc.contributor.authorTing, HFen_HK
dc.date.accessioned2010-09-06T09:49:52Z-
dc.date.available2010-09-06T09:49:52Z-
dc.date.issued2008en_HK
dc.identifier.citationAlgorithmica (New York), 2008, v. 50 n. 3, p. 369-385en_HK
dc.identifier.issn0178-4617en_HK
dc.identifier.urihttp://hdl.handle.net/10722/88899-
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 in linear time and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST. © 2007 Springer Science+Business Media, LLC.en_HK
dc.languageengen_HK
dc.publisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00453/index.htmen_HK
dc.relation.ispartofAlgorithmica (New York)en_HK
dc.subjectBioinformaticsen_HK
dc.subjectConsensusen_HK
dc.subjectConstrained maximum agreement subtreesen_HK
dc.subjectEvolutionary treesen_HK
dc.subjectMaximum agreement subtreesen_HK
dc.subjectReductionen_HK
dc.titleFrom constrained to unconstrained maximum agreement subtree in linear timeen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0178-4617&volume=50&issue=3&spage=369&epage=&date=2008&atitle=From+Constrained+To+Unconstrained+Maximum+Agreement+Subtree+In+Linear+Timeen_HK
dc.identifier.emailTing, HF:hfting@cs.hku.hken_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s00453-007-9084-8en_HK
dc.identifier.scopuseid_2-s2.0-38349181274en_HK
dc.identifier.hkuros149513en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38349181274&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume50en_HK
dc.identifier.issue3en_HK
dc.identifier.spage369en_HK
dc.identifier.epage385en_HK
dc.identifier.eissn1432-0541-
dc.identifier.isiWOS:000252251700005-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridBerry, V=7006812494en_HK
dc.identifier.scopusauthoridPeng, ZS=8853602300en_HK
dc.identifier.scopusauthoridTing, HF=7005654198en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats