会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明申请
    • METHOD AND COMPUTER PROGRAM PRODUCT FOR DESIGNING COMBINATORIAL ARRAYS
    • 用于设计组合阵列的方法和计算机程序产品
    • WO0165462A3
    • 2002-03-07
    • PCT/US0106217
    • 2001-02-28
    • DIMENSIONAL PHARM INC
    • AGRAFIOTIS DIMITRIS KLOBANOV VICTOR SSALEMME FRANCIS RAYMOND
    • G01N33/00G01N33/48G01N33/50G01N33/53G06F19/00G11C17/00
    • C40B50/02
    • 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.
    • 一种设计组合阵列的贪心方法。 最初从组合库中的候选试剂列表中选出一组试剂。 通过以严格交替的顺序检查组合库中的每个变异位点,以迭代的方式确定最大化设计目标的阵列中的试剂。 在每个步骤中,通过构建和评估由该试剂与所选择的试剂在文库中的所有其它变体位点的系统组合产生的子阵列来评估给定变体位点处的每种候选试剂。 根据其各个子阵列的适合度对该变异位点处的候选试剂进行排序,并选择具有最高适应度的试剂。 对组合库中的每个变异位点重复该过程,直到完全组合阵列的适应度不能再被改善。