Digital search trees and chaos game representation*
and Université Paul Sabatier (Toulouse III) – INRIA Domaine de
Voluceau, B.P. 105, 78153 Le Chesnay Cedex, France.
2 LAMA, UMR CNRS 8100, Bâtiment Fermat, Université de Versailles – Saint-Quentin, 78035 Versailles, France.
Revised: 1 March 2007
In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGR-tree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height, the insertion depth for DST built from independent successive random sequences having the same distribution. Here the successive inserted words are strongly dependent. We give the asymptotic behaviour of the insertion depth and the length of branches for the CGR-tree obtained from the suffixes of a reversed i.i.d. or Markovian sequence. This behaviour turns out to be at first order the same one as in the case of independent words. As a by-product, asymptotic results on the length of longest runs in a Markovian sequence are obtained.
Mathematics Subject Classification: 60C05 / 68R15 / 92D20 / 05D40
Key words: Random tree / Digital Search Tree / CGR / lengths of the paths / height / insertion depth / asymptotic growth / strong convergence
© EDP Sciences, SMAI, 2009