会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Search system
    • 搜索系统
    • US07065518B2
    • 2006-06-20
    • US10197874
    • 2002-07-19
    • Shingo NishiokaYoshiki NiwaToru HisamitsuMakoto IwayamaOsamu Imaichi
    • Shingo NishiokaYoshiki NiwaToru HisamitsuMakoto IwayamaOsamu Imaichi
    • G06F17/30
    • G06F17/30011Y10S707/99933Y10S707/99934
    • 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.
    • 一种用于显示由两个不同搜索系统之一提供的搜索结果的系统,其能够进行连续搜索。 一个搜索系统包括用于从搜索输出搜索接管数据文章的搜索接管数据生成命令。 另一搜索系统包括用于读取搜索接管数据的搜索接管数据读取命令。 文档标识符对应表将搜索接管数据中指定的标识符相关联。 当用户在一个搜索系统中单击搜索系统传输指令按钮时,执行搜索接管数据产生命令以产生被传递到另一搜索系统的搜索接管数据。 后一种搜索系统将通过搜索接管数据读取命令传递的文章的标识符列表作为搜索结果,从而连续工作。
    • 7. 发明授权
    • Character recognition method and apparatus
    • 字符识别方法和装置
    • US5768451A
    • 1998-06-16
    • US867774
    • 1997-06-02
    • Toru HisamitsuYoshihiro ShimaKatsumi MarukawaHiroaki ShimokawabeYoshihiko Nitta
    • Toru HisamitsuYoshihiro ShimaKatsumi MarukawaHiroaki ShimokawabeYoshihiko Nitta
    • G06K9/72G06F17/22G06K9/03G06F17/20G06F17/27
    • G06K9/723G06K2209/01
    • A character recognition method is arranged to supplement an erroneously recognized character with a linguistic knowledge. In this method, the extraction of a candidate based on the search of a word dictionary occupies a large part of the operation. To speed up the extraction of a candidate word, therefore, the method is provided to search the dictionary by using a group of candidate characters or a dictionary header for processing an inflected form of a verb. Further, the present method is provided for calculating a word matching cost for improving an efficiency of modifying an erroneous recognition. The word search is done by using a "hybrid method" arranged of "candidate-character-driven word extraction" and "dictionary-driven word extraction". Moreover, the word-dictionary is arranged to have a header word composed of an inflectional ending of a verb and an auxiliary verb or a particle added to the tail of the inflectional ending. The present method attaches much importance to the difference of the matching cost about a character with a totally high confidence ratio than the difference of the matching cost about a character with a totally low confidence ratio.
    • 一种字符识别方法是用语言知识来补充错误识别的字符。 在这种方法中,基于搜索单词字典的候选者的提取占据了大部分的操作。 因此,为了加速候选词的提取,提供了通过使用一组候选字符或用于处理动词的变形形式的字典头来搜索字典的方法。 此外,本方法用于计算用于提高错误识别修改效率的字匹配成本。 词搜索通过使用“候选字符驱动的单词提取”和“字典驱动的单词提取”排列的“混合方法”来完成。 此外,词典被设置成具有由动词和辅助动词的变形结尾组成的标题词,或者添加到变形结尾的尾部的粒子。 本方法非常重视与具有完全低置信率的字符的匹配成本的差异,具有完全高置信率的字符的匹配成本的差异。
    • 8. 发明申请
    • Information processing system using base sequence relevant information
    • 信息处理系统使用基本序列相关信息
    • US20060149502A1
    • 2006-07-06
    • US10543759
    • 2004-02-25
    • Takamasa KatoTakeo MorimotoHitoshi MatsuoHideyuki BanToru HisamitsuTakuya Kamiyama
    • Takamasa KatoTakeo MorimotoHitoshi MatsuoHideyuki BanToru HisamitsuTakuya Kamiyama
    • G06F15/00
    • G16B20/00G16B30/00
    • This invention provides a method for processing information that allows the discovery of a correlation between predetermined individual-related information and nucleotide sequence-related information concerning an individual. This method comprises: step (a) of calculating a percentage for each piece of nucleotide sequence-related information using a first occurrence frequency and a second occurrence frequency, wherein the first occurrence frequency is calculated for each possible piece of nucleotide sequence-related information in a given position in a nucleotide sequence based on a predetermined population and the second occurrence frequency is calculated for each possible piece of nucleotide sequence-related information in the aforementioned position based on the population gathered for predetermined individual-related information concerning an individual; and step (b) of associating the percentage calculated in step (a) with positional information representing the aforementioned position and with the nucleotide sequence-related information for each the predetermined piece of individual-related information.
    • 本发明提供一种用于处理信息的方法,其允许发现预定的个体相关信息与关于个体的核苷酸序列相关信息之间的相关性。 该方法包括:(a)使用第一次出现频率和第二次出现频率计算每个核苷酸序列相关信息的百分比,其中针对每个可能的核苷酸序列相关信息片段计算第一次出现频率 基于针对与个人相关的预定个人相关信息收集的群体,在基于预定群体的核苷酸序列中的给定位置和针对上述位置中的每个可能的核苷酸序列相关信息片段计算第二出现频率; 以及将步骤(a)中计算的百分比与表示上述位置的位置信息和每个预定个体相关信息的核苷酸序列相关信息相关联的步骤(b)。
    • 9. 发明申请
    • Method that aligns cDNA sequences to genome sequences
    • 将cDNA序列与基因组序列对齐的方法
    • US20050159898A1
    • 2005-07-21
    • US11011954
    • 2004-12-15
    • Tomohiro YasudaToru Hisamitsu
    • Tomohiro YasudaToru Hisamitsu
    • C12N15/09C12Q1/68G01N33/48G01N33/50G06F17/30G06F19/18G06F19/22G06F19/00
    • G16B30/00G16B45/00
    • 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.
    • 公开了将cDNA序列高速映射到基因组序列的方法和装置。 将基因组序列分为不重叠且连续的K-碱基长度部分序列(K-mers)。 然后,将它们存储在基因组序列上的每个都出现的坐标表中。 使用该表,K-mers的对应性由cDNA和基因组序列上的K-mers完全匹配的K-m对产生。 在K-mers的所有对应中,通过基于从数字序列中提取最长增加的部分序列的公知方法的方法,高速识别代表正确映射而不是偶然重合的那些集合。 通过序列比对将K-mers的结果对应扩展到碱基之间的关联,然后进行剪接位点的校正。 为了允许参数的最佳选择,提供了能够实时响应的交互式界面。