会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • Concurrent Optimization In Selection of Primer and Capture Probe Sets for Nucleic Acid Analysis
    • 选择用于核酸分析的引物和捕获探针组的并行优化
    • US20100021909A1
    • 2010-01-28
    • US12502725
    • 2009-07-14
    • Michael SeulTatiana VenerXiongWu Xia
    • Michael SeulTatiana VenerXiongWu Xia
    • C12Q1/68
    • C12Q1/6876C12Q2600/16G06F19/20G06F19/22
    • Disclosed is a method of iteratively optimizing two (or more) interrelated sets of probes for the multi-step analysis of sets of designated sequences, each such sequence requiring, for conversion, at least one conversion probe (“primer”), and each converted sequence requiring, for detection, at least one capture probe. The iterative method disclosed herein for the concurrent optimization of primer and probe selection invokes fast logical string matching functions to perform a complete cross-correlation of probe sequences and target sequences. The score function assigns to each probe-target alignment a “degree of matching” score on the basis of position-weighted Hamming distance functions introduced herein. Pairs of probes in the final selection may differ in several positions, while other pairs of probes may differ in only a single position. Not all such positions are of equal importance, and a score function is introduced, reflecting the position of the mismatch within the probe sequence.
    • 公开了一种迭代优化两个(或多个)相互关联的探针组的方法,用于多步分析指定序列组,每个这样的序列需要用于转化的至少一个转化探针(“引物”),并且每个转化 用于检测至少一个捕获探针的序列。 本文公开的用于并行优化引物和探针选择的迭代方法调用快速逻辑串匹配函数来执行探针序列和靶序列的完全互相关。 得分函数根据本文介绍的位置加权汉明距离函数将每个探针 - 目标对准分配给“匹配度”得分。 最终选择中的一对探针在几个位置可能有所不同,而其他探针对只能在一个位置上不同。 并不是所有这样的位置都是同等重要的,并且引入了分数函数,反映了探针序列内不匹配的位置。
    • 6. 发明授权
    • Concurrent optimization in selection of primer and capture probe sets for nucleic acid analysis
    • 选择引物和捕获探针组进行核酸分析的并发优化
    • US07970553B2
    • 2011-06-28
    • US12502725
    • 2009-07-14
    • Michael SeulTatiana VenerXiongwu Xia
    • Michael SeulTatiana VenerXiongwu Xia
    • G01N33/48
    • C12Q1/6876C12Q2600/16G06F19/20G06F19/22
    • Disclosed is a method of iteratively optimizing two (or more) interrelated sets of probes for the multi-step analysis of sets of designated sequences, each such sequence requiring, for conversion, at least one conversion probe (“primer”), and each converted sequence requiring, for detection, at least one capture probe. The iterative method disclosed herein for the concurrent optimization of primer and probe selection invokes fast logical string matching functions to perform a complete cross-correlation of probe sequences and target sequences. The score function assigns to each probe-target alignment a “degree of matching” score on the basis of position-weighted Hamming distance functions introduced herein. Pairs of probes in the final selection may differ in several positions, while other pairs of probes may differ in only a single position. Not all such positions are of equal importance, and a score function is introduced, reflecting the position of the mismatch within the probe sequence.
    • 公开了一种迭代优化两个(或多个)相互关联的探针组的方法,用于多步分析指定序列集合,每个这样的序列需要转化至少一个转化探针(“引物”),并且每个转化 用于检测至少一个捕获探针的序列。 本文公开的用于并行优化引物和探针选择的迭代方法调用快速逻辑串匹配函数来执行探针序列和靶序列的完全互相关。 得分函数根据本文介绍的位置加权汉明距离函数将每个探针 - 目标对准分配给“匹配度”得分。 最终选择中的一对探针在几个位置可能有所不同,而其他探针对只能在一个位置上不同。 并不是所有这样的位置都是同等重要的,并且引入了分数函数,反映了探针序列内不匹配的位置。
    • 7. 发明申请
    • CONCURRENT OPTIMIZATION IN SELECTION OF PRIMER AND CAPTURE PROBE SETS FOR NUCLEIC ACID ANALYSIS
    • 选择核酸分析初始化和捕获探针组的同时优化
    • US20120190585A1
    • 2012-07-26
    • US13169201
    • 2011-06-27
    • Michael SeulTatiana VenerXiongwu Xia
    • Michael SeulTatiana VenerXiongwu Xia
    • C40B50/02
    • C12Q1/6876C12Q2600/16G16B25/00G16B30/00
    • Disclosed is a method of iteratively optimizing two (or more) interrelated sets of probes for the multi-step analysis of sets of designated sequences, each such sequence requiring, for conversion, at least one conversion probe (“primer”), and each converted sequence requiring, for detection, at least one capture probe. The iterative method disclosed herein for the concurrent optimization of primer and probe selection invokes fast logical string matching functions to perform a complete cross-correlation of probe sequences and target sequences. The score function assigns to each probe-target alignment a “degree of matching” score on the basis of position-weighted Hamming distance functions introduced herein. Pairs of probes in the final selection may differ in several positions, while other pairs of probes may differ in only a single position. Not all such positions are of equal importance, and a score function is introduced, reflecting the position of the mismatch within the probe sequence.
    • 公开了一种迭代优化两个(或多个)相互关联的探针组的方法,用于多步分析指定序列集合,每个这样的序列需要转化至少一个转化探针(“引物”),并且每个转化 用于检测至少一个捕获探针的序列。 本文公开的用于并行优化引物和探针选择的迭代方法调用快速逻辑串匹配函数来执行探针序列和靶序列的完全互相关。 得分函数根据本文介绍的位置加权汉明距离函数将每个探针 - 目标对准分配给“匹配度”得分。 最终选择中的一对探针在几个位置可能有所不同,而其他探针对只能在一个位置上不同。 并不是所有这样的位置都是同等重要的,并且引入了分数函数,反映了探针序列内不匹配的位置。
    • 8. 发明授权
    • Concurrent optimization in selection of primer and capture probe sets for nucleic acid analysis
    • 选择引物和捕获探针组进行核酸分析的并发优化
    • US07574305B2
    • 2009-08-11
    • US10892514
    • 2004-07-15
    • Michael SeulTatiana VenerXiongwu Xia
    • Michael SeulTatiana VenerXiongwu Xia
    • G06F19/00
    • C12Q1/6876C12Q2600/16G06F19/20G06F19/22
    • Disclosed is a method of iteratively optimizing two (or more) interrelated sets of probes for the multi-step analysis of sets of designated sequences, each such sequence requiring, for conversion, at least one conversion probe (“primer”), and each converted sequence requiring, for detection, at least one capture probe. The iterative method disclosed herein for the concurrent optimization of primer and probe selection invokes fast logical string matching functions to perform a complete cross-correlation of probe sequences and target sequences. The score function assigns to each probe-target alignment a “degree of matching” score on the basis of position-weighted Hamming distance functions introduced herein. Pairs of probes in the final selection may differ in several positions, while other pairs of probes may differ in only a single position. Not all such positions are of equal importance, and a score function is introduced, reflecting the position of the mismatch within the probe sequence.
    • 公开了一种迭代优化两个(或多个)相互关联的探针组的方法,用于多步分析指定序列集合,每个这样的序列需要转化至少一个转化探针(“引物”),并且每个转化 用于检测至少一个捕获探针的序列。 本文公开的用于并行优化引物和探针选择的迭代方法调用快速逻辑串匹配函数来执行探针序列和靶序列的完全互相关。 得分函数根据本文介绍的位置加权汉明距离函数将每个探针 - 目标对准分配给“匹配度”得分。 最终选择中的一对探针在几个位置可能有所不同,而其他探针对只能在一个位置上不同。 并不是所有这样的位置都是同等重要的,并且引入了分数函数,反映了探针序列内不匹配的位置。