Kazunori D. Yamada

Application of the MAFFT sequence alignment program to large data – reexamination of the usefulness of chained guide trees

Motivation: Large multiple sequence alignments (MSAs), consisting of thousands of sequences, are becoming more and more common, due to advances in sequencing technologies. The MAFFT MSA program has several options for building large MSAs, but their performances have not been sufficiently assessed yet, because realistic benchmarking of large MSAs has been difficult. Recently, such assessments have been made possible through the HomFam and ContTest benchmark protein datasets. Along with the development of these datasets, an interesting theory was proposed: chained guide trees increase the accuracy of MSAs of structurally conserved regions. This theory challenges the basis of progressive alignment methods and needs to be examined by being compared with other known methods including computationally intensive ones. Results: We used HomFam, ContTest and OXFam (an extended version of OXBench) to evaluate several methods enabled in MAFFT: (1) a progressive method with approximate guide trees, (2) a progressive method with chained guide trees, (3) a combination of an iterative refinement method and a progressive method and (4) a less approximate progressive method that uses a rigorous guide tree and consistency score. Other programs, Clustal Omega and UPP, available for large MSAs, were also included into the comparison. The effect of method 2 (chained guide trees) was positive in ContTest but negative in HomFam and OXFam. Methods 3 and 4 increased the benchmark scores more consistently than method 2 for the three datasets, suggesting that they are safer to use. Availability and Implementation: http://mafft.cbrc.jp/alignment/software/ Contact: katoh@ifrec.osaka-u.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online.

Natural killer cell activity during pregnancy

Natural killer cell activity was found to be depressed from the early period of pregnancy to the third trimester, as compared to that in the nonpregnant state. Natural killer cell activity in the puerperium tended to be depressed slightly more than during pregnancy. There were no differences in activity between toxemic and normal pregnant women in the same gestational week. A retrospective survey showed a negative correlation between natural killer cell activity during pregnancy and the birth weight of the baby. Although the role of natural killer cells during pregnancy needs to be more clearly elucidated, they may be involved in fetal growth.

Study of interferon production during pregnancy in mice and antiviral activity in the placenta

Although the mortality rate after herpes simplex virus type 2 inoculation was not significantly different between pregnant mice and nonpregnant mice, systemic interferon production was very high during late pregnancy compared with that in nonpregnant mice. Antiviral activity was detected in placentas from all noninfected pregnant mice (80 to 320 U/ml in 20% suspension). The antiviral activity had a broad spectrum and was also effective in the cells of other species; an antiviral effect was shown even if the cells were treated after challenge with a virus. In addition, this activity was not inactivated by antimouse interferon-neutralizing antisera. The molecular weight of this placental antiviral substance was estimated to be 200,000 to 450,000 daltons by gel filtration, and it was inactivated by heat, acid, and trypsin. Noninterferon antiviral activity (40 to 80 U/ml) was also detected in more than half the sera (61.5%) of noninfected mice in late pregnancy.

Derivative-free neural network for optimizing the scoring functions associated with dynamic programming of pairwise-profile alignment

BackgroundA profile-comparison method with position-specific scoring matrix (PSSM) is among the most accurate alignment methods. Currently, cosine similarity and correlation coefficients are used as scoring functions of dynamic programming to calculate similarity between PSSMs. However, it is unclear whether these functions are optimal for profile alignment methods. By definition, these functions cannot capture nonlinear relationships between profiles. Therefore, we attempted to discover a novel scoring function, which was more suitable for the profile-comparison method than existing functions, using neural networks.ResultsAlthough neural networks required derivative-of-cost functions, the problem being addressed in this study lacked them. Therefore, we implemented a novel derivative-free neural network by combining a conventional neural network with an evolutionary strategy optimization method used as a solver. Using this novel neural network system, we optimized the scoring function to align remote sequence pairs. Our results showed that the pairwise-profile aligner using the novel scoring function significantly improved both alignment sensitivity and precision relative to aligners using existing functions.ConclusionsWe developed and implemented a novel derivative-free neural network and aligner (Nepal) for optimizing sequence alignments. Nepal improved alignment quality by adapting to remote sequence alignments and increasing the expressiveness of similarity scores. Additionally, this novel scoring function can be realized using a simple matrix operation and easily incorporated into other aligners. Moreover our scoring function could potentially improve the performance of homology detection and/or multiple-sequence alignment of remote homologous sequences. The goal of the study was to provide a novel scoring function for profile alignment method and develop a novel learning system capable of addressing derivative-free problems. Our system is capable of optimizing the performance of other sophisticated methods and solving problems without derivative-of-cost functions, which do not always exist in practical problems. Our results demonstrated the usefulness of this optimization method for derivative-free problems.

Identification of hepta-histidine as a candidate drug for Huntington's disease by in silico-in vitro- in vivo-integrated screens of chemical libraries

We identified drug seeds for treating Huntington’s disease (HD) by combining in vitro single molecule fluorescence spectroscopy, in silico molecular docking simulations, and in vivo fly and mouse HD models to screen for inhibitors of abnormal interactions between mutant Htt and physiological Ku70, an essential DNA damage repair protein in neurons whose function is known to be impaired by mutant Htt. From 19,468 and 3,010,321 chemicals in actual and virtual libraries, fifty-six chemicals were selected from combined in vitro-in silico screens; six of these were further confirmed to have an in vivo effect on lifespan in a fly HD model, and two chemicals exerted an in vivo effect on the lifespan, body weight and motor function in a mouse HD model. Two oligopeptides, hepta-histidine (7H) and Angiotensin III, rescued the morphological abnormalities of primary neurons differentiated from iPS cells of human HD patients. For these selected drug seeds, we proposed a possible common structure. Unexpectedly, the selected chemicals enhanced rather than inhibited Htt aggregation, as indicated by dynamic light scattering analysis. Taken together, these integrated screens revealed a new pathway for the molecular targeted therapy of HD.

