Optimal representation in biological systems.
Gespeichert in:
| Titel: | Optimal representation in biological systems. |
|---|---|
| Autoren: | Kak S; Oklahoma State University, Stillwater, OK, USA. subhash.kak@okstate.edu. |
| Quelle: | Theory in biosciences = Theorie in den Biowissenschaften [Theory Biosci] 2025 Nov; Vol. 144 (3-4), pp. 237-242. Date of Electronic Publication: 2025 Jul 05. |
| Publikationsart: | Journal Article |
| Sprache: | English |
| Info zur Zeitschrift: | Publisher: Urban & Fischer Country of Publication: Germany NLM ID: 9708216 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 1611-7530 (Electronic) Linking ISSN: 14317613 NLM ISO Abbreviation: Theory Biosci Subsets: MEDLINE |
| Imprint Name(s): | Publication: Jena : Urban & Fischer Original Publication: Jena : Gustav Fischer, c1997- |
| MeSH-Schlagworte: | Models, Biological*, Animals ; Algorithms ; Neurons/physiology ; Songbirds/physiology ; Computer Simulation ; Models, Neurological ; Logistic Models |
| Abstract: | Competing Interests: Declarations. Competing interests: The authors declare no competing interests. An optimal representation constitutes an efficient set. It is known that for an aggregating system if the cost of representation increases linearly with the number of bases, ternary coding is superior to binary, and coding in e is optimal. This paper investigates the relative efficiency of bases for the cases when the cost complexity is affine (slope-intercept linear), exponential, and logistic and presents new results. It is shown that for representation of structure in logistic maps, which applies often to biological systems and is true for input-output maps of neurons, the optimal base value is near 1.7632, which is consistent with the unary and space coding of information in songbirds. It is shown that the mathematical basis of this result is the solution to the equation INLINEMATH (© 2025. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.) |
| References: | Barnsley MF (1993) Fractals everywhere. Academic Press Professional. Detlefsen NS, Hauberg S, Boomsma W (2022) Learning meaningful representations of protein sequences. Nat Commun 13:1914. (PMID: 10.1038/s41467-022-29443-w353958438993921) Fiete IR, Seung HS (2007) Neural network models of birdsong production, learning, and coding. In: Squire L, et al (eds) New encyclopedia of neuroscience. Elsevier. Grassberger P (1983) Generalized dimensions of strange attractors. Phys Lett A 97(6):227–230. (PMID: 10.1016/0375-9601(83)90753-3) Hurst SL (1984) Multiple-valued logic - its status and its future. IEEE Trans Comput C–33:1160–1179. (PMID: 10.1109/TC.1984.1676392) Kak S (2015) Generalized unary coding. Circuits Syst Signal Process 35(4):1419–1426. (PMID: 10.1007/s00034-015-0120-7) Kak S (2021a) The base-e representation of numbers and the power law. Circuits Syst Signal Process 40:490–500. (PMID: 10.1007/s00034-020-01480-0) Kak S (2021b) The intrinsic dimensionality of data. Circuits Syst Signal Process 40:2599–2607. (PMID: 10.1007/s00034-020-01583-8) Kak S (2023a) The dimensionality of genetic information. Parallel Process Lett. https://doi.org/10.1142/S0129626423400121. (PMID: 10.1142/S0129626423400121) Kak S (2023b) Self-similarity and the maximum entropy principle in the genetic code. Theory Biosci 142:205–210. (PMID: 10.1007/s12064-023-00396-y37402087) Kak S (2025) Filaments and spirals in a noninteger dimensional universe. Indian J Phys 99:1569–1574. (PMID: 10.1007/s12648-024-03357-3) Mackey G (2004) The mathematical foundations of quantum mechanics. Dover Publications. Mandelbrot BB (1983) The fractal geometry of nature. Macmillan. (PMID: 10.1119/1.13295) Minelli A, Fusco G, Sartori S (1991) Self-similarity in biological classifications. Biosystems 26:89–97. (PMID: 10.1016/0303-2647(91)90040-R1841641) Musil F et al (2021) Physics-inspired structural representations for molecules and materials. Chem Rev 121(16):9759–9815. (PMID: 10.1021/acs.chemrev.1c0002134310133) Rapaport A (2024) On self-affine measures associated to strongly irreducible and proximal systems, Adv Math 449. Ratsaby J (2024) On system complexity, stability and performance: application to prediction. Math Mech Complex Syst 12(4):411–470. (PMID: 10.2140/memocs.2024.12.411) Ratsaby J (2025) Fractal information density. Chaos Solitons Fractals 192:115989. (PMID: 10.1016/j.chaos.2025.115989) Saniga M (2003) Geometry of time and dimensionality of space. In: Buccheri R, Saniga M, Stuckey WM (eds) The nature of time: geometry, physics and perception. NATO Science Series, vol 95. Springer, Dordrecht. Vedral V (2006) Introduction to quantum information science. Oxford University Press, Oxford. (PMID: 10.1093/acprof:oso/9780199215706.001.0001) |
| Contributed Indexing: | Keywords: Binary coding; Logistic map; Optimal representation; Ternary representation |
| Entry Date(s): | Date Created: 20250705 Date Completed: 20251030 Latest Revision: 20251030 |
| Update Code: | 20251030 |
| DOI: | 10.1007/s12064-025-00444-9 |
| PMID: | 40616701 |
| Datenbank: | MEDLINE |
| Abstract: | Competing Interests: Declarations. Competing interests: The authors declare no competing interests.<br />An optimal representation constitutes an efficient set. It is known that for an aggregating system if the cost of representation increases linearly with the number of bases, ternary coding is superior to binary, and coding in e is optimal. This paper investigates the relative efficiency of bases for the cases when the cost complexity is affine (slope-intercept linear), exponential, and logistic and presents new results. It is shown that for representation of structure in logistic maps, which applies often to biological systems and is true for input-output maps of neurons, the optimal base value is near 1.7632, which is consistent with the unary and space coding of information in songbirds. It is shown that the mathematical basis of this result is the solution to the equation INLINEMATH<br /> (© 2025. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.) |
|---|---|
| ISSN: | 1611-7530 |
| DOI: | 10.1007/s12064-025-00444-9 |
Full Text Finder
Nájsť tento článok vo Web of Science