Search PubMed⌕ Search

Biomedical subjects

T Akutsu

Publications and source records attributed to T Akutsu.

At least 19 recordsLinked to original sources

The role of log-normal dynamics in the evolution of biochemical pathways.

The study of the scale-free topology in non-biological and biological networks and the dynamics that can explain this fascinating property of complex systems have captured the attention of the scientific community in the last years. Here, we analyze the biochemical pathways of three organisms (Methanococcus jannaschii, Escherichia coli, Saccharomyces cerevisiae) which are representatives of the main kingdoms Archaea, Bacteria and Eukaryotes during the course of the biological evolution. We can consider two complementary representations of the biochemical pathways: the enzymes network and the chemical compounds network. In this article, we propose a stochastic model that explains that the scale-free topology with exponent in the vicinity of gamma approximately 3/2 found across these three organisms is governed by the log-normal dynamics in the evolution of the enzymes network. Precisely, the fluctuations of the connectivity degree of enzymes in the biochemical pathways between evolutionary distant organisms follow the same conserved dynamical principle, which in the end is the origin of the stationary scale-free distribution observed among species, from Archaea to Eukaryotes. In particular, the log-normal dynamics guarantees the conservation of the scale-free distribution in evolving networks. Furthermore, the log-normal dynamics also gives a possible explanation for the restricted range of observed exponents gamma in the scale-free networks (i.e., gamma > or = 3/2). Finally, our model is also applied to the chemical compounds network of biochemical pathways and the Internet network.

Biological Evolution↗

Flexible construction of hierarchical scale-free networks with general exponent.

Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidence for hierarchical organization in many real networks has also been reported. Here, we present a hierarchical model that reproduces the main experimental properties observed in real networks: scale-free of degree distribution P (k) [frequency of the nodes that are connected to k other nodes decays as a power law P (k) approximately k(-gamma) ] and power-law scaling of the clustering coefficient C (k) approximately k(-1) . The major points of our model can be summarized as follows. (a) The model generates networks with scale-free distribution for the degree of nodes with general exponent gamma>2 , and arbitrarily close to any specified value, being able to reproduce most of the observed hierarchical scale-free topologies. In contrast, previous models cannot obtain values of gamma>2.58 . (b) Our model has structural flexibility because (i) it can incorporate various types of basic building blocks (e.g., triangles, tetrahedrons, and, in general, fully connected clusters of n nodes) and (ii) it allows a large variety of configurations (i.e., the model can use more than n-1 copies of basic blocks of n nodes). The structural features of our proposed model might lead to a better understanding of architectures of biological and nonbiological networks.

Journal Article↗

Investigation on the mechanical properties of contracted collagen gels as a scaffold for tissue engineering.

In this article the mechanical properties of contracted collagen gels were investigated thoroughly by means of uniaxial tensile test. Large type I collagen-Dulbecco's Modified Eagle Medium (DMEM) gels (each was 26 ml in volume, 1.67 mg/ml collagen concentration), each populated with about 2.5 x 106 human fibroblasts, were made in 100 mm diameter plastic dishes precoated with albumin for floating the gels in DMEM. Such identically treated gels were divided into three groups for the mechanical measurements at different culture periods (2, 4, and 10 weeks). Rapid contraction occurred within the first 3 days and then the contraction went slowly in the rest period until it reached about 13% of its original size. The stress-strain curve of the contracted collagen gels demonstrated an exponential behavior at low stress region, followed by linear region, a point of yielding, and finally an ultimate stress point at which the maximum stress was reached. The mechanical strength increased in the first few weeks and then decreased as the culture went on. It is obvious that the collagen fibrils formed and were forced to orientate to the tensile direction after the test. The stress relaxation and cyclic creep phenomena were observed. Based on the morphological analysis of transmission electron microscopy (TEM) of the gels, a nonlinear visco-elastic-plastic constitutive formula was proposed, which was able to reproduce the rheological phenomena of the gels. This experiment shows that the human fibroblasts significantly contracted collagen gels so as to achieve certain mechanical strength, which makes it possible to be a scaffold for tissue engineering. However, a further method to reinforce the mechanical strength by several folds must be considered. Meanwhile, the rheological phenomena should be taken into account in the fabrication and application of the structure.

Bioprosthesis↗

Quantitative trait loci (QTLs) associated with resistance/susceptibility to infectious pancreatic necrosis virus (IPNV) in rainbow trout (Oncorhynchus mykiss).

