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 Classification Applied computing → Bioinformatics; Applied computing → Molecular sequence analysis; Theory of computation → Dynamic programming
Competing Interest Statement
The authors have declared no competing interest.
Footnotes
↵1 Shared first authors.
maren.brand{at}hhu.de, nguyen.tran{at}hhu.de, philipp.spohr{at}hhu.de, sven.schrinner{at}hhu.de, gunnar.klau{at}hhu.de