Finding out statistically significant words in DNA and protein sequences forms the basis for many genetic studies. By applying the maximal entropy principle, we give one systematic way to study the nonrandom occurrence of words in DNA or protein sequences. Through comparison with experimental...

Given a sequence composed of a limited number of characters, we try to “read” it as a “text”. This involves segmenting the sequence into “words”. The difficulty is to distinguish good segmentation from enormous numbers of random ones. Aiming at revealing the nonrandomness of the...

We propose and analyze a random graph model which explains a phenomena in the economic company network in which company may not expand its business at some time due to the limiting of money and capacity. The random graph process is defined as follows: at any time-step t, (i) with probability...