Theory:
• The ORF Finder (Open Reading Frame Finder) is a graphical analysis tool which finds all open reading frames of a selectable minimum size in a user's sequence or in a sequence already in the database.
• This tool identifies all open reading frames using the standard or alternative genetic codes. The deduced amino acid sequence can be saved in various formats and searched against the sequence database using the WWW BLAST server.
• The ORF Finder should be helpful in preparing complete and accurate ....etc

[:=Read Full Message Here=:]

Objective
Program in “LEX” to count the verb in a given line of text.

%{
%}
%%
isI
areI
amI printf(%s is verb,yytext );
+ {printf(%s is not a verb,yytext);}
.I\n {ECHO;}
%%
main()
{
yylex();
}
....etc

[:=Read Full Message Here=:]

#include
#include
short x;
void dft(short *x, short k, int *out); //function prototype
#define N 8 //number of data values
float pi = 3.1416;
int sumRe,sumIm;
short x = {1,2,3,4,5,6,7,8}; //1-cycle cosine
int out = {0,0};
int real,imag,k=0; //init Re and Im results
void dft(short *x, short k, int *out) //DFT function
{
int sumRe = 0, sumIm = 0; //init real/imag components
float cs = 0, sn = 0; //init cosine/sine components
int i = 0;
for (i = 0; i < N; i++) //for N-point DFT
{
cs = cos(2* ....etc

[:=Read Full Message Here=:]

Aim:
To write a C# program to perform encryption and decryption of the given data.

Algorithm
ALGORITHM FOR ENCRYPTION:
Step 1: Declare the class as encrypt_class.
Step 2: Start the main function.
Step 3: Declare the variable str in string data type.
Step 4: Create the object for inbuild encryption
algorithm TripleDESCryptoServiceProvider.
Step 5: Create the data file using Filestream
class.
Step 6: Create the object for class cryptoStream.
Cryptostream is a class to ....etc

[:=Read Full Message Here=:]

Theory:
• HMMgene is a program for prediction of genes in anonymous DNA. The program predicts whole genes, so the predicted exons always splice correctly. It can predict several whole or partial genes in one sequence, so it can be used on whole cosmids or even longer sequences. HMMgene can also be used to predict splice sites and start/stop codons. If some features of a sequence are known, such as hits to ESTs, proteins, or repeat elements, these regions can be locked as coding or non-coding and then the program ....etc

[:=Read Full Message Here=:]

Sequence 1:
>gi|44955888|ref|NP_976312.1| myoglobin
MGLSDGEWQLVLNVWGKVEADIPGHGQEVLIRLFKGHPETLEKFDKFKHLKSEDEMKASEDLKKHGATVLTALGGILKKKGHHEAEIKPLAQSHATKHKIPVKYLEFISECIIQVLQSKHPGDFGADAQGAMNKALELFRKDMASNYKELGFQG
Sequence 2:
>gi|21359820|ref|NP_038621.2| myoglobin
MGLSDGEWQLVLNVWGKVEADLAGHGQEVLIGLFKTHPETLDKFDKFKNLKSEEDMKGSEDLKKHGCTVLTALGTILKKKGQHAAEIQPLAQSHATKHKIPVKYLEFISEIIIEVLKKRHSGDFGADAQGAMSKALELFRNDIAAKYKELGFQG
Sequence 3:
>gi|11024650|ref|NP_067599.1| myoglobin [Ra ....etc

[:=Read Full Message Here=:]

i need the values of twiddle factor for an eight point dft (to use in matrix form) ....etc

[:=Read Full Message Here=:]

Objective:
To predict the genes in the given nucleotide sequence (NM_000230.2) of human using the GenScan tool.
Theory:
• GenScan allows prediction of complete gene structures in genomic sequences, including exons, introns, promoters and poly-adenylation signals.
• GenScan differs from the majority of gene finding algorithms as it can identify complete, partial and multiple genes on both DNA strands. The program is based on a probabilistic model of gene structure/compositional properties and does not ....etc

[:=Read Full Message Here=:]

Procedure:-
1) Enter the number of points, N
2) Enter the input sequence elements, x
3) Create a vector for the sample index, ’n’
4) Initialize loop variable, ‘k’ for the DFT samples X(k)
5) Calculate the twiddle factor for each ‘k’
6) Multiply x and the twiddle factors , elements-by-element
7) Sum all the products, assign to X(k)
8) Plot the magnitude and phase spectrum
9) Verify the results with built in function
MATLAB program for DFT
clear
clc
close all
% ENTER THE NUMBER OF POINTS
N = ....etc

[:=Read Full Message Here=:]

Algorithm:-
begin
if a,e,I,o,u or A,E,I,O,U
then
printf “It is a vowel”
else
printf “It is a consonant”
end

1. LEX program to count number of vowels and consonants in a given input string

%%
{printf(“it is vowel”);}
{printf(“it is consonant”);}
%%
main()
{
yylex();
}
int yywrap()
{
return 1;
}


Output:

$./a.out
a
it is a vowel
g
it is a consonant
....etc

[:=Read Full Message Here=:]