New invariant of DNA sequences based on a new matrix representation

In this paper we propose a matrix depiction and two new invariants of DNA sequences. This approach is illustrated on the primate mitochondrial DNA sequences for 11 different species and 80 different H5N1 avian influenza virus DNA sequences. We also construct the dendrogram tree for them. These phylogenies obtained are generally consistent with evolutionary trees constructed in previous studies.     

Molecular conformation search by distance matrix perturbations

Three-dimensional molecular structure is fundamental in chemical function identification and computer-aided drug design. The enumeration of a small number of feasible conformations provides a rigorous way to determine the optimal or a few acceptable conformations. Our contribution concerns a heuristic enhancement of a method based on distance geometry, typically in relation with experiments of the NMR type. Distance geometry has been approached by different viewpoints; ours is expected to help in several subtasks arising in the process that determines 3D structure from distance information. More precisely, the input to our algorithm consists of a set of approximate distances of varying precision; some are specified by the covalent structure and others by Nuclear Magnetic Resonance (NMR) experiments (or X-ray crystallography which, however, requires crystallization). The output is a valid tertiary structure in a specified neighborhood of the input. Our approach should help in detecting outliers of the NMR experiments, and handles inputs with partial information. Moreover, our technique is able to bound the number of degrees of freedom of the conformation manifold. We have used numerical linear algebra algorithms for reasons of speed, and because they are well-implemented, fully documented and widely available. Our main tools include, besides distance matrices, structure-preserving matrix perturbations for minimizing singular values. Our MATLAB (or SCILAB) implementation is described and illustrated.AMS subject Classification: 92E10 Molecular structure, 92C40 Biochemistry, molecular biology, 65F15 Eigenvalues, eigenvectors, 15A18 Eigenvalues, singular values, and eigenvectors     

On a four-dimensional representation of DNA primary sequences

We consider a four-dimensional representation of DNA primary sequences by assigning to each of the four basic amino acids A, T, G, C directions along the four orthogonal coordinate axes. Advantages and limitations of the novel representation of DNA primary sequences are discussed, and the use of the 4-D representation is illustrated by constructing novel sequence invariants. Comparisons with the similarity/dissimilarity results based on 2-D and 3-D representations for a set of eight short DNA sequences corresponding to the first exon of beta globin in eight species, including human, are considered to illustrate the use of our novel sequence invariants based on the entries in derived sequence matrices restricted to a selected width of a band along the main diagonal.     

On a 3-D representation of DNA primary sequences

We introduce a graphical representation of DNA primary sequences by taking four special vectors in a 3-D space to represent the four nucleic acid bases in DNA sequences, so that a DNA primary sequence is denoted in a 3-D space by a successive vector sequence which is a directed walk on the space. It is demonstrated that this representation has no overlap and intersection and allows numerical characterization.     

On novel representation of proteins based on amino acid adjacency matrix

A novel characterization of proteins is presented based on selected properties of recently introduced 20 × 20 amino acid adjacency matrix of proteins in which matrix elements count the occurrence of all 400 possible pair-wise adjacencies obtained by reading protein primary sequence from the left to the right. In particular we consider the characterization based on the sum and the difference of the rows and the corresponding columns, which characterize proteins by a pair of 20-component vectors. The approach is illustrated on a set of ND6 proteins of eight species.     

On novel representation of proteins based on amino acid adjacency matrix

A novel characterization of proteins is presented based on selected properties of recently introduced 20 x 20 amino acid adjacency matrix of proteins in which matrix elements count the occurrence of all 400 possible pair-wise adjacencies obtained by reading protein primary sequence from the left to the right. In particular we consider the characterization based on the sum and the difference of the rows and the corresponding columns, which characterize proteins by a pair of 20-component vectors. The approach is illustrated on a set of ND6 proteins of eight species.     

Preconditioners for distance matrix algorithms

A recent gradient algorithm in nonlinear optimization uses a novel idea that avoids line searches. This so-called spectral gradient algorithm works well when the spectrum of the Hessian of the function to be minimized has a small range or is clustered. In this article, we find a general preconditioning method for this algorithm. The preconditioning method is applied to the stress function, which arises in many applications of distance geometry, from statistics to finding molecular conformations. The Hessian of stress is shown to have a nice block structure. This structure yields a preconditioner which decreases the amount of computation needed to minimize stress by the spectral gradient algorithm. © 1994 by John Wiley & Sons, Inc.     

