Digital Search Trees and Chaos Game Representation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Digital Search Trees and Chaos Game Representation

Brigitte Chauvin
Stéphane Ginouillac
  • Function : Author
Nicolas Pouyanne
  • Function : Author


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 length of branches for the CGR-tree obtained from the suffixes of a reversed i.i.d. or Markovian sequence As a by-product, asymptotic results on the length of longest runs in a Markovian sequence are obtained
Fichier principal
Vignette du fichier
RR-5856.pdf (340.11 Ko) Télécharger le fichier

Dates and versions

inria-00070170 , version 1 (19-05-2006)


  • HAL Id : inria-00070170 , version 1


Peggy Cénac, Brigitte Chauvin, Stéphane Ginouillac, Nicolas Pouyanne. Digital Search Trees and Chaos Game Representation. [Research Report] RR-5856, INRIA. 2006, pp.27. ⟨inria-00070170⟩
61 View
126 Download


Gmail Facebook X LinkedIn More