Incremental Patterns in Text Search

  • Makoto Yamaguchi
  • Takao Miura
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 511)


In this investigation, we propose a new kind of text retrieval, called dynamic KMP, where the pattern becomes longer incrementally.We introduce several auxiliary information for efficient management and examine how well the approach the works.


Dynamic KMP KMP algorithm incremental patterns text retrieval 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ishihata, K.: Algorithm and Data Structure. Iwanami Publishing (1989) (in Japanese)Google Scholar
  2. 2.
    Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935–948 (1993)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
  4. 4.
    Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Weiner, P.: Linear pattern matching algorithm. In: 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11 (1973)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Dept.of Elect.& Elect. Engr.HOSEI UniversityKoganeiJapan

Personalised recommendations