Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Atsushi Kurotani

dblp:50/3959 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › proteomics
post-translational modification prediction
0.212014
Correlations between predicted protein disorder and post-translational modifications in plants · Bioinform. 2014
Bioinformatics and computational biology › protein structure prediction
protein disorder prediction
0.212014
Correlations between predicted protein disorder and post-translational modifications in plants · Bioinform. 2014
Bioinformatics and computational biology
protein structure prediction
0.212014
Correlations between predicted protein disorder and post-translational modifications in plants · Bioinform. 2014
Bioinformatics and computational biology
protein sequence analysis
0.012004
ProteoMix: an integrated and flexible system for interactively analyzing large numbers of protein sequences · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis
sequence annotation
0.012004
ProteoMix: an integrated and flexible system for interactively analyzing large numbers of protein sequences · Bioinform. 2004

Methods — techniques the papers use, named apart from their topics

disorder prediction · 0.2PTM site prediction · 0.2logical function merging · 0.0SOAP-based tool integration · 0.0
YearPublicationVenuePosition
2014 Correlations between predicted protein disorder and post-translational modifications in plants
abstract
MOTIVATION: Protein structural research in plants lags behind that in animal and bacterial species. This lag concerns both the structural analysis of individual proteins and the proteome-wide characterization of structure-related properties. Until now, no systematic study concerning the relationships between protein disorder and multiple post-translational modifications (PTMs) in plants has been presented. RESULTS: In this work, we calculated the global degree of intrinsic disorder in the complete proteomes of eight typical monocotyledonous and dicotyledonous plant species. We further predicted multiple sites for phosphorylation, glycosylation, acetylation and methylation and examined the correlations of protein disorder with the presence of the predicted PTM sites. It was found that phosphorylation, acetylation and O-glycosylation displayed a clear preference for occurrence in disordered regions of plant proteins. In contrast, methylation tended to avoid disordered sequence, whereas N-glycosylation did not show a universal structural preference in monocotyledonous and dicotyledonous plants. In addition, the analysis performed revealed significant differences between the integral characteristics of monocot and dicot proteomes. They included elevated disorder degree, increased rate of O-glycosylation and R-methylation, decreased rate of N-glycosylation, K-acetylation and K-methylation in monocotyledonous plant species, as compared with dicotyledonous species. Altogether, our study provides the most compelling evidence so far for the connection between protein disorder and multiple PTMs in plants. CONTACT: [email protected] or [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
Atsushi Kurotani, Alexander A. Tokmakov, Yutaka Kuroda, Yasuo Fukami, Kazuo Shinozaki, Tetsuya Sakurai
Bioinform.1
2010 Mathematical model for empirically optimizing large scale production of soluble protein domains
abstract
BACKGROUND: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically modeling a protein dissection protocol in terms of a production system. Here, we report a mathematical model for empirically optimizing the cost of large-scale domain production in proteomics research. RESULTS: The model computes the expected number of successfully producing soluble domains, using a conditional probability between domain and boundary identification. Typical values for the model's parameters were estimated using the experimental results for identifying soluble domains from the 2,032 Kazusa HUGE protein sequences. Among the 215 fragments corresponding to the 24 domains that were expressed correctly, 111, corresponding to 18 domains, were soluble. Our model indicates that, under the conditions used in our pilot experiment, the probability of correctly predicting the existence of a domain was 81% (175/215) and that of predicting its boundary was 63% (111/175). Under these conditions, the most cost/effort-effective production of soluble domains was to prepare one to seven fragments per predicted domain. CONCLUSIONS: Our mathematical modeling of protein dissection protocols indicates that the optimum number of fragments tested per domain is actually much smaller than expected a priori. The application range of our model is not limited to protein dissection, and it can be utilized for designing various large-scale mutational analyses or screening libraries.
Eisuke Chikayama, Atsushi Kurotani, Takanori Tanaka, Takashi Yabuki, Satoshi Miyazaki, Shigeyuki Yokoyama, Yutaka Kuroda
BMC Bioinform.2
2004 ProteoMix: an integrated and flexible system for interactively analyzing large numbers of protein sequences
abstract
UNLABELLED: ProteoMix is a suite of JAVA programs for identifying, annotating and predicting regions of interest in large sets of amino acid sequences, according to systematic and consistent criteria. It is based on two concepts (1) the integration of results from different sequence analysis tools increases the prediction reliability; and (2) the integration protocol is critical and needs to be easily adaptable in a case-by-case manner. ProteoMix was designed to analyze simultaneously multiple protein sequences using several bioinformatics tools, merge the results of the analyses using logical functions and display them on an integrated viewer. In addition, new sequences can be added seamlessly to an analysis performed on an initial set of sequences. ProteoMix has a modular design, and bioinformatics tools are run on remote servers accessed using the Internet Simple Object Access Protocol (SOAP), ensuring the swift implementation of additional tools. ProteoMix has a user-friendly interactive graphical user interface environment and runs on PCs with Microsoft OS. AVAILABILITY: ProteoMix is freely available for academic users at http://bio.gsc.riken.jp/ProteoMix/
Eisuke Chikayama, Atsushi Kurotani, Yutaka Kuroda, Shigeyuki Yokoyama
Bioinform.2