English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90452/105769 (86%)
Visitors : 11956945      Online Users : 382
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/79636

    Title: Finding all approximate palindromes of the string
    Authors: 黃建宏;Huang, Chien-Hung;陳立祺;Chen, Li-Chi;李家同;Lee, Chia-Tung;吳家樂;Ng, Ka-Lok
    Contributors: 生物與醫學資訊學系
    Date: 2014-04
    Issue Date: 2014-06-05 11:06:00 (UTC+8)
    Abstract: Palindromes are strings of symbols that read the same forward and backward. Palindromes have many applications, especially in DNA sequences. Palindromes appear frequently and are widespread in human cancers, and identify them could help advance the understanding of genomic instability. The palindrome detection problem is therefore an important issue in computational biology. Porto et al. presented an algorithm for finding the maximal approximate palindromes with error k. In this paper, we extended their results by proposing an effective algorithm based upon dynamic programming strategy to find all approximate palindromes up to error k under the similar cost complexity.
    Relation: WIT Transactions on Information and Communication Technologies
    Appears in Collections:[生物資訊與醫學工程學系 ] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback