diversity_selection
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
diversity_selection [2012/07/02 20:50] – [Algorithm] rkiss | diversity_selection [2012/07/03 17:42] – sanmark | ||
---|---|---|---|
Line 16: | Line 16: | ||
* **Similarity threshold**: | * **Similarity threshold**: | ||
- | * **Number | + | * **Max number |
If you do not limit the selection, the full collection will be returned ordered by diversity. This means that the top N molecules in the resulting collection will be the most diverse N molecules. The //maximum similarity// | If you do not limit the selection, the full collection will be returned ordered by diversity. This means that the top N molecules in the resulting collection will be the most diverse N molecules. The //maximum similarity// | ||
Line 44: | Line 44: | ||
- Sort the list of eliminated molecules by similarity values associated to the elimination steps in increasing order | - Sort the list of eliminated molecules by similarity values associated to the elimination steps in increasing order | ||
- | During this process, the size of the collection is reduced | + | During this process, the size of the collection is reduced |
- | + | ||
- | After the algorithm finishes, structures are sorted by similarity | + | |
+ | After the algorithm finishes, structures are sorted by similarity values and are placed in the result collection. The first molecules in the resulted collection are the most dissimilar (most diverse) ones. The length of the result list is determined by input parameters: maximum number of compounds and similarity threshold. | ||
===== Limitations ===== | ===== Limitations ===== | ||
- | The diversity | + | Diversity |
+ | |||
+ | The average run time for 10,000 input molecules about a minute. | ||
===== Changelog ===== | ===== Changelog ===== |