首页> 外文会议>11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009) >Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints
【24h】

Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints

机译:具有几种类型的发生约束的序列模式识别算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper we present efficient algorithmic techniques for identifying several types of sequence-related patterns. We consider two main problems: finding a maximum weight contiguous subsequence which has the structure of a permutation with repetitions, and an online problem consisting of the constrained guessing of a secret sequence.
机译:在本文中,我们提出了用于识别几种类型的序列相关模式的有效算法技术。我们考虑两个主要问题:找到一个最大权重连续子序列,该子序列具有重复排列的排列结构;以及一个在线问题,其中包括对秘密序列的约束猜测。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号