首页> 外国专利> Fundamental pattern discovery using the position indices of symbols in a sequence of symbols

Fundamental pattern discovery using the position indices of symbols in a sequence of symbols

机译:使用符号序列中符号的位置索引进行基本模式发现

摘要

The present invention relates to computer-implemented methods for finding patterns in patterns in a set of k-sequences of symbols (where k2) and to a computer readable medium having instructions for controlling a computer system to perform the methods. Patterns of symbols common to each 2-tuple of sequences are identified. Each identified pattern of symbols is represented by a position index numerical array (PINA), which is a set of position indices, each of which denotes the location in a selected reference sequence at which each symbol in the pattern occurs. The position index numerical array (PINA) representations of patterns of each tuple at any order “n” may be combined with the PINA pattern representations of all other tuples at that same order “n” or with the pattern representations in any selected m-tuple, where m may have any integer value from 2 to (n−1). The patterns in the resulting tuple are identified from the position index numerical arrays (PINAs) produced by the intersection of the set of position indices in each position index numerical array (PINA) in one tuple with the set of position indices in each position index numerical array (PINA) in the other tuple. The intersection is performed by sequentially comparing each position index of one pattern with each of the position indices of the other pattern. The position index numerical array representing the identified pattern in the resulting tuple is converted into its corresponding symbols by mapping the indices in the numerical array to the respective symbols in the reference sequence.
机译:本发明涉及用于在一组k个符号序列(其中,k> 2)中的模式中找到模式的计算机实现的方法,并且涉及一种具有用于控制计算机系统以执行该方法的指令的计算机可读介质。识别每个2元组序列共有的符号模式。每个识别的符号模式都由位置索引数字数组(PINA)表示,PINA是一组位置索引,每个位置索引表示所选参考序列中该模式中每个符号出现的位置。每个元组在任何顺序“ n”下的模式的位置索引数字数组(PINA)表示可以与在相同顺序“ n”下的所有其他元组的PINA模式表示或在任何选定的m-tuple中的模式表示结合,其中m可以具有2到(n-1)之间的任何整数。从一个元组中每个位置索引数字数组(PINA)中的位置索引集合与每个位置索引数字中的位置索引集合的相交产生的位置索引数字数组(PINA)识别结果元组中的模式另一个元组中的数组(PINA)。通过依次比较一个图案的每个位置索引与另一图案的每个位置索引来执行相交。通过将数值数组中的索引映射到参考序列中的各个符号,将表示所得元组中已识别模式的位置索引数字数组转换为其相应的符号。

著录项

  • 公开/公告号US2006235844A1

    专利类型

  • 公开/公告日2006-10-19

    原文格式PDF

  • 申请/专利权人 DAVID RUBEN ARGENTAR;

    申请/专利号US20060402408

  • 发明设计人 DAVID RUBEN ARGENTAR;

    申请日2006-04-12

  • 分类号G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 21:47:35

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号