Repository logo
  • English
  • 中文
  • Log In
    New user? Click here to register.Have you forgotten your password?
Repository logo
    Communities & Collections
    Research Outputs
    Fundings & Projects
    People
    Organizations
    Statistics
  • English
  • 中文
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Chung Shan Medical University
  3. Pure學術人才庫轉入
  4. An algorithm of discovering signatures from DNA databases on a computer cluster
 
  • Details
Options

An algorithm of discovering signatures from DNA databases on a computer cluster

Journal
BMC Bioinformatics
Date Issued
2014-01-01
Author(s)
HSIAO-PING LEE  
DOI
10.1186/1471-2105-15-339
URI
https://www.scopus.com/pages/publications/84910118218
https://scholars.csmu.edu.tw/handle/123456789/30771
Abstract
Background: Signatures are short sequences that are unique and not similar to any other sequence in a database that can be used as the basis to identify different species. Even though several signature discovery algorithms have been proposed in the past, these algorithms require the entirety of databases to be loaded in the memory, thus restricting the amount of data that they can process. It makes those algorithms unable to process databases with large amounts of data. Also, those algorithms use sequential models and have slower discovery speeds, meaning that the efficiency can be improved. Results: In this research, we are debuting the utilization of a divide-and-conquer strategy in signature discovery and have proposed a parallel signature discovery algorithm on a computer cluster. The algorithm applies the divide-andconquer strategy to solve the problem posed to the existing algorithms where they are unable to process large databases and uses a parallel computing mechanism to effectively improve the efficiency of signature discovery. Even when run with just the memory of regular personal computers, the algorithm can still process large databases such as the human whole-genome EST database which were previously unable to be processed by the existing algorithms. Conclusions: The algorithm proposed in this research is not limited by the amount of usable memory and can rapidly find signatures in large databases, making it useful in applications such as Next Generation Sequencing and other large database analysis and processing. The implementation of the proposed algorithm is available at http://www.cs.pu.edu.tw/~fang/DDCSDPrograms/DDCSD.htm.
Type
journal article
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback