bioRxiv · 10.1101/2020.05.27.118273
The Homo-Edit Distance Problem
Abstract
We consider the homo-edit distance problem, which is the minimum number of homo-deletions or homo-insertions to convert one string into another. A homo-insertion is the insertion of a string of equal characters into another string, while a homo-deletion is the inverse operation. We show how to compute the homo-edit distance of two strings in polynomial time: We first demonstrate that the problem is equivalent to computing a common subsequence of the two input strings with a minimum number of homo-deletions and then present a dynamic programming solution for the reformulated problem. 2012 ACM Subject ClassificationApplied computing [->] Bioinformatics; Applied computing [->] Molecular sequence analysis; Theory of computation [->] Dynamic programming
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Brand, M., Tran, N. K., Spohr, P., Schrinner, S., Klau, G. W.. 2020-06-03. The Homo-Edit Distance Problem. https://doi.org/10.1101/2020.05.27.118273
Cite the original work for its findings. Save a collection to share your selection of sources.