Abstract: A method for making a recombinant gene includes searching a database using a nucleotide sequence of a coding region, a nucleotide sequence that encodes an amino acid sequence, or an amino acid sequence, of a gene, for one or more nucleotide sequences having homology; selecting one or more nucleotide sequences other than nucleotide sequences only derived from a genome from the selected nucleotide sequences; for ones of the selected one or more nucleotide sequences comprising an upstream or downstream nucleotide sequence, analyzing whether the upstream or downstream nucleotide sequence is a functional sequence to select one or more first functional sequences; for ones of the selected one or more nucleotide sequences comprising no upstream or downstream nucleotide sequence, analyzing whether a gene information has any description indicating a functional sequence to select one or more second functional sequences; scoring the selected functional sequences; and selecting one or more functional sequences.

Abstract: A computer system that supports design for improving a function of a biological resource registers a history of the design, the history of the design including pair information of a related element related to a property of the biological resource and an operation on the related element, searches a database based on the pair information, acquires additional information other than the related element, the additional information being information related to the property of the biological resource based on a result of the search, computes a correlation of the additional information to the related element, and evaluates the additional information based on the calculated correlation.

Abstract: A system extracts one or more topic words from a set of seed documents of one or more seed documents, and creates a useful document model which is a model including the one or more topic words and a weight of each of the one or more topic words. A seed document is a document which may be a useful document. The system extracts one or more documents matching a search condition from a document search range including one or more documents according to a search request in which the search condition is specified. The system determines, for each of the one or more extracted documents, a document score of the document based on the above-described useful document model, and outputs a search result on descending order of document scores of the one or more extracted documents.

Abstract: An information processing system, in which information related to an input metabolic pathway is input, includes: a main metabolic map including a pathway most similar to or the same as the input metabolic pathway is selected from a database of a metabolic map represented by a directed graph in which a compound that is a reaction compound in a metabolic reaction is set as a node, and an enzyme that acts when a node used in reaction is moved to a node produced by reaction is set as an edge, a compound in a vicinity of the input metabolic pathway is selected from the main metabolic map as a peripheral compound, and a search expression is generated based on information on the selected peripheral compound and information of the compound and enzyme related to the input metabolic pathway so as to search the literature database for a literature.

Abstract: A method for making a recombinant gene includes searching a database using a nucleotide sequence of a coding region, a nucleotide sequence that encodes an amino acid sequence, or an amino acid sequence, of a gene, for one or more nucleotide sequences having homology; selecting one or more nucleotide sequences other than nucleotide sequences only derived from a genome from the selected nucleotide sequences; for ones of the selected one or more nucleotide sequences comprising an upstream or downstream nucleotide sequence, analyzing whether the upstream or downstream nucleotide sequence is a functional sequence to select one or more first functional sequences; for ones of the selected one or more nucleotide sequences comprising no upstream or downstream nucleotide sequence, analyzing whether a gene information has any description indicating a functional sequence to select one or more second functional sequences; scoring the selected functional sequences; and selecting one or more functional sequences.

Abstract: To support rapid and effective information collection, analysis, and status identification, an apparatus for identifying early status includes a data collection unit for collecting and classifying information, an intelligence deriving unit for analyzing collected and classified data, and an information display unit for displaying the collected, classified, and analyzed data. The data collection unit collects information transmitted by an information transmitter from a terminal device, summarizes the content included in the information, and registers the information with the summary in a database. The intelligence deriving unit calculates the reliability by analyzing the information transmitter and the content of the information, and registers the information with the reliability in a database.

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 anther 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: 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: 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 text classification apparatus directed to a plurality of languages, includes a unit for extracting information for converting a word from non-classified (unlabeled) texts, in a plurality of languages, into a word sense, a unit for learning a classification knowledge at a word sense level after converting a word extracted from a labeled text into a word sense, a unit for learning a classification knowledge at a word level from the labeled text, a unit for learning the classification knowledge at the word level from the classification knowledge at the word sense level and information on a relation between words extracted from the unlabeled text, and a unit for combining the respective classification knowledges to assign a category.

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: An information management system comprises a coordinate acquiring device for specifying a position on a paper sheet and a content server for storing data. The content server stores document data, event data, and stroke information. When the coordinate acquiring device specifies the position of the stoke information on the paper sheet concerning the document data, the content server retrieves event data relevant to the stroke information corresponding to the specified position, judges whether or not the user who has specified the position of the stroke information can read the retrieved event data, and transmits the event data if the user is judged to be able to read the event data.

Abstract: Provided in this invention is an information management system including a coordinate acquisition device for identifying a position on paper and a contents server for storing document data, characterized in that: the document data includes original document data and summary document data including the original document data; the original document data includes a first coordinate system and contents; the summary document data includes a second coordinate system, information about link to the original document data and coordinate information about areas assigned to the original document data; and in a case where the coordinate acquisition device identifies a position on the summary document, the contents server converts the coordinates of the identified position in the second coordinate system to coordinates in the first coordinate system.

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: Ordering is properly performed for document databases registered in an associative search server. In an associative search server capable of performing an associative search by correlating a plurality of document databases, the history of the associative search is stored as an associative search recording table by associative search recording table storing means. By using this associative search recording table, a showing order of document databases presented by document database selecting means is properly set by showing order changing means. Alternatively, by registration fee calculating means, calculation is properly carried out as to registration fees of the document database registered in the associative search server.

Abstract: A system allows related documents to be retrieved using conventional search engines while overcoming the ambiguity of a search key entered by the user. The system includes a word sense associative network display portion for displaying word senses of the search key entered by the user together with related word senses in a network, a search portion for conducting a search by generating a search key based on word senses selected by the user, and a filtering portion for selecting documents from the result of the search that matches the selected word sense.

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: A system for displaying the results of a search provided by one of two different search systems enabling continuous searching. One search system includes a search takeover data production command used to output search takeover data articles from the search. The other search system includes a search takeover data reading command used to read search takeover data. A document identifier correspondence table associates the identifiers specified in the search takeover data. When a user clicks a search system transfer instruction button in one search system, the search takeover data producing command is executed to produce search takeover data which is passed to the other search system. The latter search system regards the list of identifiers of articles which was passed by the search takeover data reading command as the search results, and thus operates continuously.

Abstract: The present invention visualizes the contents of a plurality of documents without a lack of the listing property. Two document units are extracted from a document database and relevance degrees between individual elements of a group of the document units are calculated. The results are displayed on a two-dimensional coordinate plane depending on the relevance degree.