DNA Fragment Assembly: An Ant Colony System Approach

  • Wannasak Wetcharaporn
  • Nachol Chaiyaratana
  • Sissades Tongsima
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3907)


This paper presents the use of an ant colony system (ACS) algorithm in DNA fragment assembly. The assembly problem generally arises during the sequencing of large strands of DNA where the strands are needed to be shotgun-replicated and broken into fragments that are small enough for sequencing. The assembly problem can thus be classified as a combinatorial optimisation problem where the aim is to find the right order of each fragment in the ordering sequence that leads to the formation of a consensus sequence that truly reflects the original DNA strands. The assembly procedure proposed is composed of two stages: fragment assembly and contiguous sequence (contig) assembly. In the fragment assembly stage, a possible alignment between fragments is determined with the use of a Smith-Waterman algorithm where the fragment ordering sequence is created using the ACS algorithm. The resulting contigs are then assembled together using a nearest neighbour heuristic (NNH) rule. The results indicate that in overall the performance of the combined ACS/NNH technique is superior to that of the NNH search and a CAP3 program. The results also reveal that the solutions produced by the CAP3 program contain a higher number of contigs than the solutions produced by the proposed technique. In addition, the quality of the combined ACS/NNH solutions is higher than that of the CAP3 solutions when the problem size is large.


Travel Salesman Problem Travel Salesman Problem CAP3 Program Fragment Assembly Greedy Search Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    International Human Genome Sequencing Consortium: Initial sequencing and analysis of the human genome. Nature 409(6822), 860–921 (2001)Google Scholar
  2. 2.
    Applewhite, A.: Mining the genome. IEEE Spectrum 39(4), 69–71 (2002)CrossRefGoogle Scholar
  3. 3.
    Pop, M., Salzberg, S.L., Shumway, M.: Genome sequence assembly: Algorithms and issues. Computer 35(7), 47–54 (2002)CrossRefGoogle Scholar
  4. 4.
    Huang, X., Madan, A.: CAP3: A DNA sequence assembly program. Genome Research 9(9), 868–877 (1999)CrossRefGoogle Scholar
  5. 5.
    Green, P.: Phrap documentation. Phred, Phrap, and Consed (2004),
  6. 6.
    Ferreira, C.E., de Souza, C.C., Wakabayashi, Y.: Rearrangement of DNA fragments: A branch-and-cut algorithm. Discrete Applied Mathematics 116(1-2), 161–177 (2002)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Batzoglou, S., Jaffe, D., Stanley, K., Butler, J., Gnerre, S., Mauceli, E., Berger, B., Mesirov, J.P., Lander, E.S.: ARACHNE: A whole-genome shotgun assembler. Genome Research 12(1), 177–189 (2002)CrossRefGoogle Scholar
  8. 8.
    Kececioglu, J.D., Myers, E.W.: Combinatorial algorithms for DNA sequence assembly. Algorithmica 13(1-2), 7–51 (1995)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences of the United States of America 98(17), 9748–9753 (2001)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Burks, C., Engle, M., Forrest, S., Parsons, R., Soderlund, C., Stolorz, P.: Stochastic optimization tools for genomic sequence assembly. In: Adams, M.D., Fields, C., Venter, J.C. (eds.) Automated DNA Sequencing and Analysis., pp. 249–259. Academic Press, London (1994)Google Scholar
  11. 11.
    Parsons, R.J., Forrest, S., Burks, C.: Genetic algorithms, operators, and DNA fragment assembly. Machine Learning 21(1-2), 11–33 (1995)CrossRefGoogle Scholar
  12. 12.
    Parsons, R.J., Johnson, M.E.: A case study in experimental design applied to genetic algorithms with applications to DNA sequence assembly. American Journal of Mathematical and Management Sciences 17(3-4), 369–396 (1997)Google Scholar
  13. 13.
    Kim, K., Mohan, C.K.: Parallel hierarchical adaptive genetic algorithm for fragment assembly. In: Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, Australia, pp. 600–607 (2003)Google Scholar
  14. 14.
    Angeleri, E., Apolloni, B., de Falco, D., Grandi, L.: DNA fragment assembly using neural prediction techniques. International Journal of Neural Systems 9(6), 523–544 (1999)CrossRefGoogle Scholar
  15. 15.
    Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)CrossRefGoogle Scholar
  16. 16.
    Allex, C.F., Baldwin, S.F., Shavlik, J.W., Blattner, F.R.: Improving the quality of automatic DNA sequence assembly using fluorescent trace-data classifications. In: Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, St. Louis, MO, pp. 3–14 (1996)Google Scholar
  17. 17.
    Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147(1), 195–197 (1981)CrossRefGoogle Scholar
  18. 18.
    Huang, X., Miller, W.: A time-efficient, linear-space local similarity algorithm. Advances in Applied Mathematics 12(3), 337–357 (1991)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wannasak Wetcharaporn
    • 1
  • Nachol Chaiyaratana
    • 1
    • 2
  • Sissades Tongsima
    • 3
  1. 1.Research and Development Center for Intelligent SystemsKing Mongkut’s Institute of Technology North BangkokBangkokThailand
  2. 2.Institute of Field RoboticsKing Mongkut’s University of Technology ThonburiBangkokThailand
  3. 3.National Center for Genetic Engineering and BiotechnologyNational Science and Technology Development AgencyPathumthaniThailand

Personalised recommendations