E mail received From Vilas Bhonde.
ખૂબ સ રસ
બને તો આપ ગુજરાતી ભાષાંતર મૂકશો
સાંપ્રત સમયમા ડીએનએ સીક્વન્સીંગમા વપરાતી આવી જ બે પધ્ધતિઓ
the “tortoise and the hare” algorithm, is a pointer algorithm that uses only two pointers, which move through the sequence at different speeds. The algorithm is named for Robert W. Floyd, who invented it in the late 1960s.
The key insight in the algorithm is that, for any integers i ≥ μ and k ≥ 0, xi = xi + kλ, where λ is the length of the loop to be found. In particular, whenever i = kλ ≥ μ, it follows that xi = x2i. Thus, the algorithm only needs to check for repeated values of this special form, one twice as far from the start of the sequence than the other, to find a period ν of a repetition that is a multiple of λ. Once ν is found, the algorithm retraces the sequence from its start to find the first repeated value xμ in the sequence, using the fact that λ divides ν and therefore that xμ = xν + μ. Finally, once the value of μ is known it is trivial to find the length λ of the shortest repeating cycle, by searching for the first position μ + λ for which xμ + λ = xμ.
nice one !
Fill in your details below or click an icon to log in:
You are commenting using your WordPress.com account. ( Log Out / બદલો )
You are commenting using your Twitter account. ( Log Out / બદલો )
You are commenting using your Facebook account. ( Log Out / બદલો )
You are commenting using your Google+ account. ( Log Out / બદલો )
Connecting to %s
Notify me of new comments via email.