公开(公告)号：JP2004259119A

公开(公告)日：2004-09-16

申请号：JP2003050916

申请日：2003-02-27

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： SHIBUYA TETSURO

IPC: C12Q1/68 ,  C40B30/02 ,  G06F17/30 ,  G06F19/00 ,  G06F19/20 ,  G06F19/22

CPC classification number: C40B30/02 ,  C12Q1/6813 ,  G06F19/20 ,  G06F19/22

Abstract: PROBLEM TO BE SOLVED: To provide a system for screening a base sequence, a method for it, a program, a record medium and a server for performing screening for the base sequence. SOLUTION: This computer system for performing screening for a base sequence includes: a step (S10) of storing a target base sequence data and probe base sequence; a step (S12) of generating complementary sequence data from a probe base sequence having the possibility to be coupled to the target base sequence and storing the maximum edit distance permitted between the target base sequence and the probe base sequence; a step (S14) of reading out each base sequence data and the maximum edit distance from the respective storing parts and evaluating the coupling possibility on the target base sequence data and complementary sequence data in the order of decreasing the edit distance; and a step (S16) of storing the result of evaluation of coupling possibility in a storage part. COPYRIGHT: (C)2004,JPO&NCIPI

公开(公告)号：JP2005157500A

公开(公告)日：2005-06-16

申请号：JP2003391457

申请日：2003-11-20

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： KANO MAKOTO ,  SHIBUYA TETSURO

IPC: C12N15/09 ,  C12M1/00 ,  C12Q1/68 ,  G01N33/48 ,  G01N33/50 ,  G06F17/18 ,  G06F19/00 ,  G06F19/18 ,  G06F19/20

CPC classification number: G06F19/20

Abstract: PROBLEM TO BE SOLVED: To highly accurately and quickly analyze the status of chromosome.
SOLUTION: An analysis apparatus is disclosed for analyzing the status of chromosome based on the quantity of gene expression. The analysis apparatus is provided with: a probability distribution storing part which stores the probability distribution of the quantity of gene expression for each gene state when each of the plurality of gene arranged on chromosome represents any of the plurality of gene states whose quantity of expression are different from each other; a state transition probability supplying part which supplies state transition probability representing probability that the adjacently arrayed adjacent gene of the gene on the chromosome represents each of the plurality of gene states when each gene on the chromosome represents each of the plurality of gene states; a quantity of expression inputting part which inputs a quantity of expression measured value being the measured value of the quantity of expression for each gene on the chromosome: and a state detecting part which detects, among the combination of the gene state which the plurality of gene on the chromosome can take, the combination to maximize the probability that the quantity of expression of the plurality of gene becomes the quantity of expression measured value based on the probability distribution and state transition probability.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：高度准确，快速地分析染色体的状态。 解决方案：公开了一种基于基因表达量分析染色体状态的分析装置。 该分析装置设置有概率分布存储部，其存储在染色体上配置的多个基因中的每一个表示基因状态中的任一种，其表达量为 彼此不同; 状态转移概率提供部，其提供表示染色体上的基因的相邻排列的相邻基因的概率的状态转移概率，表示染色体上的每个基因表示多个基因状态中的每一个时的多个基因状态中的每一个; 输入表达量测定值的量的表达量输入部分，其为染色体上每个基因的表达量的测量值;以及状态检测部分，其检测基因状态的组合中的多个基因 在染色体上可以采取这种组合，以使得基于概率分布和状态转移概率使多个基因的表达量变为表达量的量的概率最大化。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2003345805A

公开(公告)日：2003-12-05

申请号：JP2002146201

申请日：2002-05-21

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーション

Inventor： SHIBUYA TETSURO

IPC: C12N15/09 ,  G06F17/30 ,  G06F19/00 ,  G06F19/24

CPC classification number: G06F19/24 ,  G06F19/12 ,  G06F19/18 ,  G06F19/20 ,  G06F19/22

Abstract: PROBLEM TO BE SOLVED: To provide a system and a method for generating a cluster of base sequences, a program implementing the cluster generating method, a computer- readable recording medium with the program stored therefor, and a base sequence information providing system. SOLUTION: This base sequence information providing system includes a server 12 which is connected to a network 10 and receives a query sequence through the network 10 and a database 16 including base sequences, and the server 12 generates a 1st cluster 30 of base sequences which may be highly possibly in the relation a sprite pair with the query sequence by using segmented base sequence as a query sequence. Sprite alignment is applied to the 1st generated cluster to generate a 2nd cluster 32 including a sprite pair with high precision. The generated cluster is provided to a client through the network 10. COPYRIGHT: (C)2004,JPO

