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!
|
| _version_ | 1849240998218039296 |
|---|---|
| author | N. E. Timofeeva |
| author_facet | N. E. Timofeeva |
| author_sort | N. E. Timofeeva |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-eba5aee3fd7b4e6491f0bb46ff44325e |
| institution | Kabale University |
| issn | 1818-1015 2313-5417 |
| language | English |
| publishDate | 2007-09-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj-art-eba5aee3fd7b4e6491f0bb46ff44325e2025-08-20T04:00:19ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172007-09-011435052877Fast algorithm for finding mean minimum distancesN. E. Timofeeva0Ярославский государственный университет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.https://www.mais-journal.ru/jour/article/view/1136 |
| spellingShingle | N. E. Timofeeva Fast algorithm for finding mean minimum distances Моделирование и анализ информационных систем |
| title | Fast algorithm for finding mean minimum distances |
| title_full | Fast algorithm for finding mean minimum distances |
| title_fullStr | Fast algorithm for finding mean minimum distances |
| title_full_unstemmed | Fast algorithm for finding mean minimum distances |
| title_short | Fast algorithm for finding mean minimum distances |
| title_sort | fast algorithm for finding mean minimum distances |
| url | https://www.mais-journal.ru/jour/article/view/1136 |
| work_keys_str_mv | AT netimofeeva fastalgorithmforfindingmeanminimumdistances |