For each file

- the file name contain the length N of the promoter (1000 or 2000)
- the columns are
  1 - k-mer of DNA
  2 - waiting time T for occurrence in a promoter of length $N$
  3 - probability P of occurrence at time 1 while not occurring at time 0
       in a sequence of length N

- The probability P and the waiting time N verify
  T = 1/P

Note that for different lengths of promoters, the probability P is linear
with respect to the length N of the promoter.

See Behrens-Nicaud-Nicodeme (2011)
An automaton approach for waiting times in DNA evolution