Journal of KIISE (정보과학회 논문지)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

δ-approximate Periods and γ-approximate Periods of Strings over Integer Alphabets

정수문자집합에 대한 문자열의 δ-근사주기와 γ-근사주기

  • 김영호 (인하대학교 컴퓨터정보공학과) ;
  • 심정섭 (인하대학교 컴퓨터정보공학과)
  • Received : 2016.02.23
  • Accepted : 2016.07.27
  • Published : 2016.10.15
⟨ Previous Next ⟩

Abstract

(${\delta}$, ${\gamma}$)-matching for strings over integer alphabets can be applied to such fields as musical melody and share prices on stock markets. In this paper, we define ${\delta}$-approximate periods and ${\gamma}$-approximate periods of strings over integer alphabets. We also present two $O(n^2)$-time algorithms, each of which finds minimum ${\delta}$-approximate periods and minimum ${\gamma}$-approximate periods, respectively. Then, we provide the experimental results of execution times of both algorithms.

정수로 표현된 문자열에 대한 (${\delta}$, ${\gamma}$)-매칭은 음악서열이나 주가 연구에 응용될 수 있다. 본 논문에서는 정수문자집합에 대한 문자열의 ${\delta}$-근사주기와 ${\gamma}$-근사주기의 개념을 제시한다. 또한 최소 ${\delta}$-근사주기와 최소 ${\gamma}$-근사주기를 각각 $O(n^2)$ 시간에 찾는 알고리즘들을 제시하고 수행시간을 측정한 결과를 보인다.

Keywords

Acknowledgement

Supported by : 한국연구재단

References

  1. J. Ziv, A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Transactions on information theory, Vol. IT-23, No. 3, 1977.
  2. M. Burrows, D. J. Wheeler, "A Block-sorting Lossless Data Compression Algorithm," Technical report 124, Palo Alto, CA: Digital Equipment Corporation, 1994.
  3. J. S. Sim, C. S. Iliopoulos, K. Park, W. F. Smyth, "Approximate periods of strings," Theoretical Computer Science, Vol. 262, pp. 557-568, 2001. https://doi.org/10.1016/S0304-3975(00)00365-0
  4. J. H. Jeong, Y. H. Kim, J. C. Na, J. S. Sim, "Approximate Periods of Strings based on Distance Sum for DNA Sequence Analysis," KIPS Transactions on Software and Data Engineering, Vol. 2, No. 2, pp. 119-122, 2013. (in Korean) https://doi.org/10.3745/KTSDE.2013.2.2.119
  5. E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon, "Algorithms for computing approximate repetitions in musical sequences," International Journal of Computer Mathematics, Vol. 79, No. 11, pp. 1135-1148, 2002. https://doi.org/10.1080/00207160213939
  6. C. S. Iliopoulos, T. Lecroq, L. Mouchard, and Y. J. Pinzon, "Computing Approximate Repetitions in Musical Sequences," Proc. of Prague Stringology Club Workshop (PSCW'00), pp. 49-59, 2000.
  7. M. Crochemore, C. S. Iliopoulos, T. Lecroq, W. Plandowski, W. Rytter, "Three Heuristics for ${\delta}$-Matching: ${\delta}$-BM Algorithms," Proc. Combinatorial Pattern Matching, LNCS 2373, pp. 178-189, 2002.
  8. D. Cantone, S. Cristofaro, and S. Faro, "Efficient Algorithms for the ${\delta}$-Approximate String Matching Problem in Musical Sequences," Proc. of the Prague Stringology Conference, pp. 69-82, 2004.
  9. P. Clifford, R. Clifford, and C. S. Iliopoulos, "Faster Algorithms for ${\delta},{\gamma}$-Matching and Related Problems," Proc. Combinatorial Pattern Matching, LNCS 3537, pp. 68-78, 2005.
  10. I. Lee, R. Clifford, and S.-R. Kim, "Algorithms on Extended (${\delta},{\gamma}$)-Matching," Computational Science and Its Applications - ICCSA 2006, LNCS 3982, pp. 1137-1142, 2006.
  11. Y. J. Pinzon-Ardila, M. Christodoulakis, C. S. Iliopoulos, M. Mohamed, "Efficient (${\delta},{\gamma}$)-Pattern Matching with Don't cares," Proc. 16th Australasian Workshop on Combinatorial Algorithms, pp. 27-38, 2005.
  12. C. S. Iliopoulos, M. Mohamed, V. Mohanaraj, "Experimental (${\delta},{\gamma}$)-Pattern Matching with Don't cares," Proc. SMC'07, 4th Sound and Music Computing Conference, pp. 142-148, 2007.
  13. P. Bloomfield, W. L. Steiger, Least Absolute Deviations: theory, applications, and algorithms, Birkhauser Boston, Inc., 1983.
  14. G. Marsaglia, J. C. W. Marsaglia, "A New Derivation of Stirling's Approximation to n!," The American Mathematical Monthly, Vol. 97, No. 9, pp. 826-829, 1990. https://doi.org/10.2307/2324749
  15. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, 3rd Ed., The MIT Press, 2009.