Culminating paths - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2007

Culminating paths

Résumé

Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first encountered in bioinformatics, in the analysis of similarity search algorithms. They are also related to certain models of Lorentzian gravity in theoretical physics. We first show that the language on a two letter alphabet that naturally encodes culminating paths is not context-free. Then, we focus on the enumeration of culminating paths. A step by step approach, combined with the kernel method, provides a closed form expression for the generating fucntion of culminating paths ending at a (generic) height k. In the case a=b, we derive from this expression the asymptotic behaviour of the number of culminating paths of length n. When a>b, we obtain the asymptotic behaviour by a simpler argument. When a= b, with no precomputation stage nor non-linear storage required. The choice of the best algorithm is not as clear when a
Fichier principal
Vignette du fichier
culminants6.pdf (433.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00151979 , version 1 (05-06-2007)
hal-00151979 , version 2 (30-04-2008)

Identifiants

Citer

Mireille Bousquet-Mélou, Yann Ponty. Culminating paths. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 10 no. 2, ⟨10.46298/dmtcs.438⟩. ⟨hal-00151979v1⟩
210 Consultations
666 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More