diversitysel
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
diversitysel [2012/10/13 20:23] – rkiss | diversitysel [2012/10/14 07:30] – [Algorithm] rkiss | ||
---|---|---|---|
Line 48: | Line 48: | ||
===== Algorithm ===== | ===== Algorithm ===== | ||
- | Diversity selection utilizes an optimized implementation of the stepwise elimination algorithm | + | Diversity selection utilizes an optimized implementation of the stepwise elimination algorithm |
* Calculate the similarity matrix of the molecules in the input collection | * Calculate the similarity matrix of the molecules in the input collection | ||
Line 54: | Line 54: | ||
- Select the largest off-diagonal element in the similarity matrix | - Select the largest off-diagonal element in the similarity matrix | ||
- Eliminate one molecule of the most similar molecule pair randomly | - Eliminate one molecule of the most similar molecule pair randomly | ||
- | - Go to step I. if off-diagonal elements remained | + | - Go to step 1. if off-diagonal elements remained |
- 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 while the diversity of the collection is increased. Each elimination step filters out one molecule that has close analogues in the remaining set. As a result, the remaining molecules will have a decreased similarity (increased diversity). | ||
- | The average run time for 10,000 input molecules | + | During this process, the size of the collection |
- | 1) http:// | ||
- | 2) Open Babel v2.3.90 http:// | ||
- | 4) |
diversitysel.txt · Last modified: 2016/12/27 21:16 by rkiss