Algorithmical Aspects of Some Bio Inspired Operations
Marius Dumitran

TL;DR
This thesis explores formal models of biologically inspired string operations, including duplication and completion, revealing their computational properties and applications in genetic sequence analysis.
Contribution
It introduces bounded duplication operations, analyzes their language classes, and proposes new methods for detecting complex repetitive structures in DNA sequences.
Findings
Bounded duplication generates context-sensitive languages.
Prefix-suffix-square completion produces infinite square-rich words.
Extended methods for detecting gapped repeats and palindromes.
Abstract
This thesis investigates three biologically inspired operations: prefix-suffix duplication, bounded prefix-suffix duplication, and prefix-suffix-square completion. Duplication, a common genetic mutation, involves repeating DNA sequences and is modeled here as formal operations on words. The prefix-suffix duplication generates non-context-free languages, even from simple initial words. To better reflect biological processes, we propose a bounded variant that limits duplication length, resolving unsolved problems and aligning with biochemical realities. We also introduce the prefix-suffix-square completion operation, which generates squares at sequence ends. This operation enables the generation of infinite words such as Fibonacci, Period-doubling, and Thue-Morse, which contain squares but avoid higher exponent repetitions, highlighting unique structural properties. In contrast,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Computability, Logic, AI Algorithms
