Parking functions, labeled trees and DCJ sorting scenarios - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Parking functions, labeled trees and DCJ sorting scenarios

Résumé

In genome rearrangement theory, one of the elusive questions raised in recent years is the enumeration of rearrangement scenarios be- tween two genomes. This problem is related to the uniform generation of rearrangement scenarios, and the derivation of tests of statistical signifi- cance of the properties of these scenarios. Here we give an exact formula for the number of double-cut-and-join (DCJ) rearrangement scenarios of co-tailed genomes. We also construct effective bijections between the set of scenarios that sort a cycle and well studied combinatorial objects such as parking functions and labeled trees.
Fichier principal
Vignette du fichier
Ouangraoua-Bergeron-09.pdf (331.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00527614 , version 1 (19-10-2010)

Identifiants

  • HAL Id : hal-00527614 , version 1

Citer

Aïda Ouangraoua, Anne Bergeron. Parking functions, labeled trees and DCJ sorting scenarios. Recomb Comparative Genomics 2009, 2009, Hungary. pp.24-35. ⟨hal-00527614⟩
75 Consultations
172 Téléchargements

Partager

Gmail Facebook X LinkedIn More