arXiv subjects

Y. Oono

Publications and source records attributed to Y. Oono.

8 recordsLinked to original sources

arXiv2004

Relational patterns of gene expression via nonmetric multidimensional scaling analysis

Motivation:Microarray experiments result in large scale data sets that require extensive mining and refining to extract useful information. We demonstrate the usefulness of (nonmetric) multidimensional scaling (MDS) method in analyzing a large number of genes. Applying MDS to the microarray data is certainly not new, but the existing works are all on small numbers (< 100) of points to be analyzed. We have been developing an efficient novel algorithm for nonmetric multidimensional scaling (nMDS) analysis for very large data sets as a maximally unsupervised data mining device. We wish to demonstrate its usefulness in the context of bioinformatics (unraveling relational patterns among genes from time series data in this paper). Results: The Pearson correlation coefficient with its sign flipped is used to measure the dissimilarity of the gene activities in transcriptional response of cell-cycle-synchronized human fibroblasts to serum [Iyer {\it et al}., Science {\bf 283}, 83 (1999)]. These dissimilarity data have been analyzed with our nMDS algorithm to produce an almost circular relational pattern of the genes. The obtained pattern expresses a temporal order in the data in this example; the temporal expression pattern of the genes rotates along this circular arrangement and is related to the cell cycle. For the data we analyze in this paper we observe the following. If an appropriate preparation procedure is applied to the original data set, linear methods such as the principal component analysis (PCA) could achieve reasonable results, but without data preprocessing linear methods such as PCA cannot achieve a useful picture. Furthermore, even with an appropriate data preprocessing, the outcomes of linear procedures are not as clearcut as those by nMDS without preprocessing.

q-bio.GN↗

arXiv2003

Temporal patterns of gene expression via nonmetric multidimensional scaling analysis

Motivation: Microarray experiments result in large scale data sets that require extensive mining and refining to extract useful information. We have been developing an efficient novel algorithm for nonmetric multidimensional scaling (nMDS) analysis for very large data sets as a maximally unsupervised data mining device. We wish to demonstrate its usefulness in the context of bioinformatics. In our motivation is also an aim to demonstrate that intrinsically nonlinear methods are generally advantageous in data mining. Results: The Pearson correlation distance measure is used to indicate the dissimilarity of the gene activities in transcriptional response of cell cycle-synchronized human fibroblasts to serum [Iyer et al., Science vol. 283, p83 (1999)]. These dissimilarity data have been analyzed with our nMDS algorithm to produce an almost circular arrangement of the genes. The temporal expression patterns of the genes rotate along this circular arrangement. If an appropriate preparation procedure may be applied to the original data set, linear methods such as the principal component analysis (PCA) could achieve reasonable results, but without data preprocessing linear methods such as PCA cannot achieve a useful picture. Furthermore, even with an appropriate data preprocessing, the outcomes of linear procedures are not as clearcut as those by nMDS without preprocessing.

nlin.PS↗

arXiv1995

The Renormalization Group and Singular Perturbations: Multiple-Scales, Boundary Layers and Reductive Perturbation Theory

Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary layers with technically difficult asymptotic matching, and WKB analysis. In contrast to conventional methods, the renormalization group approach requires neither {\it ad hoc\/} assumptions about the structure of perturbation series nor the use of asymptotic matching. Our renormalization group approach provides approximate solutions which are practically superior to those obtained conventionally, although the latter can be reproduced, if desired, by appropriate expansion of the renormalization group approximant. We show that the renormalization group equation may be interpreted as an amplitude equation, and from this point of view develop reductive perturbation theory for partial differential equations describing spatially-extended systems near bifurcation points, deriving both amplitude equations and the center manifold.

hep-th↗

arXiv1994

Renormalization Group Theory for Global Asymptotic Analysis

We show with several examples that renormalization group (RG) theory can be used to understand singular and reductive perturbation methods in a unified fashion. Amplitude equations describing slow motion dynamics in nonequilibrium phenomena are RG equations. The renormalized perturbation approach may be simpler to use than other approaches, because it does not require the use of asymptotic matching, and yields practically superior approximations.

cond-mat↗

arXiv1994

Renormalization Group Theory And Variational Calculations For Propagating Fronts

We study the propagation of uniformly translating fronts into a linearly unstable state, both analytically and numerically. We introduce a perturbative renormalization group (RG) approach to compute the change in the propagation speed when the fronts are perturbed by structural modification of their governing equations. This approach is successful when the fronts are structurally stable, and allows us to select uniquely the (numerical) experimentally observable propagation speed. For convenience and completeness, the structural stability argument is also briefly described. We point out that the solvability condition widely used in studying dynamics of nonequilibrium systems is equivalent to the assumption of physical renormalizability. We also implement a variational principle, due to Hadeler and Rothe, which provides a very good upper bound and, in some cases, even exact results on the propagation speeds, and which identifies the transition from ` linear'- to ` nonlinear-marginal-stability' as parameters in the governing equation are varied.

cond-mat↗

arXiv1993

Selection, Stability and Renormalization

We illustrate how to extend the concept of structural stability through applying it to the front propagation speed selection problem. This consideration leads us to a renormalization group study of the problem. The study illustrates two very general conclusions: (1) singular perturbations in applied mathematics are best understood as renormalized perturbation methods, and (2) amplitude equations are renormalization group equations.

cond-mat↗

arXiv1993

Structural Stability and Renormalization Group for Propagating Fronts

A solution to a given equation is structurally stable if it suffers only an infinitesimal change when the equation (not the solution) is perturbed infinitesimally. We have found that structural stability can be used as a velocity selection principle for propagating fronts. We give examples, using numerical and renormalization group methods.

cond-mat↗

arXiv1993

Possibilities and Limitations of Gaussian Closure Approximations for Phase Ordering Dynamics

The nonlinear equations describing phase ordering dynamics can be closed by assuming the existence of an underlying Gaussian stochastic field which is nonlinearly related to the observable order parameter field. We discuss the relation between different implementations of the Gaussian assumption and consider the limitations of this assumption for phase ordering dynamics. The fact that the different approaches gives different results is a sign of the breakdown of the Gaussian assumption. We concentrate on the non-conserved order parameter case but also touch on the conserved order parameter case. We demonstrate that the Gaussian assumption is fundamentally flawed in the latter case.

cond-mat↗