The Inconsistency of the Algorithms of Jaro–Winkler and Needleman–Wunsch Applied to DNA Chain Similarity Results
There are many different algorithms for calculating the distances between DNA chains. Different algorithms for determining such distances give different results. This paper does not consider issues related to which of the classical algorithms is better, but shows the inconsistency of two classical a...
Saved in:
Main Author: | Boris Melnikov |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/13/2/263 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Objevená a ztracená paměť kurdských hor. Cesta Josefa Wünsche do Arménie a Kurdistánu
by: Veronika Faktorová
Published: (2024-12-01) -
Efficient method of constructing parameters in R-ate paring
by: LI Bin, et al.
Published: (2010-01-01) -
Proposing an Improved Version of the Bat Algorithm
by: Davar Giveki, et al.
Published: (2024-12-01) -
A sparrow search algorithm based hybrid meta-heuristic algorithm for population growth rate prediction
by: Milad Shahvaroughi Farahani, et al.
Published: (2023-12-01) -
<italic>UAV-NavS</italic>: Three-Dimensional Navigation System of Multiple Unmanned Aerial Vehicles Using Hybrid Optimization Algorithm
by: Monia Digra, et al.
Published: (2025-01-01)