Identification of Transcription Factor Binding Sites Using Hybrid Particle Swarm Optimization | SpringerLink
Skip to main content

Identification of Transcription Factor Binding Sites Using Hybrid Particle Swarm Optimization

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3642))

  • 1587 Accesses

Abstract

Transcription factors are key regulatory elements that control gene expression. Recognition of transcription factor binding sites (TFBS) motif from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we present a new approach for studying this challenging issue. We first formulate the binding sites motif identification problem as a combinatorial optimization problem. Then hybrid particle swarm optimization (HPSO) is proposed for solving such a problem in upstream regions of genes regulated by octamer binding factor. We have developed two local search operators and one recombination mutation operator in HPSO. Experiment results show that the proposed algorithm is effective in obtaining known TFBS motif and can produce some putative binding sites motif. The results are highly encouraging.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Collins, F., Green, E., Guttmacher, A., Guyer, M.: A Vision for the Future of Genomics Research. Nature 422, 835–847 (2003)

    Article  Google Scholar 

  2. Lockhart, D., Winzeler, E.: Genomics, Gene Expression and DNA Arrays. Nature 405, 827–836 (2000)

    Article  Google Scholar 

  3. Qin, Z., McCue, L., Thompson, W., Mayerhofer, L., Lawrence, C., Liu, J.: Identification of Co-regulated Genes Through Bayesian Clustering of Predicted Regulatory Binding Sites. Nature Biotechnology 21, 435–439 (2003)

    Article  Google Scholar 

  4. Olman, V., et al.: Identification of Regulatory Binding Sites Using Minimum Spanning Trees. In: Proceedings of Pacific Symposium on Biocomputing, pp. 327–338 (2003)

    Google Scholar 

  5. Cora, D., DiCunto, F., Provero, P., Silengo, L., Caselle, M.: Computational Identification of Transcription Factor Binding Sites by Functional Analysis of Sets of Genes Sharing Overrepresented Upstream Motifs. BMC Bioinformatics 5, 57 (2004)

    Article  Google Scholar 

  6. Bailey, T., Elkan, C.: Fitting A Mixture Model by Expectation Maximization to Discover Motifs in Biopolymers. In: Proceedings of International Conference on Intelligent Systems for Molecular Biology, pp. 28–36 (1994)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  8. Kel-Margoulis, O.V.: COMPEL: A Database on Composite Regulatory Elements Providing Combinatorial Transcriptional Regulation. Nucleic Acids Research 28, 311–315 (2003)

    Article  Google Scholar 

  9. Fogel, G.B.: Discovery of Sequence Motifs Related to Coexpression of Genes Using Evolutionary Computation. Nucleic Acids Research 32, 3826–3835 (2004)

    Article  Google Scholar 

  10. Rasmussen, T.K., Krink, T.: Improved Hidden Markov Model Training for Multiple Sequence Alignment by A Particle Swarm Optimization. Biosystems 72, 5–17 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, W., Zhou, C., Liu, G., Huang, Y. (2005). Identification of Transcription Factor Binding Sites Using Hybrid Particle Swarm Optimization. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548706_46

Download citation

  • DOI: https://doi.org/10.1007/11548706_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28660-8

  • Online ISBN: 978-3-540-31824-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics