• DocumentCode
    415739
  • Title

    Efficient methods for generating optimal single and multiple spaced seeds

  • Author

    Yang, I-Hsuan ; Wang, Sheng-Ho ; Chen, Yang-Ho ; Huang, Pao-Hsian ; Ye, Liang ; Huang, Xiaoqiu ; Chao, Kun-Mao

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
  • fYear
    2004
  • fDate
    19-21 May 2004
  • Firstpage
    411
  • Lastpage
    416
  • Abstract
    Biologists highly rely on good algorithms for finding homologous regions in bimolecular sequences. An advanced homology search program named PatternHunter has recently been developed, unlike the well-known program BLAST using a consecutive model, it utilizes a spaced seed model to attain higher sensitivity. We have developed a new program, which extends PatternHunter from a single spaced model to a multiple spaced model. In this paper, we describe methods for finding optimal single and multiple spaced models.
  • Keywords
    biology computing; genetics; molecular biophysics; proteins; query processing; scientific information systems; sequences; PatternHunter; bimolecular sequences; homology search program; multiple spaced seeds; single spaced seeds; Biological system modeling; Biology; Chaos; Computer science; Databases; Dynamic programming; Heuristic algorithms; Hidden Markov models; Pattern matching; Sensitivity analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Bioinformatics and Bioengineering, 2004. BIBE 2004. Proceedings. Fourth IEEE Symposium on
  • Print_ISBN
    0-7695-2173-8
  • Type

    conf

  • DOI
    10.1109/BIBE.2004.1317372
  • Filename
    1317372