Abstract: In document search for searching a document by use of a query formula composed of a Boolean formula of keywords, a plurality of query formulas arriving at about the same time from a plurality of users are efficiently processed. A system or a program for searching documents includes: a query formula controller for sorting a plurality of query formulas into a plurality of query formula sets based on predicted search speeds of the respective query formulas; and a search unit for searches for the plurality of sorted query formula sets sequentially from the set having the fastest predicted search speed, and for, in each search processing, merging the query formulas in the corresponding query formula set into a formula and thereby searching from the merged formula.

Abstract: A document search apparatus capable of an index-type search and a scan-type search performs a search in a combination of the two search types while compensating for the disadvantages of the two search types with each other. A search query for index-type search and a search query for scan-type search are constructed based on a search query consisting of a logical formula of keywords. Then, a character 2-gram for performing an index search is set to shorten the whole search time, and the index-type search is performed. Finally, a scan-type search is performed on this search result of the index-type search.

Abstract: To achieve high speed document search, an inverted index is compressed at high compressibility by an encoding method decodable in a high process speed. In compressing an identification number of a document to obtain a byte sequence by the variable byte method, w bits are used to represent the number of occurrences of the indexing term in the document, and x bits are used to represent additional information of the posting, where x and w are integers given as parameters. When the number of occurrences cannot be represented within w bits, a certain value indicating a numeric value that cannot be represented by w bits is stored is written to the said w bits, and another byte sequence that represents the value by the variable byte method follows. Additionally provided is a means for reading a compressed posting from any position of a list of postings called inverted lists, allowing a binary search on an inverted list.

Abstract: A clinical trial support system suitable for the investigation of an adverse event or the like. A clinical trial database stores: information about sponsors; information about trial sites; product information including the product names, classification, chemical structure, and pharmacokinetics of trial drugs; trial information including trial name, target disease, phase, and completed status; contract information including trial site name, contracted number of cases, and completed status; trial subject information including sex, birth of date, height, weight, and completed status; and visit information including visit date, inspection result, and medical imaging data. An information control unit distributes a search interface for the analysis of an adverse event to the trial sponsor and a retrieval result to the trial site.

Abstract: Both a first kind of terms and a second kind of terms are designated. A user desires to obtain a relationship between these terms. By employing relations between these terms having been previously stored in a storage in advance, the manner in which these terms are correlated is dynamically displayed, while nodes and edges are gradually increased. In this manner, relations are easily found for concepts (terms) that seem not to be correlated, and an efficient search can also be performed.

Abstract: An object of the present invention is to perform the clustering and assembling of nucleic acid base sequences at a high speed. Partial sequences 102 are extracted from each input sequence 101 and entered into a fixed-length partial sequence table 103. In the case where a sequence overlapping with a consensus sequence 104 is searched while making reference to the fixed-length partial sequence table 103 and consequently a partial sequence 102, which exactly matches with a sequence defined by a fixed length window 105 scanning along the consensus sequence, is found to be present, whether the whole input sequence can be assembled or not is determined by comparing the sequences. If it is possible to assemble the sequences, they are assembled into a consensus sequence and also joined into the same cluster. The clustering and assembling are performed by repeatedly processing this procedure based on greedy method until no unprocessed input nucleic acid base sequence is left.

Abstract: Method and apparatus for mapping cDNA sequences to genome sequences at high speed are disclosed. A genome sequence is divided into K-base-length partial sequences that do not overlap and are continuous (K-mers). Then, they are stored in a table with coordinates on the genome sequence where each of them appears. Using this table, correspondences of K-mers are created from perfectly matching pairs of K-mers on the cDNA and the K-mers on the genome sequence. Of all the correspondences of K-mers, those sets that represent correct mapping rather than accidental coincidence are identified at high speed by a method based on a publicly known method that extracts a longest increasing partial sequence from a numerical sequence. The resultant correspondences of K-mers are extended to the association between bases by sequence alignment, and then correction at splice sites is performed. In order to allow for an optimum selection of parameters, an interactive interface capable of real-time response is provided.

Abstract: An object of the present invention is to perform the clustering and assembling of nucleic acid base sequences at a high speed. Partial sequences 102 are extracted from each input sequence 101 and entered into a fixed-length partial sequence table 103. In the case where a sequence overlapping with a consensus sequence 104 is searched while making reference to the fixed-length partial sequence table 103 and consequently a partial sequence 102, which exactly matches with a sequence defined by a fixed length window 105 scanning along the consensus sequence, is found to be present, whether the whole input sequence can be assembled or not is determined by comparing the sequences. If it is possible to assemble the sequences, they are assembled into a consensus sequence and also joined into the same cluster. The clustering and assembling are performed by repeatedly processing this procedure based on greedy method until no unprocessed input nucleic acid base sequence is left.