Abstract translation: 要解决的问题：提供一种用于生成基本序列簇的系统和方法，实现集群生成方法的程序，其中存储有该程序的计算机可读记录介质，以及基本序列信息提供系统 。 该基序列信息提供系统包括：服务器12，其连接到网络10，并通过网络10接收查询序列;以及包含基本序列的数据库16，并且服务器12生成基地的第一群集30 通过使用分段碱基序列作为查询序列，可能高度可能地与精灵对与查询序列的关系的序列。 Sprite对齐被应用于第一个生成的集群以产生包括精度高的精灵对的第二集群32。 生成的集群通过网络10提供给客户端。版权所有（C）2004，JPO

公开(公告)号：JP2002351908A

公开(公告)日：2002-12-06

申请号：JP2001145684

申请日：2001-05-15

Applicant: IBM

Inventor： SHIBUYA TETSURO ,  KAJIMA HISATSUGU

IPC: G06F17/30 ,  G06F19/00 ,  G06F19/22 ,  G06F21/00

Abstract: PROBLEM TO BE SOLVED: To provide a method for retrieving a database in which no request for special processing is needed to a database side and query contents are kept unknown to a database owner and to a person who observes the database retrieval in a network. SOLUTION: The system comprises an array processing part 21 which divides a retrieval array (a retrieval target) and creates a plurality of subarrays in a client 20 which accesses a database server 10 having an accumulation of the array pattern and queries whether the array pattern accumulated in the database server 10 is present in predetermined arrays and a query issuing part 22 which issues a query to the database server 10 with each of the plurality of the subarrays created by the array processing part 21 as a query array.

公开(公告)号：JP2002229987A

公开(公告)日：2002-08-16

申请号：JP2001004189

申请日：2001-01-11

Applicant: IBM

Inventor： SHIBUYA TETSURO

IPC: G06F17/30

Abstract: PROBLEM TO BE SOLVED: To attain a high-speed search while suppressing an increase in data size in a data structure for processing when searching a huge text database. SOLUTION: In a method of pattern-search searching desired patterns among a character string to be searched, following steps of range-search and character string extraction are included. Equivalently, in the step of range-search, in regard to each intermediate pattern acquired with adding in order by one character from the last character of the pattern toward the front, it is searched in sequence that in which range of a suffix arrangement to each character string to be searched top characters of the intermediate patterns exist. Next, in the step of the character string extraction, the elements of the character string corresponding to each element included in the range of the arrangement are specified, then, with putting each element of the character string on the tops, a partial character string consisting of the elements of the same number as the number of elements of the pattern is extracted.

公开(公告)号：JP2001188791A

公开(公告)日：2001-07-10

申请号：JP36842099

申请日：1999-12-24

Applicant: IBM

Inventor： SHIBUYA TETSURO

IPC: G06F17/30 ,  G06F19/22

Abstract: PROBLEM TO BE SOLVED: To efficiently realize the structure analysis of an array. SOLUTION: At first, prev(S) is calculated for a character string S to be processed, and as to all variables in the character string S, when the same variable is present at the upstream side of the variable, the variable is converted into a numerical value indicating an interval with the same variable, and when any same variable is not present at the upstream side of the variable, a character string S1 converted into '0' is obtained, and compl(S) is calculated. As for all the variables in the character string S, when any variable having a complementary relation is present at the upstream side of the variable, the variable is converted into a numerical value indicating an interval with the variable having the complementary relation, and when any variable having the complementary relation is not present at the upstream side of the variable, a character string S2 converted into '0' is calculated (102). Then, the character strings S1 and S2 are defined as a pair of corresponding character strings so that a single suffix (structure suffix tree) can be generated (104-114), and that the structure of an array indicated by the character string S can be analyzed by using the structure suffix tree.

公开(公告)号：JPH11184837A

公开(公告)日：1999-07-09

申请号：JP34124597

申请日：1997-12-11

Applicant: IBM

Inventor： SHIBUYA TETSURO

IPC: G01C21/00 ,  B65G61/00 ,  G01C21/34 ,  G06F17/50 ,  G06F19/00 ,  G06Q10/04 ,  G06Q50/00 ,  G06Q50/30 ,  G06F17/00

Abstract: PROBLEM TO BE SOLVED: To provide a highly efficient method to decide the shortest path between a single start point and each of plural end points by searching the shortest path starting from a single start point to each of plural end points. SOLUTION: A sequence queue is produced to store the points to be searched (210). Then the a point (v) where the sum of the path length p(v) covering a start point through the point (v) stored in the sequence queue and the lower limit value h(v) of the shortest path length among all points that are adjacent to the point (v) is minimized (220). Then the point (v) is deleted from the sequence queue (230) and stored in a definite set S (240). It's decided whether all end points are stored in the set S (250). If all end points are stored in the set S, the searching of the shortest path is ended. If all end points are not stored in the set S, all points (w) where the sum of the path length p(v) and the path length covering the start point through the point (v) is smaller than the length p(w) are specified (260). Then the points (w) are stored in the sequence queue (270) and the processing is returned to a block (220).