DESIGN AND SELECTION OF GENETIC TARGETS FOR SEQUENCE RESOLVED ORGANISM DETECTION AND IDENTIFICATION
    11.
    发明申请
    DESIGN AND SELECTION OF GENETIC TARGETS FOR SEQUENCE RESOLVED ORGANISM DETECTION AND IDENTIFICATION 审中-公开
    设计和选择用于序列​​分解的有机体检测和鉴定的遗传学目标

    公开(公告)号:WO2008024827A2

    公开(公告)日:2008-02-28

    申请号:PCT/US2007/076499

    申请日:2007-08-22

    Abstract: A computer-implemented method as follows. Providing a list of target sequences associated with one or more organisms in a list of organisms. Providing a list of candidate prototype sequences suspected of hybridizing to one or more of the target sequences. Generating a collection of probes corresponding to each candidate prototype sequence, each collection of probes having a set of probes for every subsequence having a predetermined, fixed subsequence length of the corresponding candidate prototype sequence. The sets consist of the corresponding subsequence and every variation of the corresponding subsequence formed by varying a center nucleotide of the corresponding subsequence. Generating a set of fragments corresponding to each target sequence, each set of fragments having every fragment having a predetermined, fixed fragment length of the corresponding target sequence. Calculating the binding free energy of each fragment with a perfect complimentary sequence of the fragment. If any binding free energy is above a predetermined, fixed threshold, the fragment is extended one nucleotide at a time until the binding free energy is below the threshold or the fragment is the same length as the probe, generating a set of extended fragments. Determining which extended fragments are perfect matches to any of the probes. Assembling a base call sequence corresponding to each candidate prototype sequence. The base call sequence has a base call corresponding to the center nucleotide of each probe of the corresponding prototype sequence that is a perfect match to any extended fragment, but for which the other members of the set of probes containing the perfect match probe are not perfect matches to any extended fragment and a non-base call in all other circumstances.

    Abstract translation: 计算机实现的方法如下。 提供与生物体列表中的一种或多种生物相关的靶序列的列表。 提供疑似与一个或多个靶序列杂交的候选原型序列的列表。 产生与每个候选原型序列相对应的探针的集合,每个探针集合具有用于每个子序列的探针组,其具有相应候选原型序列的预定的固定子序列长度。 这些集由相应的子序列和通过改变相应子序列的中心核苷酸形成的相应子序列的每个变化组成。 产生对应于每个靶序列的一组片段,每组片段具有每个片段具有相应靶序列的预定的固定片段长度。 用片段的完美互补序列计算每个片段的结合自由能。 如果任何结合自由能高于预定的固定阈值,则片段一次延伸一个核苷酸,直到结合自由能低于阈值或片段与探针的长度相同,产生一组扩展片段。 确定哪些扩展片段与任何探针完美匹配。 组装对应于每个候选原型序列的基本调用序列。 基本调用序列具有对应于相应原型序列的每个探针的中心核苷酸的碱基调用,其与任何扩展片段完美匹配,但是包含完美匹配探针的探针组的其它成员对于其不是完美的 在任何其他情况下匹配任何扩展片段和非基本调用。

    COMPUTER-IMPLEMENTED BIOLOGICAL SEQUENCE IDENTIFIER SYSTEM AND METHOD
    16.
    发明申请
    COMPUTER-IMPLEMENTED BIOLOGICAL SEQUENCE IDENTIFIER SYSTEM AND METHOD 审中-公开
    计算机实现生物学序列识别系统和方法

    公开(公告)号:WO2006138182A3

    公开(公告)日:2009-04-23

    申请号:PCT/US2006022622

    申请日:2006-06-09

    CPC classification number: G06F19/22 G06F19/18 G06F19/20 Y10S707/99936

    Abstract: A method of: submitting reference sequences to a taxonomic database to produce taxonomic results; and reporting a taxonomic identification based on the taxonomic results. The reference sequences are the output of genetic database queries that return a score for each reference sequence. A method for processing a biological sequence obtained from an assay by: converting base calls located in a predetermined list of positions within the biological sequence to N; and determining the ratio of single nucleotide polymorphisms in the biological sequence relative to a reference sequence. Each entry in the predetermined list of positions represents the capability of a substance hybridizing to a microarray used to generate the biological sequence. The substance is not the nucleic acid of a target pathogen.

    Abstract translation: 一种方法:将参考序列提交给分类数据库以产生分类结果; 并根据分类结果报告分类鉴定。 参考序列是返回每个参考序列得分的遗传数据库查询的输出。 一种用于处理通过以下方式获得的生物学序列的方法:将位于所述生物学序列内的预定位置列表中的碱基呼叫转化为N; 并确定生物序列中单核苷酸多态性相对于参考序列的比例。 预定位置列表中的每个条目表示与用于产生生物序列的微阵列杂交的物质的能力。 该物质不是目标病原体的核酸。

Patent Agency Ranking