We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity me...

Similarity measurement between web services is a key solution to benefit from the reuse of the large number of web services freely available in the internet. This paper presents a practical approach that enables an effective measurement of web service similarity based on their interfaces descibed with WSDL. The approach relies on the use of multiple matching techniques and different semantic an...

An induction-based method for retrieving similar cases and/or easily adaptable cases is presented in a 3-steps process : rst, a rule set is learned from a data set ; second, a reformulation of the problem domain is derived from this ruleset ; third, a surface similarity with respect to the reformulated problem appears to be a structural similarity with respect to the initial representation of t...

The recent interest in function of various RNA structures, reflected in the growth of solved RNA structures in PDB, calls for methods for effective and efficient similarity search in RNA structural databases. Here, we propose a method called SETTER (RNA SEcondary sTructurebased TERtiary structure similarity) based on partitioning of RNA structures into so-called generalized secondary structure ...