• DocumentCode
    495551
  • Title

    Parallel ACO for DNA Sequencing by Hybridization

  • Author

    Hongwei, Xie ; Yanhua, Luo

  • Author_Institution
    Taiyuan Univ. of Technol., Taiyuan, China
  • Volume
    4
  • fYear
    2009
  • fDate
    March 31 2009-April 2 2009
  • Firstpage
    602
  • Lastpage
    606
  • Abstract
    DNA sequencing by hybridization (SBH) is an important method in bioinformatics, and it has been proved to be a NP-hard problem in combinatorial optimization. It has two demerits which are the lower precision of solution and the lower speed of convergence in serial ACO, tabu search and evolutionary algorithm for DNA sequencing by hybridization. In this paper an improved parallel ACO algorithm (IPACO) was proposed for DNA sequencing by hybridization in this paper. It shows a better performance compared with serial ACO, tabu search and evolutionary algorithm in precision and convergence based on the experiments.
  • Keywords
    DNA; bioinformatics; combinatorial mathematics; optimisation; parallel algorithms; sequences; DNA sequencing; NP-hard problem; bioinformatics; combinatorial optimization; hybridization; improved parallel ant colony optimisation algorithm; Bioinformatics; Cloning; Computer science; DNA; Electrokinetics; Evolutionary computation; NP-hard problem; Optimization methods; Polynomials; Sequences;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Engineering, 2009 WRI World Congress on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    978-0-7695-3507-4
  • Type

    conf

  • DOI
    10.1109/CSIE.2009.182
  • Filename
    5171066