On the Symbolic Analysis of Market Indicators with the Dynamic Programming Approach

  • Lukáš Pichl
  • Takuya Yamano
  • Taisei Kaizoji
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3973)


Symbolic analysis of time series of economic indicators offers an advantage of transferring quantitative values into qualitative concepts by indexing a subset of intervals with a set of symbols. In a similar way, computer codes routinely process continuous problems in a discrete manner. This work explains an appealing analogy between the DNA code of life and the symbol series derived from financial markets. In particular, it is shown that similarity scoring schemes and the alignment gap concept known in bioinformatics have even more natural and deeper analogies in the economic systems. The symbolic analysis does not solely mean a loss of information; in also allows us to quantify a similarity degree between various financial time series (and their subsequences) in a rigorous way, which is a novel concept of practical importance in economic applications. Our symbolic analysis concept is illustrated by two types of market indicator series, namely the analysis of Dow Jones vs. NIKKEI 225 indices on one side, and the CZK/EUR exchange rate vs. Prague money market rates on the other side. The present framework may also yield a significantly reduced computational complexity as compared to the neural networks in the class of similarity-comparison algorithms.


Exchange Rate Market Indicator Index Volatility Symbolic Analysis Money Market Rate 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Trippi, R., Turban, E.: Neural Networks in Finance and Investing. McGraw-Hill/Irwin Publishing, New York (1996)Google Scholar
  2. 2.
    Moody, J.: Forecasting the Eonomy with Neural Nets: A Survey of Challenges and Solutions. In: Orr, G.B., Mueller, K.R. (eds.) Neural Networks - Tricks of the Trade. Springer, Berlin (1998)Google Scholar
  3. 3.
    Franke, J., Neumann, M.H.: Bootstrapping Neural Networks. Neural Computation 12, 1929–1949 (2000)CrossRefGoogle Scholar
  4. 4.
    Kilian, L., Taylor, M.P.: Why Is It So Difficult to Beat the Random Walk Forecast of Exchange Rates? Journal of International Economics 60(1), 85–107 (2003)CrossRefGoogle Scholar
  5. 5.
    Setubal, J., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing Company ITP, Boston (1997)Google Scholar
  6. 6.
    Bergeron, B.: Bioinformatics Computing. Pearson Education, Prentice Hall PTR, Indiana (2003)Google Scholar
  7. 7.
    Bufardi, A.: On the Fuzzyfication of the Classical Definition of Preference Structure. Fuzzy Sets and Systems 104(2), 323–332 (1999)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Bellman, R.: Dynamic Programming. University Press, New York (1957)MATHGoogle Scholar
  9. 9.
    Myers, E.W., Miller, W.: Optimal Alignments in Linear Space. CABIOS 4, 11–17 (1988)Google Scholar
  10. 10.
    Huang, X., Hardison, R.C., Miller, W.: A Space-Efficient Algorithm for Local Similarities. CABIOS 6, 373–381 (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Lukáš Pichl
    • 1
  • Takuya Yamano
    • 2
  • Taisei Kaizoji
    • 2
  1. 1.Division of Natural SciencesInternational Christian University 
  2. 2.Division of Social SciencesInternational Christian UniversityTokyoJapan

Personalised recommendations