Fast algorithm for finding mean minimum distances
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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2007-09-01
|
| Series: | Моделирование и анализ информационных систем |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1136 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|