• DocumentCode
    3635376
  • Title

    Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints

  • Author

    Mugurel Ionut Andreica;Andrei Grigorean;Nicolae Tapus

  • Author_Institution
    Comput. Sci. & Eng. Dept., Politeh. Univ. of Bucharest, Bucharest, Romania
  • fYear
    2009
  • Firstpage
    265
  • Lastpage
    272
  • 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.
  • Keywords
    "Computer science","Scientific computing","Mathematics","Sorting","Counting circuits"
  • Publisher
    ieee
  • Conference_Titel
    Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2009 11th International Symposium on
  • Print_ISBN
    978-1-4244-5910-0
  • Type

    conf

  • DOI
    10.1109/SYNASC.2009.38
  • Filename
    5460839
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3635376