Culminating paths

Details Culminating paths Culminating paths

2007-06-05

arxiv.org/abs/0706.0694v2

Discrete Mathematics & Theoretical Computer Science 10, 2 (2008) 125--152

Mathematics

Combinatorics

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Culminating paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Culminating paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Culminating paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122689