How to Obtain data from the client via an outgoing event
dispinterface in ATL ?
262
How to test if a given string contains a valid number?
91
what is the difference between read the data from table and
infotype
105
How to use the InterBase API security functions to add,
modify and delete users?
113
How to use the Lookup method to return values from multiple
columns ?
92
How to Adjust form size to accommodate a required client size ?
98
What version of TeeChart is supplied with Delphi 6?
152
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.
216
what is activex
47
How to Display a bitmap on the client area of an MDI parent
form?
71
How to Finddistance between two points?
84
How to Get a list of the available drives on a system?
87
How to Convert from Long to Short file names and paths ?
157
what are the difference between ANSI C and Let Us c and Turbo C
Ask Questions on ANYTHING, that arise in your Daily Life at 
Site Map
