LibMCS algorithm

Are there any further information about the algorithm used in the current version of LibMCS apart from this poster (http://www.chemaxon.com/conf/MCS_Based_Hierarchical_Clustering_A4.pdf)?

What kind of fingerprints are used to generate the similarity matrix?

Which similarity threshold is chosen? Which similarity metric (tanimoto?)?

 

Thanks,

Hi,

I'm afraid there's no other publication or white-paper available. 

We used ChemAxon's hashed binary fingerprint, perhaps ECFP that we've implemented recently would be more relevant and could do a better job.

Tanimoto is fine, though we found that the common bit count is more related to the MCS.

And finally, there's no direct similarity threshold used, as that can vary with respect to the particular structure set being cluster. Instead, we store a certain number of elements of the similarity matrix, regardless of their similarity scores.

Hope this helps!

Please tell us more about your use case and expected results!

Regards,
Miklos