DNA Sequence Representation methods

DNA sequence representation methods are used to denote a gene structure effectively and help in similarities/dissimilarities analysis of coding sequences. Many different kinds of representations have been proposed in the literature. They can be broadly classified into Numerical, Graphical, Geometrical and Hybrid representation methods. DNA structure and function analysis are made easy with graphical and geometrical representation methods since it gives visual representation of a DNA structure. In numerical method, numerical values are assigned to a sequence and digital signal processing methods are used to analyze the sequence. Hybrid approaches are also reported in the literature to analyze DNA sequences. This paper reviews the latest developments in DNA Sequence representation methods. We also present a taxonomy of various methods. A comparison of these methods where ever possible is also done

DNA polymorphism in Cab locus of tomato induced by tissue culture

Plants were regenerated from callus induced from leaf disc explants of a tomato F, hybrid heterozygous for three marker loci (a), without anthocyanin (aw), and hairless (hl). Regenerants were studied for somaclonal variation at the phenotypic level by scoring for variation in the marker loci, and at the DNA level by probing geomic DNA blots with a chlorophyll a/b binding protein (Cab-3C) cDNA sequence. While no variation was observed at the phenotypic level in over 950 somaclones studied, DNA polymorphism for the Cab locus could be detected in two out of 17 somaclones tested. Tissue culture induced variation at the phenotypic level for specific loci is very low (less than 0.001 for a, awor hl) but DNA sequence changes are induced at much greater frequency (- 0.1 for a multicopy gene family such as Cab).

Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data

Computational Biology is the research are that contributes to the analysis of biological data through the development of algorithms which will address significant research problems.The data from molecular biology includes DNA,RNA ,Protein and Gene expression data.Gene Expression Data provides the expression level of genes under different conditions.Gene expression is the process of transcribing the DNA sequence of a gene into mRNA sequences which in turn are later translated into proteins.The number of copies of mRNA produced is called the expression level of a gene.Gene expression data is organized in the form of a matrix. Rows in the matrix represent genes and columns in the matrix represent experimental conditions.Experimental conditions can be different tissue types or time points.Entries in the gene expression matrix are real values.Through the analysis of gene expression data it is possible to determine the behavioral patterns of genes such as similarity of their behavior,nature of their interaction,their respective contribution to the same pathways and so on. Similar expression patterns are exhibited by the genes participating in the same biological process.These patterns have immense relevance and application in bioinformatics and clinical research.Theses patterns are used in the medical domain for aid in more accurate diagnosis,prognosis,treatment planning.drug discovery and protein network analysis.To identify various patterns from gene expression data,data mining techniques are essential.Clustering is an important data mining technique for the analysis of gene expression data.To overcome the problems associated with clustering,biclustering is introduced.Biclustering refers to simultaneous clustering of both rows and columns of a data matrix. Clustering is a global whereas biclustering is a local model.Discovering local expression patterns is essential for identfying many genetic pathways that are not apparent otherwise.It is therefore necessary to move beyond the clustering paradigm towards developing approaches which are capable of discovering local patterns in gene expression data.A biclusters is a submatrix of the gene expression data matrix.The rows and columns in the submatrix need not be contiguous as in the gene expression data matrix.Biclusters are not disjoint.Computation of biclusters is costly because one will have to consider all the combinations of columans and rows in order to find out all the biclusters.The search space for the biclustering problem is 2 m+n where m and n are the number of genes and conditions respectively.Usually m+n is more than 3000.The biclustering problem is NP-hard.Biclustering is a powerful analytical tool for the biologist.The research reported in this thesis addresses the problem of biclustering.Ten algorithms are developed for the identification of coherent biclusters from gene expression data.All these algorithms are making use of a measure called mean squared residue to search for biclusters.The objective here is to identify the biclusters of maximum size with the mean squared residue lower than a given threshold. All these algorithms begin the search from tightly coregulated submatrices called the seeds.These seeds are generated by K-Means clustering algorithm.The algorithms developed can be classified as constraint based,greedy and metaheuristic.Constarint based algorithms uses one or more of the various constaints namely the MSR threshold and the MSR difference threshold.The greedy approach makes a locally optimal choice at each stage with the objective of finding the global optimum.In metaheuristic approaches particle Swarm Optimization(PSO) and variants of Greedy Randomized Adaptive Search Procedure(GRASP) are used for the identification of biclusters.These algorithms are implemented on the Yeast and Lymphoma datasets.Biologically relevant and statistically significant biclusters are identified by all these algorithms which are validated by Gene Ontology database.All these algorithms are compared with some other biclustering algorithms.Algorithms developed in this work overcome some of the problems associated with the already existing algorithms.With the help of some of the algorithms which are developed in this work biclusters with very high row variance,which is higher than the row variance of any other algorithm using mean squared residue, are identified from both Yeast and Lymphoma data sets.Such biclusters which make significant change in the expression level are highly relevant biologically.

Characterization and applications of two protease enzymes obtained by culture dependent and independent approaches from mangrove sediments

Soil community genomics or metagenomics is employed in this study to analyze the evolutionary related - ness of mangrove microbial community. The metagenomic DNA was isolated from mangrove sediment and 16SrDNA was amplified using universal primers. The amplicons were ligated into pTZ57R/T cloning vector and transformed onto E. coli JM109 host cells. The recombinant plasmids were isolated from positive clones and the insert was confirmed by its reamplification. The amplicons were subjected to Amplified Ribosomal DNA Restriction Analysis (ARDRA) using three different tetra cutter restriction enzymes namely Sau3A1, Hha1 and HpaII. The 16SrDNA insert were sequenced and their identity was determined. The sequences were submitted to NCBI database and accession numbers obtained. The phylo - genetic tree was constructed based on Neighbor-Joining technique. Clones belonged to two major phyla of the bacterial domain, namely Firmicutes and Proteobacteria, with members of Firmicutes predominating. The microbial diversity of the mangrove sediment was explored in this manner.