Interested to Buy Any Domain ? << Click Here >> for more details...
what is database?how to tell 3years boy or girl by using toys?
- 1 Answers
- 3412 Views
- I also Faced
- E-Mail Answers
Answer / reena.shirale
we save your money to our parents. like that you save our data in a database.. to safty..
| Is This Answer Correct ? | 0 Yes | 1 No |
Write a program to find whether a given number is prime or not.
I want Ada programming language books. Could anyone post me any link for that?
Diff between %let and Call symput?
5. How do you round the addition or subtraction of two numbers in assembler?
what is class module in vb6? what it's use? with example..
Given an array of size n. It contains numbers in the range 1 to n. Find the numbers which aren?t present.
i want to improve my english vocab for racking campus written exam plz tell me best book for prepration......
how can i create report in abap to insert data in table pa0002 using insert command
Compare any 4 software development life cycle paradigms with each other. Indicate at least one application for each of the paradigms that are suitable to developed using that paradigm.
1.Describe about your project?
how MATLSB software suitable for electrical branch? which tools are useful??
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 