Structural characterization of single nucleotide variants at ligand binding sites and enzyme active sites of human proteins.

Functional sites on proteins play an important role in various molecular interactions and reactions between proteins and other molecules. Thus, mutations in functional sites can severely affect the overall phenotype. Progress of genome sequencing projects has yielded a wealth of information on single nucleotide variants (SNVs), especially those with less than 1% minor allele frequency (rare variants). To understand the functional influence of genetic variants at a protein level, we investigated the relationship between SNVs and protein functional sites in terms of minor allele frequency and the structural position of variants. As a result, we observed that SNVs were less abundant at ligand binding sites, which is consistent with a previous study on SNVs and protein interaction sites. Additionally, we found that non-rare variants tended to be located slightly apart from enzyme active sites. Examination of non-rare variants revealed that most of the mutations resulted in moderate changes of the physico-chemical properties of amino acids, suggesting the existence of functional constraints. In conclusion, this study shows that the mapping of genetic variants on protein structures could be a powerful approach to evaluate the functional impact of rare genetic variations.

Hyperparameter-free optimizer of gradient-descent method incorporating unit correction and moment estimation

In the deep learning era, stochastic gradient descent is the most common method used for optimizing neural network parameters. Among the various mathematical optimization methods, the gradient descent method is the most naive. Adjustment of learning rate is necessary for quick convergence, which is normally done manually with gradient descent. Many optimizers have been developed to control the learning rate and increase convergence speed. Generally, these optimizers adjust the learning rate automatically in response to learning status. These optimizers were gradually improved by incorporating the effective aspects of earlier methods. In this study, we developed a new optimizer: YamAdam. Our optimizer is based on Adam, which utilizes the first and second moments of previous gradients. In addition to the moment estimation system, we incorporated an advantageous part of AdaDelta, namely a unit correction system, into YamAdam. According to benchmark tests on some common datasets, our optimizer showed similar or faster convergent performance compared to the existing methods. YamAdam is an option as an alternative optimizer for deep learning.

Parallelization of MAFFT for large-scale multiple sequence alignments

Abstract Summary We report an update for the MAFFT multiple sequence alignment program to enable parallel calculation of large numbers of sequences. The G-INS-1 option of MAFFT was recently reported to have higher accuracy than other methods for large data, but this method has been impractical for most large-scale analyses, due to the requirement of large computational resources. We introduce a scalable variant, G-large-INS-1, which has equivalent accuracy to G-INS-1 and is applicable to 50 000 or more sequences. Availability and implementation This feature is available in MAFFT versions 7.355 or later at https://mafft.cbrc.jp/alignment/software/mpi.html. Supplementary information Supplementary data are available at Bioinformatics online.

De novo profile generation based on sequence context specificity with the long short-term memory network

BackgroundLong short-term memory (LSTM) is one of the most attractive deep learning methods to learn time series or contexts of input data. Increasing studies, including biological sequence analyses in bioinformatics, utilize this architecture. Amino acid sequence profiles are widely used for bioinformatics studies, such as sequence similarity searches, multiple alignments, and evolutionary analyses. Currently, many biological sequences are becoming available, and the rapidly increasing amount of sequence data emphasizes the importance of scalable generators of amino acid sequence profiles.ResultsWe employed the LSTM network and developed a novel profile generator to construct profiles without any assumptions, except for input sequence context. Our method could generate better profiles than existing de novo profile generators, including CSBuild and RPS-BLAST, on the basis of profile-sequence similarity search performance with linear calculation costs against input sequence size. In addition, we analyzed the effects of the memory power of LSTM and found that LSTM had high potential power to detect long-range interactions between amino acids, as in the case of beta-strand formation, which has been a difficult problem in protein bioinformatics using sequence information.ConclusionWe demonstrated the importance of sequence context and the feasibility of LSTM on biological sequence analyses. Our results demonstrated the effectiveness of memories in LSTM and showed that our de novo profile generator, SPBuild, achieved higher performance than that of existing methods for profile prediction of beta-strands, where long-range interactions of amino acids are important and are known to be difficult for the existing window-based prediction methods. Our findings will be useful for the development of other prediction methods related to biological sequences by machine learning methods.

Optimizing scoring function of dynamic programming of pairwise profile alignment using derivative free neural network.

A profile comparison method with position-specific scoring matrix (PSSM) is one of the most accurate alignment methods. Currently, cosine similarity and correlation coefficient are used as scoring functions of dynamic programming to calculate similarity between PSSMs. However, it is unclear that these functions are optimal for profile alignment methods. At least, by definition, these functions cannot capture non-linear relationships between profiles. Therefore, in this study, we attempted to discover a novel scoring function, which was more suitable for the profile comparison method than the existing ones. Firstly we implemented a new derivative free neural network by combining the conventional neural network with evolutionary strategy optimization method. Next, using the framework, the scoring function was optimized for aligning remote sequence pairs. Nepal, the pairwise profile aligner with the novel scoring function significantly improved both alignment sensitivity and precision, compared to aligners with the existing functions. Nepal improved alignment quality because of adaptation to remote sequence alignment and increasing the expressive power of similarity score. The novel scoring function can be realized using a simple matrix operation and easily incorporated into other aligners. With our scoring function, the performance of homology detection and/or multiple sequence alignment for remote homologous sequences would be further improved.