On the d-complexity of strings

Details On the d-complexity of strings On the d-complexity of strings

2010-02-13

arxiv.org/abs/1002.2721v1

Pure Math. Appl., 9, 1-2 (1998) pp. 119-128

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the d-complexity of strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the d-complexity of strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the d-complexity of strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324121