Optimal mappings with minimum number of[no-break space]connected components in tree-to-tree comparison problems Export

@article{citeulike:850974, abstract = {In this paper we consider the problem of finding a minimum cost mapping between two unordered trees which induces a graph with a minimum number of connected components. The proposed algorithm is based on the generalization of an algorithm for computing an edit distance between trees, and it solves the stated problem in sequential time precisely in O(|T1|x|T2|x(degT1+degT2)xlog2(degT1+degT2)).}, author = {Ferraro, Pascal and Godin, Christophe}, citeulike-article-id = {850974}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0196-6774(03)00079-8}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6WH3-48Y6N89-4/2/963884fdc1a4ca9dc95d2dbc40fa8638}, doi = {10.1016/S0196-6774(03)00079-8}, journal = {Journal of Algorithms}, keywords = {comparaison, graph, mtg, tree, tree\_metric, virtualplant}, month = {September}, number = {2}, pages = {385--406}, posted-at = {2006-09-20 10:38:10}, priority = {2}, title = {Optimal mappings with minimum number of[no-break space]connected components in tree-to-tree comparison problems}, url = {http://dx.doi.org/10.1016/S0196-6774(03)00079-8}, volume = {48}, year = {2003} }

TY - JOUR ID - citeulike:850974 L3 - citeulike-article-id:850974 N2 - In this paper we consider the problem of finding a minimum cost mapping between two unordered trees which induces a graph with a minimum number of connected components. The proposed algorithm is based on the generalization of an algorithm for computing an edit distance between trees, and it solves the stated problem in sequential time precisely in O(|T1|x|T2|x(degT1+degT2)xlog2(degT1+degT2)). IS - 2 JF - Journal of Algorithms EP - 406 TI - Optimal mappings with minimum number of[no-break space]connected components in tree-to-tree comparison problems VL - 48 SP - 385 KW - comparaison KW - graph KW - mtg KW - tree KW - tree_metric KW - virtualplant AU - Ferraro, Pascal AU - Godin, Christophe PY - 2003/09// UR - http://dx.doi.org/10.1016/S0196-6774(03)00079-8 ER -