Skip to main content
SpringerLink
Log in

A Meta Heuristic Solution for Closest String Problem Using Ant Colony System

  • Conference paper
Distributed Computing and Artificial Intelligence

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 79))

Abstract

Suppose Σ is the alphabet set and S is the set of strings with equal length over alphabet Σ. The closest string problem seeks for a string over Σ that minimizes the maximum hamming distance with other strings in S. The closest string problem is NP-complete. This problem has particular importance in computational biology and coding theory. In this paper we present an algorithm based on ant colony system. The proposed algorithm can solve closest string problem with reasonable time complexity. Experimental results have shown the correctness of algorithm. At the end, a comparison with one Meta heuristic algorithm is also given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 469.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 599.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Meneses, C.N., Lu, Z., Oliveria, A.S., Pardolos, P.M., et al.: Optimal Solutions for the Closest String Problem via Integer Programing. INFORMS J. Computing 16(4), 419–429 (2004)

    Article  Google Scholar 

  2. Deng, X., Li, G., Li, Z., Ma, B., Wang, L., et al.: Genetic design of drugs without side effects. SIAM Journal on Computing 32(4), 1073–1090 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dopazo, J., Rodríguez, A., Sáiz, J.C., Sobrino, F., et al.: Design of primers for PCR amplification of highly variable genomes. In: CABIOS, vol. 9, pp. 123–125 (1993)

    Google Scholar 

  4. Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R., et al.: A parallel multistart algorithm for the closest string problem. SienceDirect. Computers & Operations Research 35, 3636–3643 (2008)

    Article  MATH  Google Scholar 

  5. Gramm, J., Hüffner, F., Niedermeier, R., et al.: Closest strings, primer design, and motif search. In: Florea, L. (ed.) Currents in Computational Molecular Biology, poster abstracts of RECOMB 2002, pp. 74–75 (2002)

    Google Scholar 

  6. Gramm, J., Niedermeier, R., Rossmanith, P., et al.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25–42 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Wang, J., Chen, J., Huang, M., et al.: An Improved Lower Bound on Approximation Alogorithms for the Closest Substring Problem. Science Direct Information Processing Letters 107, 24–28 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L., et al.: Distinguishing string search problems. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 633–642 (1999)

    Google Scholar 

  9. Dorigo, M., Maniezzo, V., Colorni, A., et al.: The Ant System Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  10. Frances, M., Litman, A.: On Covering Problems of Codes. Theoretical Computer System 30, 113–119 (1997)

    MATH  MathSciNet  Google Scholar 

  11. Li, M., Ma, B., Wang, L., et al.: On the Closest String and Substring Problems. J. ACM 49(2), 151–171 (2002)

    Article  MathSciNet  Google Scholar 

  12. Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M., et al.: Optimal solutions for the closest-string problem via integer programming. INFORMS Journal on Computing, 419–429 (2004)

    Google Scholar 

  13. Evans, P.A., Smith, A.D., Li, M., Ma, B., Wang, L.: Complexity of Finding Similar Regions in Approximating Closest Substring Problems. Fundamentals of Computation Theory, 210–221 (2003)

    Google Scholar 

  14. Faro, S., Pappalardo, E.: ANT-CSP: An Ant Colony Optimization for the Closest String Problem. In: SOFSEM 2010. LNCS, vol. 5901, pp. 370–381. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Wang, L., Dong, L.: Randomized algorithms for motif detection. Journal of Bioinformatics and Computational Biology 3(5), 1039–1052 (2005)

    Article  MathSciNet  Google Scholar 

  16. Wang, Y., Chen, W., Li, X., Cheng, B., et al.: Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA. BMC Bioinformatics  7(suppl. 4), S9, 123–130 (2006)

    Article  Google Scholar 

  17. Liu, X., He, H., Sykora, O., et al.: Parallel Genetic Algorithm and Parallel Annealing Algorithm for the Closest String Problem, pp. 591–597 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Payam Noor University,  

    Faranak Bahredar & Nafiseh Masaeli

  2. Computer Engineering Department, Science and Research Branch, Islamic Azad University,  

    Hossein Erfani

  3. Department of Mathematics and Computer Science, Shahed University, Tehran, Iran

    H. Haj Seyed Javadi

Authors
  1. Faranak Bahredar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hossein Erfani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Haj Seyed Javadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nafiseh Masaeli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Sao Paulo at Sao Carlos, Sao Carlos, SP, Brazil

    Andre Ponce de Leon F. de Carvalho

  2. Department of Computing, Science and Control, Faculty of Science, University of Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Sara Rodríguez-González

  3. Department of Computing, Science and Control, Faculty of Science, University of Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Juan F. De Paz Santana  & Juan M. Corchado Rodríguez  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bahredar, F., Erfani, H., Javadi, H.H.S., Masaeli, N. (2010). A Meta Heuristic Solution for Closest String Problem Using Ant Colony System. In: de Leon F. de Carvalho, A.P., Rodríguez-González, S., De Paz Santana, J.F., Rodríguez, J.M.C. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol 79. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14883-5_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14883-5_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14882-8

  • Online ISBN: 978-3-642-14883-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation