Predicting intrinsically disordered proteins is important in structural biology because they are thought to carry out various cellular functions even though they have no stable three-dimensional structure. We know the structures of far more ordered proteins than disordered proteins. The structural distribution of proteins in nature can therefore be inferred to differ from that of proteins whose structures have been determined experimentally. We know many more protein sequences than we do protein structures, and many of the known sequences can be expected to be those of disordered proteins. Thus it would be efficient to use the information of structure-unknown proteins in order to avoid training data sparseness. We propose a novel method for predicting which proteins are mostly disordered by using spectral graph transducer and training with a huge amount of structure-unknown sequences as well as structure-known sequences. When the proposed method was evaluated on data that included 82 disordered proteins and 526 ordered proteins, its sensitivity was 0.723 and its specificity was 0.977. It resulted in a Matthews correlation coefficient 0.202 points higher than that obtained using FoldIndex, 0.221 points higher than that obtained using the method based on plotting hydrophobicity against the number of contacts and 0.07 points higher than that obtained using support vector machines (SVMs). To examine robustness against training data sparseness, we investigated the correlation between two results obtained when the method was trained on different datasets and tested on the same dataset. The correlation coefficient for the proposed method is 0.14 higher than that for the method using SVMs. When the proposed SGT-based method was compared with four per-residue predictors (VL3, GlobPlot, DISOPRED2 and IUPred (long)), its sensitivity was 0.834 for disordered proteins, which is 0.052–0.523 higher than that of the per-residue predictors, and its specificity was 0.991 for ordered proteins, which is 0.036–0.153 higher than that of the per-residue predictors. The proposed method was also evaluated on data that included 417 partially disordered proteins. It predicted the frequency of disordered proteins to be 1.95% for the proteins with 5%–10% disordered sequences, 1.46% for the proteins with 10%–20% disordered sequences and 16.57% for proteins with 20%–40% disordered sequences. The proposed method, which utilizes the information of structure-unknown data, predicts disordered proteins more accurately than other methods and is less affected by training data sparseness.
Motivation: Personal genomes carry inherent privacy risks and protecting privacy poses major social and technological challenges. We consider the case where a user searches for genetic information (e.g. an allele) on a server that stores a large genomic database and aims to receive allele-associated information. The user would like to keep the query and result private and the server the database. Approach: We propose a novel approach that combines efficient string data structures such as the Burrows–Wheeler transform with cryptographic techniques based on additive homomorphic encryption. We assume that the sequence data is searchable in efficient iterative query operations over a large indexed dictionary, for instance, from large genome collections and employing the (positional) Burrows–Wheeler transform. We use a technique called oblivious transfer that is based on additive homomorphic encryption to conceal the sequence query and the genomic region of interest in positional queries. Results: We designed and implemented an efficient algorithm for searching sequences of SNPs in large genome databases. During search, the user can only identify the longest match while the server does not learn which sequence of SNPs the user queried. In an experiment based on 2184 aligned haploid genomes from the 1000 Genomes Project, our algorithm was able to perform typical queries within 4.6 s and 10.8 s for client and server side, respectively, on laptop computers. The presented algorithm is at least one order of magnitude faster than an exhaustive baseline algorithm. Availability and implementation:https://github.com/iskana/PBWT-sec and https://github.com/ratschlab/PBWT-sec. Contacts:shimizu-kana@aist.go.jp or Gunnar.Ratsch@ratschlab.org Supplementary information: Supplementary data are available at Bioinformatics online.
Root growth into hypoxic or anoxic waterlogged soil relies on internal aeration in plants. The plant hormone ethylene helps adapt to waterlogging by inducing the formation of aerenchyma, which provides a low-resistance pathway for the transport of oxygen from the shoot to the root apex. Waterlogging-susceptible crops including barley start to form aerenchyma after suffering waterlogging stress. But waterlogging can be fatal if aerenchyma formation is not fast enough. Here, we investigated whether pre-treating barley with ethephon, an ethylene-releasing agrochemical, could improve its tolerance to mimicked waterlogging conditions (using stagnant deoxygenated agar nutrient solution). In barley growing in aerated nutrient solution, ethephon treatment enhanced aerenchyma formation at the root tips and induced the development of shorter and shallower roots. Pre-treating barley leaves also delayed waterlogging-caused whiting and increased the percentages of viable root-tips under waterlogging conditions. However, the pretreatment did not noticeably increase fresh weight or shoot length. Further studies are needed to optimize ethephon treatment conditions to improve barley production under waterlogged conditions.
29 June 2021 in Journal of International Medical Research
Previous studies have reported that the neutrophil to lymphocyte ratio (NLR) is associated with onset and prognosis of cardiovascular disease (CVD). Smoking is a major risk factor for CVD and smoking cessation significantly reduces CVD risk. However, the effects of smoking cessation on the NLR remain unknown. Among smokers visiting our smoking cessation clinics, we examined changes in the NLR and CVD biomarkers before and after smoking cessation. A total of 389 individuals (301 men and 88 women) were enrolled in the study. The median NLR was significantly reduced after successful smoking cessation (before: 1.8, interquartile range [IQR] 1.5, 2.5; after: 1.7, IQR 1.3, 2.4). In a linear regression model adjusted for sex, percent change in NLR comparing before and after smoking cessation was significantly and positively correlated with percent changes in C-reactive protein (β = 0.260), α1-antitrypsin-low density lipoprotein (β = 0.151, p < 0.05), and serum amyloid A-low density lipoprotein (β = 0.325). Our study demonstrated for the first time that smoking cessation significantly reduces the NLR in tandem with markers of inflammation and oxidative stress.
Motivation: Recent progress in DNA sequencing technologies calls for fast and accurate algorithms that can evaluate sequence similarity for a huge amount of short reads. Searching similar pairs from a string pool is a fundamental process of de novo genome assembly, genome-wide alignment and other important analyses. Results: In this study, we designed and implemented an exact algorithm SlideSort that finds all similar pairs from a string pool in terms of edit distance. Using an efficient pattern growth algorithm, SlideSort discovers chains of common k-mers to narrow down the search. Compared to existing methods based on single k-mers, our method is more effective in reducing the number of edit distance calculations. In comparison to backtracking methods such as BWA, our method is much faster in finding remote matches, scaling easily to tens of millions of sequences. Our software has an additional function of single link clustering, which is useful in summarizing short reads for further processing. Availability: Executable binary files and C++ libraries are available at http://www.cbrc.jp/~shimizu/slidesort/ for Linux and Windows. Contact:slidesort@m.aist.go.jp; shimizu-kana@aist.go.jp Supplementary information: Supplementary data are available at Bioinformatics online.