Fast algorithm for finding mean minimum distances
Abstract
Let £o,..., £n be strings drawn from some finite alphabet. In this paper we describe an algorithm for finding mean minimum distances between strings io,..., £s for all s ^ n. The complexity of the algorithm is O(nm), where m is the length of strings.
References
1. Майоров, В.В. Статистическая оценка обобщенных размерностей /В.В.Майоров, Е.А.Тимофеев //Мат. заметки. - 2002. -Т.71. №5. - C. 697 - 712.
2. Kaltchenko, A., Entropy Estimators with Almost Sure Convergence and an O(n-1) Variance /A.Kaltchenko, En-hui Yang, N.Timofeeva //Information Theory Workshop. 2007. ITW '07. IEEE 2-6 Sept. 2007. - P. 644 - 649.
Review
For citations:
Timofeeva N.E. Fast algorithm for finding mean minimum distances. Modeling and Analysis of Information Systems. 2007;14(3):50-52. (In Russ.)
Views:
408
Email this article 