Infectious pancreatic necrosis (IPN) is a well-known acute viral disease of salmonid species. We have identified quantitative trait loci (QTLs) associated with resistance to this disease in rainbow trout. We searched for linkage among 51 microsatellite markers used to construct a framework linkage map in backcross families of rainbow trout (Oncorhynchus mykiss), produced by crossing IPN-resistant (YN-RT201) and -susceptible (YK-RT101) strains. Two putative QTLs affecting disease resistance were detected on chromosomes A (IPN R S-1) and C (IPN R/S-2), respectively, suggesting that this is a polygenic trait in rainbow trout. These markers have great potential for use in marker-assisted selection (MAS) for IPN resistance and provide the basis for cloning of IPN resistance genes. Clarification of the genetic bases of complex traits has broad implications for fundamental research, but will also be of practical benefit to fish breeding.

Animals↗

Genetic mapping of the dominant albino locus in rainbow trout (Oncorhynchus mykiss).

Albinism in animals is generally a recessive trait, but in Japan a dominant oculocutaneous albino (OCA) mutant strain has been isolated in rainbow trout (Oncorhyncus mykiss). After confirming that this trait is not due to a tyrosinase gene mutation that causes OCA1 (tyrosinase-negative OCA), we combined the amplified fragment length polymorphism (AFLP) technique with bulked segregant analysis (BSA) to map the gene involved in dominant oculocutaneous albinism. Four AFLP markers tightly linked to the dominant albino locus were identified. One of these markers was codominant and we have it converted into a GGAGT-repeat microsatellite marker, OmyD-AlbnTUF. Using this pentanucleotide-repeat DNA marker, the dominant albino locus has been mapped on linkage group G of a reference linkage map of rainbow trout. The markers identified here will facilitate cloning of the dominant albino gene in rainbow trout and contribute to a better understanding of tyrosinase-negative OCA in animals.

Albinism, Oculocutaneous↗

Interaction of metallopyrazoliumylporphyrins with calf thymus DNA.

The interaction of transition metal complexes of cationic porphyrins bearing five membered rings, meso-tetrakis(1,2-dimethylpyrazolium-4-yl)porphyrin (MPzP, M=Mn(III), Ni(II), Cu(II) or Zn(II)), with calf thymus DNA (ctDNA) has been studied. Metalloporphyrins NiPzP and CuPzP are intercalated into the 5'GC3' step of ctDNA. MnPzP is bound edge-on at the 5'TA3' step of the minor groove of ctDNA, while ZnPzP is bound face-on at the 5'TA3' step of the major groove of ctDNA. The binding constants of the metalloporphyrins to ctDNA range from 1.05x10(5) to 2.66x10(6) M(-1) and are comparable to those of other reported cationic porphyrins. The binding process of the metallopyrazoliumylporphyrins to ctDNA is endothermic and entropically driven. These results have revealed that the kind of central metal ions of metalloporphyrins influences the binding characteristics of the porphyrin to DNA.

Animals↗

Local multiple alignment of numerical sequences: detection of subtle motifs from protein sequences and structures.

This paper presents a new method to find motifs from multiple protein sequences and multiple protein structures. The method consists of two parts: quantification and local multiple alignment. In the former part, protein sequences and protein structures are transformed into sequences of real numbers and real vectors respectively. In the latter part, fixed length regions having similar shapes are located. A Gibbs sampling algorithm for sequences of real numbers/vectors is newly developed for finding common regions. The results of the comparison with a standard Gibbs sampling program show that the method is particularly useful when structural information is available.

Algorithms↗

Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function.

Due to the recent progress of the DNA microarray technology, a large number of gene expression profile data are being produced. How to analyze gene expression data is an important topic in computational molecular biology. Several studies have been done using the Boolean network as a model of a genetic network. This paper proposes efficient algorithms for identifying Boolean networks of bounded indegree and related biological networks, where identification of a Boolean network can be formalized as a problem of identifying many Boolean functions simultaneously. For the identification of a Boolean network, an O(mnD+1) time naive algorithm and a simple O (mnD) time algorithm are known, where n denotes the number of nodes, m denotes the number of examples, and D denotes the maximum in degree. This paper presents an improved O(momega-2nD + mnD+omega-3) time Monte-Carlo type randomized algorithm, where omega is the exponent of matrix multiplication (currently, omega < 2.376). The algorithm is obtained by combining fast matrix multiplication with the randomized fingerprint function for string matching. Although the algorithm and its analysis are simple, the result is nontrivial and the technique can be applied to several related problems.

Algorithms↗

Inferring qualitative relations in genetic networks and metabolic pathways.

MOTIVATION: Inferring genetic network architecture from time series data of gene expression patterns is an important topic in bioinformatics. Although inference algorithms based on the Boolean network were proposed, the Boolean network was not sufficient as a model of a genetic network. RESULTS: First, a Boolean network model with noise is proposed, together with an inference algorithm for it. Next, a qualitative network model is proposed, in which regulation rules are represented as qualitative rules and embedded in the network structure. Algorithms are also presented for inferring qualitative relations from time series data. Then, an algorithm for inferring S-systems (synergistic and saturable systems) from time series data is presented, where S-systems are based on a particular kind of nonlinear differential equation and have been applied to the analysis of various biological systems. Theoretical results are shown for Boolean networks with noises and simple qualitative networks. Computational results are shown for Boolean networks with noises and S-systems, where real data are not used because the proposed models are still conceptual and the quantity and quality of currently available data are not enough for the application of the proposed methods.

