English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51258/86283 (59%)
Visitors : 8032905      Online Users : 129
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/60882


    Title: A novel statistical cut-strategy for DP-based multiple biosequence alignment
    Authors: 簡丞志
    Contributors: 淡江大學電機工程學系
    Keywords: Sequences;Bioinformatics;Computational complexity;Dynamic programming;RNA;Computational efficiency;Object oriented programming;Computational biology;Biology computing;High performance computing
    Date: 2005-11
    Issue Date: 2011-10-15 01:01:56 (UTC+8)
    Abstract: In this paper, a novel cut-strategy is presented for solving the problems of multiple biosequence alignment. Sequence comparison is the most important primitive operation for analyzing of the bioinformatics data. The most fundamental method for alignment of several biosequences is the dynamic programming (DP) technique. The DP method is capable of finding optimal alignments for a set of sequences. However, when the length of the sequences increased, the DP method is impracticable due to the computational complexity is extremely high. Therefore, a new method is proposed in this paper for reducing the computational cost of the DP technique. By recursively finding the structural features of the biosequences, the proposed method can divide the biosequences into very small alignment problem, which can be directly solved by DP, or other applicable methods that can produce the results of alignment faster. By utilizing the object-oriented programming technique, the proposed method also provides low memory space consumption during execution. Moreover, the proposed algorithm has been implemented in an x86 demonstration program, and compares the effective and efficient performance with other known method.
    Relation: TENCON 2005 IEEE Region 10, pp.419-424
    DOI: 10.1109/SIPS.2005.1579905
    Appears in Collections:[電機工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML4View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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