String alignment with substitution, insertion, deletion, squashing, and expansion operations
Information Sciences—Informatics and Computer Science: An International Journal
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Handbook of Formal Languages
Solving NP-Complete Problems With Networks of Evolutionary Processors
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Error Corrections for Channels with Substitutions, Insertions, and Deletions
Selected Papers from the 4th Canadian Workshop on Information Theory and Applications II
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
A Similarity Measure for Cyclic Unary Regular Languages
Fundamenta Informaticae
Reliable communication over channels with insertions, deletions, and substitutions
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We extend the edit operators of substitution, deletion, and insertion of a symbol over a word by introducing two new operators (partial copy and partial elimination) inspired by biological gene duplication. We define a disruption measure for an operator over a word and prove that whereas the traditional edit operators are disruptive, partial copy and partial elimination are non-disruptive. Moreover, we show that the application of only edit operators does not generate (with low disruption) all the words over a binary alphabet, but this can indeed be done by combining partial copy and partial elimination with the substitution operator.