具有多种类型发生约束的序列模式识别算法

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI:10.1109/SYNASC.2009.38

M. Andreica, N. Tapus, Andrei Grigorean

{"title":"具有多种类型发生约束的序列模式识别算法","authors":"M. Andreica, N. Tapus, Andrei Grigorean","doi":"10.1109/SYNASC.2009.38","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints\",\"authors\":\"M. Andreica, N. Tapus, Andrei Grigorean\",\"doi\":\"10.1109/SYNASC.2009.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":286180,\"journal\":{\"name\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2009.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2009.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，我们提出了有效的算法技术来识别几种类型的序列相关模式。我们考虑了两个主要问题:寻找具有重复排列结构的最大权值连续子序列，以及包含对秘密序列的约束猜测的在线问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量