AN ALGORITHM TO FIND AGREEMENT SUBTREES

Authors
KUBICKA E KUBICKI G MCMORRIS FR
Citation
E. Kubicka et al., AN ALGORITHM TO FIND AGREEMENT SUBTREES, Journal of classification, 12(1), 1995, pp. 91-99
Citations number
6
Categorie Soggetti
Social Sciences, Mathematical Methods","Mathematical, Methods, Social Sciences
Journal title
Journal of classification → ACNP
ISSN journal
01764268
Volume
12
Issue
1
Year of publication
1995
Pages
91 - 99
Database
ISI
SICI code
0176-4268(1995)12:1<91:AATFAS>2.0.ZU;2-1
Abstract
Given two binary trees, a largest subtree contained in both of the ori ginal trees that has been obtained by pruning vertices is called an ag reement subtree. An exact algorithm for finding an agreement subtree i s presented.