IMPLEMENTING LEVENSHTEIN EDIT DISTANCE ALGORITHM IN DNA PROFILES DIRECT MATCHING
Issued Date
2026-01-01
Resource Type
ISSN
1881803X
Scopus ID
2-s2.0-105024974951
Journal Title
Icic Express Letters
Volume
20
Issue
1
Start Page
89
End Page
99
Rights Holder(s)
SCOPUS
Bibliographic Citation
Icic Express Letters Vol.20 No.1 (2026) , 89-99
Suggested Citation
Werukanjana P., Sa-Nga-Ngam P., Permpool N. IMPLEMENTING LEVENSHTEIN EDIT DISTANCE ALGORITHM IN DNA PROFILES DIRECT MATCHING. Icic Express Letters Vol.20 No.1 (2026) , 89-99. 99. doi:10.24507/icicel.20.01.89 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/114465
Title
IMPLEMENTING LEVENSHTEIN EDIT DISTANCE ALGORITHM IN DNA PROFILES DIRECT MATCHING
Author(s)
Author's Affiliation
Corresponding Author(s)
Other Contributor(s)
Abstract
Matching DNA profiles differs from matching DNA sequences: a crucial distinction in forensic analysis. DNA laboratories rely heavily on comparing profiles for individual identification, with tools like the CODIS international database. While some countries may not use those systems due to ethical concerns, local or regional labs might develop their own databases or DNA profile matching tools. This study introduces a new technique for direct profile matching using the Levenshtein edit distance algorithm, which eliminates the need for a DNA database. The research utilized PROVEDIt STR multiplexes Identifiler® profiles, amplifying 15 loci along with the gender-determining Amelogenin locus, totaling 16 loci. By converting a suspect’s complete profile to a partial one from a crime scene, the experiment compared each pair of loci following traditional forensic decision rules, and employed the Levenshtein edit distance algorithm for pairwise matching. The algorithm displayed 100% precision, recall, F1-score, and ROC/AUC, indicating perfect performance. This is a reliable method for direct DNA profile matching, independent of a database, with potential integration into future AI-driven forensic work.