Algorithms↗

Algorithms for inferring qualitative models of biological networks.

Modeling genetic networks and metabolic networks is an important topic in bioinformatics. We propose a qualitative network model which is a combination of the Boolean network and qualitative reasoning, where qualitative reasoning is a kind of reasoning method well-studied in Artificial Intelligence. We also present algorithms for inferring qualitative networks from time series data and an algorithm for inferring S-systems (synergistic and saturable systems) from time series data, where S-systems are based on a particular kind of nonlinear differential equation and have been applied to the analysis of various biological systems.

Algorithms↗

Cationic porphyrins bearing diazolium rings: synthesis and their interaction with calf thymus DNA.

Two novel cationic porphyrins bearing five-membered rings at the meso-positions, meso-tetrakis(1,3-dimethylimidazolium-2-yl)porphyrin (H2TDMImP) and meso-tetrakis(1,2-dimethylpyrazolium-4-yl)porphyrin (H2TDMPzP), have been synthesized. These two compounds interact with calf thymus DNA (CTDNA) in different binding modes from that of mesotetrakis(N-methylpyridinium-4-yl)porphyrin (H2TMPyP). H2TDMImP outside binds to the minor groove of CTDNA while H2TDMPzP intercalates into CTDNA. These two novel cationic porphyrins strongly bind to CTDNA even at high ionic strength and the binding constant of H2TDMPzP to CTDNA is comparable to that of H2TMPyP. The binding of H2TDMImP to CTDNA is enthalpically driven. The favorable free energy changes in binding of H2TDMPzP to CTDNA come from the large negative enthalpy changes accompanied by small positive entropy changes.

Animals↗

Identification of genetic networks from a small number of gene expression patterns under the Boolean network model.

Liang, Fuhrman and Somogyi (PSB98, 18-29, 1998) have described an algorithm for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient in order to infer the original Boolean network correctly. This paper gives a mathematical proof for their observation. Precisely, this paper devises a much simpler algorithm for the same problem and proves that, if the indegree of each node (i.e., the number of input nodes to each node) is bounded by a constant, only O(log n) state transition pairs (from 2n pairs) are necessary and sufficient to identify the original Boolean network of n nodes correctly with high probability. We made computational experiments in order to expose the constant factor involved in O(log n) notation. The computational results show that the Boolean network of size 100,000 can be identified by our algorithm from about 100 INPUT/OUTPUT pairs if the maximum indegree is bounded by 2. It is also a merit of our algorithm that the algorithm is conceptually so simple that it is extensible for more realistic network models.

Algorithms↗

Protein Threading Based on Multiple Protein Structure Alignment.

Protein threading, a method employed in protein three-dimensional (3D) structure prediction was only proposed in the early 1990's although predicting protein 3D structure from its given amino acid sequence has been around since 1970's. Here we describe a protein threading method/system that we have developed based on multiple protein structure alignment. In order to compute multiple structure alignments, we developed a similar structure search program on massive parallel computers and a program for constructing a multiple structure alignment from pairwise structure alignments, where the latter is based on the center star method for sequence alignment. A simple dynamic-programming based algorithm which uses a profile matrix obtained from the result of multiple structure alignment was also developed to compute a threading (i.e., an alignment between a target sequence and a known structure). Using this system, we participated in the threading category (category AL) of CASP3 (Third Community Wide Experiment on the Critical Assessment of Techniques for Protein Structure Prediction). The results are discussed.

Journal Article↗

A System for Identifying Genetic Networks from Gene Expression Patterns Produced by Gene Disruptions and Overexpressions.

A hot research topic in genomics is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. Based on a boolean network model without time delay, we have been investigating efficient strategies for identifying a genetic network by multiple gene disruptions and overexpressions. This paper first shows the relationship between our boolean network model without time delay and the standard synchronous boolean network model. Then we present a simulator of boolean networks without time delay for multiple gene disruptions and gene overexpressions, which includes a genetic network identifier with a graphic interface that generates instructions for experiments of gene disruptions and overexpressions.

Journal Article↗

Linear programming based approach to the derivation of a contact potential for protein threading.

This paper proposes a novel method of deriving a contact potential (a pair score function) for protein threading. In this method, the constraint that the score of the native threading is minimum over all possible threadings is expressed in a form of linear inequalities, and then parameters defining the contact potential are determined by applying a program package of linear programming. The most important advantage of this method over the previous methods is that this method can learn a score function from a small number of training data. The proposed method was evaluated using Lathrop and Smith's algorithm for finding optimal threadings and was shown to be effective for computing nearly correct threadings.

Amino Acid Sequence↗