Abstract
In order to simplify the reconciliation of two heterogeneous tree databases, we must minimize the number of crossovers in a directed graph constructed using two subtrees selected from the databases. This paper proposes a method for minimizing the number of crossovers in the directed graph. To find the directed graph with the minimum number of crossovers, the method maintains zero-crossovers in each ordered subtree. The resulting directed graph is defined as a semi-optimal solution satisfying the zero-crossover constraint for edges connecting two leaf sequences. It is computed by changing the order of non-leaf nodes in each hierarchical level of the ordered tree and swapping leaf nodes in each of the two leaf layers. To maintain the zero-crossover constraint for each ordered tree in the matrix transformation, the method also finds the two leaf clusters that contain half of the leaf nodes and swaps the leaf clusters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goodman, M., Czelusniak, J., Romero-Herrera, A. E., and Matsuda, G.: Fitting the Gene Lineage into its Species Lineage: A parsimony strategy illustrated by Cladograms Constructed from Globin Sequences, Systematic Zoology, Vol. 28 (1979) 132–168.
Page, R.D.M., and Charleston, M.A.: Reconciled Trees and Incongruent Gene and Species Trees, In: B Mirkin, F R McMorris, F S Roberts and A Rzhetsky (eds), Mathematical Hierarchies in Biology, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Vol. 37 (1997) 57–70.
Yoshida, T., Kondo, T., and Nishida, S.: Discovering Conceptual Differences among Different People via Diverse Structures, Proceedings of the Third Pacific-Asia Conference on Knowledge Discovery and Data Mining, Beijing in China (1999).
De Marsicoi, M., et al.: Indexing Pictorial Documents by their Content, A Survey of Current Techniques, Image and Vision Computing, Vol. 15 (1997) 119–141.
Kanellakis P.: Constraint Programming and Database Languages: A Tutorial, Proc. of ACM POS’95 (1995) 46–53.
Warfield John N.: Crossing Theory and Hierarchy Mapping, IEEE Transaction on Systems, Man, and Cybernetics (1977) 505–523.
Sugiyama K., Tanaka S., and Toda M.: Methods for Visual Understanding of Hierarchical System Structures, IEEE Transaction on Systems, Man, and Cybernetics (1981) 109–125.
Ullman Jeffery D.: Database and Knowledge-Base Systems, Vol. 1, Computer Science Press (1988).
Kitakami Hajime, Mori Yasuma, Arikawa Masatoshi, Sato Akira.: Integration Method for Biological Taxonomy Databases in the Presence of Semantic Heterogeneity, IEICE, Vol. J-82-D1, No. 1 (1999) 303–314.
Saitou Naruya et al.: Phylogenetic Tree Database (JUNGLE), http://smiler.lab.nig.ac.jp/jungle/jungle.html (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitakami, H., Nishimoto, M. (2000). Constraint Satisfaction for Reconciling Heterogeneous Tree Databases. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_58
Download citation
DOI: https://doi.org/10.1007/3-540-44469-6_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67978-3
Online ISBN: 978-3-540-44469-5
eBook Packages: Springer Book Archive