This paper outlines the design of a code comparison tool, ctcompare, which use short sequences of lexical tokens from source code as a key in an inverted index to perform the code comparison. This technique allows the comparison of multiple source code trees simultaneously. Other significant features of the tool include the definition of a serialised token stream format which allows the indepen...

Traditionally, rhythmic similarity measures are compared according to how well rhythms may be recognized with them, how efficiently they can be retrieved from a data base, or how well they model human perception and cognition. In contrast, here similarity measures are compared on the basis of how much insight they provide about the structural inter-relationships that exist within families of rh...

© 2 0 0 1 m a s s a c h u s e t t s i n s t i t u t e o f t e c h n o l o g y, c a m b r i d g e , m a 0 2 1 3 9 u s a — w w w. a i. m i t. e d u m a s s a c h u s e t t s i n s t i t u t e o f t e c h n o l o g y — a r t i f i c i a l i n t e l l i g e n c e l a b o r a t o r y 1 ABSTRACT The image comparison operation – assessing how well one image matches another – forms a critical component...

We have developed and used the “CDS document map” based on neural networks (Kohonen maps) http://simbad.u-strasbg.fr/A+A/map.pl In this self-organizing map, documents are gradually clustered by subject themes. The tool is based on keywords associated with the documents. For one selected document, we locate it on the CDS document map and retrieve articles clustered in the same area. The second s...

Similarity plays an important role in many multimedia retrieval applications. However, it often has many facets and its perception is highly subjective – very much depending on a person’s background or retrieval goal. In previous work, we have developed various approaches for modeling and learning individual distance measures as a weighted linear combination of multiple facets in different appl...

This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity we derive a pair-wise distance to compare two symbolic sequences. We show that this covering distance is a semimetric. Few examples are given to show how this string semimetric ...

MOTIVATION The expanding protein sequence and structure databases await methods allowing rapid similarity search. Geometric parameters-dihedral angle between two sequential peptide bond planes (V) and radius of curvature (R) as they appear in pentapeptide fragments in polypeptide chains-are proposed for use in evaluating structural similarity in proteins (VeaR). The parabolic (empirical) functi...

Correct and efficient text classification is a major challenge in today’s world of rapidly increasing amount of accessible electronic text data. Kohonen networks have been applied to document classification with comparable success to other document clustering methods. An important challenge is to devise text similarity metrics that can improve the performance of text classification Kohonen netw...

A method for the quantitative evaluation of structural similarity between protein pairs is developed that makes use of a Delaunay-based topological mapping. The result of the mapping is a three-dimensional array which is representative of the global structural topology and whose elements can be used to construe an integral scoring scheme. This scoring scheme was tested for its dependence on the...

To describe eukaryotic autosomes quantitatively and determine differences between them in terms of amino acid sequences of genes, functional classification of proteins, and complete DNA sequences, we applied two theoretical methods, the Proteome-vector method and the function of degree of disagreement (FDOD) method, that are based on function and sequence similarity respectively, to autosomes f...