Refractory Effects of Chaotic Neurodynamics for Finding Motifs from DNA Sequences

  • Takafumi Matsuura
  • Tohru Ikeguchi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4224)


To discover a common and conserved pattern, or motif, from DNA sequences is an important step to analyze DNA sequences because the patterns are acknowledged to reflect biological important information. However, it is difficult to discover unknown motifs from DNA sequences because of its huge number of combination. We have already proposed a new effective method to extract the motifs using a chaotic search, which combines a heuristic algorithm and a chaotic dynamics. To realize the chaotic search, we used a chaotic neural network. The chaotic search exhibits higher performance than conventional methods. Although we have indicated that the refractory effects realized by the chaotic neural network have an essential role, we did not clarify why the refractory effects are important to search optimal solutions. In this paper, we further investigate this issue and reveal the validity of the refractory effects of the chaotic dynamics using surrogate refractory effects. As a result, we discovered that it is important for searching optimal solutions to increase strength of the refractory effects after a firing of neurons.


Tabu Search Chaotic Dynamic Travel Salesman Problem Travel Salesman Problem Find Motif 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aihara, K., Takebe, T., Toyoda, M.: Chaotic neural networks. Physics Letters A 144 (1990)Google Scholar
  2. Akutsu, T., Arimura, H., Shimozono, S.: On approximation algorithms for local multiple alignment. In: Proceedings of the Fourth International Conference on Computational Molecular Biology, pp. 1–7 (2000)Google Scholar
  3. Glober, F.: Tabu Search I. ORSA Journal on Computing 1, 190–206 (1989)Google Scholar
  4. Glober, F.: Tabu Search II. ORSA Journal on Computing 2, 4–32 (1990)Google Scholar
  5. Hasegawa, M., Ikeguchi, T., Aihara, K.: Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Physical Review Lettters 79(12), 2344–2347 (1997)CrossRefGoogle Scholar
  6. Hasegawa, M., Ikeguchi, T., Aihara, K.: Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems. Control and Cybernetics 29(3), 773–788 (2000)MATHMathSciNetGoogle Scholar
  7. Hasegawa, M., Ikeguchi, T., Aihara, K.: A novel chaotic search for quadratic assignment problems. European Journal of Operational Research 139(3), 543–556 (2002)MATHCrossRefMathSciNetGoogle Scholar
  8. Hasegawa, M., Ikeguchi, T., Aihara, K.: Solving large scale traveling salesman problems by chaotic neurondynamics. Neural Networks 15(2), 271–283 (2002)CrossRefGoogle Scholar
  9. Kantz, H., Schrieber, T.: Nonlinear time series analysis. Cambridge university press, Cambridge (2003)CrossRefGoogle Scholar
  10. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., Wootton, J.C.: Detecting subtle sequence signals: A gibbs sampling strategy for multiple alignment. Science 262, 208–214 (1993)CrossRefGoogle Scholar
  11. Matsuura, T., Anzai, T., Ikeguchi, T., Horio, Y., Hasegawa, M., Ichinose, N.: A tabu search for extracting motifs from dna sequences. In: Proceedings of 2004 RISP international Workshop on Nonlinear Civcuits and Signal Processing, pp. 347–350 (2004)Google Scholar
  12. Matsuura, T., Ikeguchi, T.: A tabu search and chaotic search for extracting motifs from dna sequences. In: Procceedings of the Sixth Metaheuristics International Conference 2005, pp. 677–682 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Takafumi Matsuura
    • 1
  • Tohru Ikeguchi
    • 1
  1. 1.Graduate School of Science and EngineeringSaitama UniversitySaitama-cityJapan

Personalised recommendations