Approximate String Matching with Non-Overlapping Adjacent Unbalanced Translocations
In this paper, we investigate the <i>approximate string matching problem</i> when the allowed edit operations are <i>non-overlapping unbalanced translocations of adjacent factors</i>. This kind of edit operation takes place when two adjacent substrings of the text swap, resul...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/13/13/2103 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|