Interested to Buy Any Domain ? << Click Here >> for more details...
What is easiest way to get the PL/i compiler,I didn't have
found the compiler in my library.
Is there any extra cost if we want to access the PL/1
programs?Actually we r having Mainframe rented training Ids
- 0 Answers
- 2118 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
write the a cl program with the following specification A. Accept 2 parameters-date and date type B. if date type is J then convert date to *MDY format C. if date type is M convert date to *JUL format 4.send a program message with the value of converted date Please explain for each with coding?
what is the current salary package in India for a lamp programmer
How can we develop a multi-tier application in Java?
how many logical drive we can form to physical device in our computer?
difference between mantis and other tools?
How do i find out the number of parameters passed into function?
can any method return type may be constructor , or that method name allow
What is the best action a system can take when deadlock is detected
what is client server & server? What r types of Joins? explsin it! which types of indexex in sql server? what is triggers?
what is difference between input parameter and output parameter.
how can we maintain the previous version scripts to new version.
0 Answers DST Global Solutions,
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 
