Diff between IF and where ?
- 0 Answers
- 1804 Views
- Accenture, I also Faced
- E-Mail Answers
Piggy backing is a technique for a) Flow control b) sequence c) Acknowledgement d) retransmition
17 Answers Fast Booking, HCL, Lucent, NIC,
Write a pascal program to calculate the sum of the first 100 even number and odd number
what is the difference between read the data from table and infotype
can u help me? how do solve the transpose problem in ireport? if any one know send to eswaran_2006@yahoo.co.in
Binary tree?
can we use commit,rollback in triggers and how?
Is strus threadsafe or not?
How can we alter the data after creating a view
what will be the model paper for the post of assistant programmer in delhi high court
Difference between interface and abstract class?
how do i create my own exception class which will restrict IO exception?
In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 ≤ i0 <i1….< ik-1 ≤ n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.
C 