Metric representation of DNA sequences

A metric representation of DNA sequences is borrowed from symbolic dynamics. In view of this method, the pattern seen in the chaos game representation of DNA sequences is explained as the suppression of certain nucleotide strings in the DNA sequences. Frequencies of short nucleotide strings and suppression of the shortest ones in the DNA sequences can be determined by using the metric representation.     

Maximum eigenvalue of the reciprocal distance matrix

In this paper, we obtain the lower and upper bounds of the maximum eigenvalue of the reciprocal distance matrix of a connected (molecular) graph. We also give the Nordhaus-Gaddum-type result for the maximum eigenvalue.     

Condensed representation of DNA primary sequences

With rapid reporting of DNA sequences derived from automated DNA sequencing techniques, the problem of reviewing and ordering such information has become acute. We have introduced a condensed representation of primary sequences of DNA that offers an alternative method of registering DNA. The advantage of the condensed codes for DNA is that it not only offers fast, qualitative comparisons of DNA but also allows quantitative comparisons of DNA from different sources. The approach is outlined for a particular human beta globin sequence extract. Using the condensed representation of the primary DNA sequences, comparisons are made between primary sequences for Exon 1 of human beta globin and seven other beta globins.     

On 3-D graphical representation of DNA primary sequences and their numerical characterization

In this article we (1) outline the construction of a 3-D "graphical" representation of DNA primary sequences, illustrated on a portion of the human beta globin gene; (2) describe a particular scheme that transforms the above 3-D spatial representation of DNA into a numerical matrix representation; (3) illustrate construction of matrix invariants for DNA sequences; and (4) suggest a data reduction based on statistical analysis of matrix invariants generated for DNA. Each of the four contributions represents a novel development that we hope will facilitate comparative studies of DNA and open new directions for representation and characterization of DNA primary sequences.     

Maximum eigenvalues of the reciprocal distance matrix and the reverse Wiener matrix

We report some properties of the maximum eigenvalues of the reciprocal distance matrix and the reverse Wiener matrix of a connected graph, in particular, various lower and upper bounds, and the Nordhaus–Gaddum‐type results for them. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2008     

An algorithm for construction of the molecular distance matrix

A simple computer-oriented method is presented for constructing the (molecular) distance matrix. The distance matrix considered is the graph-theoretical (topological) distance matrix.     

Kratzer potential algebraic representation and matrix elements recurrence formulae

Generalized recurrence relations for the calculation of multipole matrix elements for Kratzer potential wave functions are obtained operationally. These formulas have been determined by using a non-analytical procedure based on the algebraic representation of the Kratzer eigenfunctions along with the usual ladder properties and commutation relations. For that, the creation and annihilation operators are adequately derived by means of an alternative approach to the factorization method and the exact expressions for matrix elements are achieved with the aid of a relationship between the ladder operators associated with the bra and theket. The proposed algebraic approach as well as the formulas for the calculation of matrix elements thus derived are quite simple and direct when compared with other alternative expressions already obtained analytically or pseudo-algebraically by means of the hypervirial theorem commutator algebra.     

On reverse degree distance

We report some properties of the reverse degree distance of a connected (molecular) graph, and, in particular, its relationship with the first Zagreb index and Wiener index. We also show that the reverse degree distance satisfies the basic requirement for a branching index.     

New 2D graphical representation of DNA sequences

We consider a 2D graphical representations of DNA sequences, which avoids loss of information associated with crossing and overlapping of the corresponding curve. We outline an approach, which is based on the construction of a three-component vector whose components are the normalized leading eigenvalues of the L/L matrices associated with DNA. The examination of similarities/dissimilarities among the coding sequences of the first exon of beta-globin gene of different species illustrates the utility of the approach.     

The Wiener distance matrix for acyclic compounds and polymers

The relationship between the Wiener indices and the topological structures of alkanes is analyzed. The expressions for the Wiener distances between elements of these structures are derived, and the distance matrix is constructed for them; this matrix is naturally called the Wiener distance matrix. The expressions for the Wiener indices of polymers with units of arbitrary structure are obtained.