• DocumentCode
    3782357
  • Title

    Problems related to subsequences and supersequences

  • Author

    Z. Tronicek

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Czechoslovak Acad. of Sci., Prague, Czech Republic
  • fYear
    1999
  • Firstpage
    199
  • Lastpage
    205
  • Abstract
    We present an algorithm for building the automaton that searches for all non-overlapping occurrences of each subsequence from the set of subsequences. Further, we define Directed Acyclic Supersequence Graph and use it to solve the generalized Shortest Common Supersequence problem, the Longest Common Non-Supersequence problem, and the Longest Consistent Supersequence problem.
  • Keywords
    "Automata","Sequences","Computer science","Lapping","Read only memory","Text processing","Biomedical signal processing","Dynamic programming","Signal processing algorithms","Doped fiber amplifiers"
  • Publisher
    ieee
  • Conference_Titel
    String Processing and Information Retrieval Symposium, 1999 and International Workshop on Groupware
  • Print_ISBN
    0-7695-0268-7
  • Type

    conf

  • DOI
    10.1109/SPIRE.1999.796596
  • Filename
    796596
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3782357