The Tversky measure is often used in similarity searching. Here, we use this same measure to explore asymmetric clustering with structure (bit string) descriptors. Groups of compounds are found with common substructures by our Russian Doll method. A form of the Russian Doll algorithm suitable for use with the Daylight Clustering Package will be discussed and the code will be "contrib"uted after Mug 2003.

Presentation slides:

• Link to Presentation