Abstract
One of the most important issues in bioinformatics is to discover a common and conserved pattern, which is called a motif, from biological sequences. We have already proposed a motif extraction method called Chaotic Motif Sampler (CMS) by using chaotic dynamics. Exploring a searching space with avoiding undesirable local minima, the CMS discovers the motifs very effectively. During a searching process, chaotic neurons generate very complicated spike time-series. In the present paper, we analyzed the complexity of the spike time-series observed from each chaotic neuron by using a statistical measure, such as a coefficient of variation and a local variation of interspike intervals, which are frequently used in the field of neuroscience. As a result, if a motif is embedded in a sequence, corresponding spike time-series show characteristic behavior. If we use these characteristics, multiple motifs can be identified.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aihara, K., et al.: Chaotic Neural Networks. Physics Letters A 144, 33–340 (1990)
Akutsu, T., et al.: On Approximation Algorithms for Local Multiple Alignment. In: Proceedings of the 4th Annual International Conference Molecular Biology, pp. 1–7 (2000)
Glover, F.: Tabu Search I. ORSA Journal on Computing 1(3), 190–206 (1989)
Glover, F.: “Tabu Search II”. ORSA Journal on Computing 2(1), 4–32 (1990)
Hasegawa, M., et al.: Combination of Chaotic Neurodynamics with the 2-opt Algorithm to Solve Traveling Salesman Problems. Physical Review Letters 79(12), 2344–2347 (1997)
Hasegawa, M., et al.: Exponential and Chaotic Neurodynamical Tabu Searches for Quadratic Assignment Problems. Control and Cybernetics 29(3), 773–788 (2000)
Hasegawa, M., et al.: Solving Large Scale Traveling Salesman Problems by Chaotic Neurodynamics. Neural Networks 15(2), 271–283 (2002)
Hasegawa, M., et al.: A Novel Chaotic Search for Quadratic Assignment Problems. European Journal of Operational Research 39(3), 543–556 (2002)
Lawrence, C.E., et al.: Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment. Science 262, 208–214 (1993)
Matsuura, T., et al.: A Tabu Search for Extracting Motifs from DNA Sequences. In: Proceedings of Nonlinear Circuits and Signal Processing 2004, pp. 347–350 (2004)
Matsuura, T., et al.: A Tabu Search and Chaotic Search for Extracting Motifs from DNA Sequences. In: Proceedings of Metaheuristics International Conference 2005, pp. 677–682 (2005)
Matsuura, T., Ikeguchi, T.: Refractory Effects of Chaotic Neurodynamics for Finding Motifs from DNA Sequences. In: Corchado, E.S., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 1103–1110. Springer, Heidelberg (2006)
Matsuura, T., et al.: Analysis on Memory Effect of Chaotic Dynamics for Combinatorial Optimization Problem. In: Proceedings of Metaheuristics International Conference (2007)
Shinomoto, S., et al.: Differences in Spiking Patterns Among Cortical Neurons. Neural Computation 15, 2823–2842 (2003)
Information available at, http://www.genome.jp/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsuura, T., Ikeguchi, T. (2008). Chaotic Motif Sampler for Motif Discovery Using Statistical Values of Spike Time-Series. In: Ishikawa, M., Doya, K., Miyamoto, H., Yamakawa, T. (eds) Neural Information Processing. ICONIP 2007. Lecture Notes in Computer Science, vol 4984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69158-7_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-69158-7_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69154-9
Online ISBN: 978-3-540-69158-7
eBook Packages: Computer ScienceComputer Science (R0)