On the d-complexity of strings
Zoltan Kasa
TL;DR
This paper explores the concept of d-complexity in strings, focusing on the number of distinct d-substrings, with detailed analysis for the case d=1, highlighting its relevance in biology, information theory, and computer science.
Contribution
It provides a detailed study of the d-complexity of strings, especially for d=1, contributing to understanding string complexity in various scientific fields.
Findings
Analysis of d=1 case of string complexity
Insights into string complexity in biological sequences
Applications in information theory and computer science
Abstract
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a string is defined as the number of its distinct d-substrings given in Definition 1. The case d=1 is studied in detail.
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
TopicsCoding theory and cryptography · Fractal and DNA sequence analysis · semigroups and automata theory