Skip to main content

An Improved Genetic Algorithm for the Sequencing by Hybridization Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3005))

Abstract

This paper presents a genetic algorithm for a computational biology problem. The problem appears in the computational part of a new deoxyribonucleic acid (DNA) sequencing procedure denominated sequencing by hybridization (SBH). The proposed genetic algorithm is an improvement over a recently proposed algorithm in the literature. The improvement is achieved by modifying the crossover operator towards an almost deterministic greedy crossover which makes the algorithm both more effective and more efficient. Experimental results on real DNA data are presented to show the advantages of using the proposed algorithm.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bains, W., Smith, G.C.: A novel method for nucleic acid sequence determination. Journal of Theoretical Biology 135, 303–307 (1988)

    Article  Google Scholar 

  2. Blazewicz, J., Formanowicz, P., Guinand, F., Kasprzak, M.: A heuristic managing errors for DNA sequencing. Journal of Bioinformatics 18(5), 652–660 (2002)

    Article  Google Scholar 

  3. Blazewicz, J., Formanowicz, P., Kasprzak, M., Markiewicz, W.T., Weglarz, J.: DNA sequencing with positive and negative errors. Journal of Computational Biology 6, 113–123 (1999)

    Article  Google Scholar 

  4. Blazewicz, J., Formanowicz, P., Kasprzak, M., Markiewicz, W.T., Weglarz, J.: Tabu search for DNA sequencing with false negatives and false positives. European Journal of Operational Research 125, 257–265 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Blazewicz, J., Kasprzak, M.: Complexity of DNA sequencing by hybridization. Journal of Theoretical Computer Science 290, 1459–1473 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Blazewicz, J., Kasprzak, M., Kuroczycki, W.: Hybrid Genetic Algorithm for DNA Sequencing with Errors. Journal of Heuristics 8, 495–502 (2002)

    Article  MATH  Google Scholar 

  7. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  8. Pevzner, P.A.: l-tuple DNA Sequencing: Computer Analysis. Journal of Biomolecular Structure and Dynamics 7, 63–73 (1989)

    MATH  Google Scholar 

  9. Zhang, J., Wu, L., Zhang, X.: Reconstruction of DNA sequencing by hybridization. Journal of Bioinformatics 19(1), 14–21 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brizuela, C.A., González, L.C., Romero, H.J. (2004). An Improved Genetic Algorithm for the Sequencing by Hybridization Problem. In: Raidl, G.R., et al. Applications of Evolutionary Computing. EvoWorkshops 2004. Lecture Notes in Computer Science, vol 3005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24653-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24653-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21378-9

  • Online ISBN: 978-3-540-24653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics