Methods to Estimate Cryptic Sequence Complexity
View at Publisher
| Authors | Matthew Andres Moreno |
| Date | April 16th, 2024 |
| DOI | 10.48550/arXiv.2404.10854 |
| Venue | arXiv |
Abstract
Complexity is a signature quality of interest in artificial life systems. Alongside other dimensions of assessment, it is common to quantify genome sites that contribute to fitness as a complexity measure. However, limitations to the sensitivity of fitness assays in models with implicit replication criteria involving rich biotic interactions introduce the possibility of difficult-to-detect “cryptic” adaptive sites, which contribute small fitness effects below the threshold of individual detectability or involve epistatic redundancies. Here, we propose three knockout-based assay procedures designed to quantify cryptic adaptive sites within digital genomes. We report initial tests of these methods on a simple genome model with explicitly configured site fitness effects. In these limited tests, estimation results reflect ground truth cryptic sequence complexities well. Presented work provides initial steps toward development of new methods and software tools that improve the resolution, rigor, and tractability of complexity analyses across alife systems, particularly those requiring expensive in situ assessments of organism fitness.
BibTeX
@misc{moreno2024methods,
doi={10.48550/arXiv.2404.10854},
url={https://arxiv.org/abs/2404.10854},
title={Methods to Estimate Cryptic Sequence Complexity},
author={Matthew Andres Moreno},
year={2024},
eprint={2404.10854},
archivePrefix={arXiv},
primaryClass={q-bio.PE}
}
Citation
Moreno, M. A. (2024). Methods to Estimate Cryptic Sequence Complexity. arXiv preprint arXiv:2404.10854.