Method and computer program product for designing combinatorial arrays
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Dec 30, 2003
Grant Date -
Oct 11, 2001
app pub date -
Feb 28, 2001
filing date -
Feb 29, 2000
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A greedy method for designing combinatorial arrays. An array of reagents are initially selected from a list of candidate reagents in a combinatorial library. The reagents in the array that maximize a design objective are determined in an iterative manner, by examining each variation site in the combinatorial library in a strictly alternating sequence. During each step, each candidate reagent at a given variation site is evaluated by constructing and evaluating the sub-array resulting from the systematic combination of that reagent with the selected reagents at all the other variation sites in the library. The candidate reagents at that variation site are ranked according to the fitness of their respective sub-arrays, and the reagents with the highest fitness are selected. The process is repeated for each variation site in the combinatorial library, until the fitness of the full combinatorial array can no longer be improved.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully