Impact of different software implementations on the performance of the Maxmin method for diverse subset selection

Schmuker, Michael, Givehchi, Alireza and Schneider, Gisbert (2004) Impact of different software implementations on the performance of the Maxmin method for diverse subset selection. Molecular Diversity, 8 (4). pp. 421-425. ISSN 1381-1991

Full text not available from this repository.

Abstract

Besides the choice of an automated software method for selecting 'maximally diverse' compounds from a large pool of molecules, it is the implementation of the algorithm that critically determines the usefulness of the approach. The speed of execution of two implementations of the Maxmin algorithm is compared for the selection of maximally diverse subsets of large compound collections. Different versions of the software are compared using various C compiler options and Java virtual machines. The analysis shows that the Maxmin algorithm can be implemented in both languages yielding sufficient speed of execution. For large compound libraries the Java version outperformes the C version. While the Java version selects the same compounds independent of the virtual machine used, the C version produces slightly different subsets depending on the compiler and on the optimization settings.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science
Depositing User: michael Schmuker
Date Deposited: 23 Sep 2014 13:33
Last Modified: 23 Sep 2014 13:33
URI: http://sro.sussex.ac.uk/id/eprint/50202
📧 Request an update