Pub Date : 1997-06-01DOI: 10.1093/bioinformatics/13.3.235
A Rambaut, N C Grassly
Motivation: Seq-Gen is a program that will simulate the evolution of nucleotide sequences along a phylogeny, using common models of the substitution process. A range of models of molecular evolution are implemented, including the general reversible model. Nucleotide frequencies and other parameters of the model may be given and site-specific rate heterogeneity can also be incorporated in a number of ways. Any number of trees may be read in and the program will produce any number of data sets for each tree. Thus, large sets of replicate simulations can be easily created. This can be used to test phylogenetic hypotheses using the parametric bootstrap.
Availability: Seq-Gen can be obtained by WWW from http:/(/)evolve.zoo.ox.ac.uk/Seq-Gen/seq-gen.html++ + or by FTP from ftp:/(/)evolve.zoo.ox.ac.uk/packages/Seq-Gen/. The package includes the source code, manual and example files. An Apple Macintosh version is available from the same sites.
{"title":"Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees.","authors":"A Rambaut, N C Grassly","doi":"10.1093/bioinformatics/13.3.235","DOIUrl":"https://doi.org/10.1093/bioinformatics/13.3.235","url":null,"abstract":"<p><strong>Motivation: </strong>Seq-Gen is a program that will simulate the evolution of nucleotide sequences along a phylogeny, using common models of the substitution process. A range of models of molecular evolution are implemented, including the general reversible model. Nucleotide frequencies and other parameters of the model may be given and site-specific rate heterogeneity can also be incorporated in a number of ways. Any number of trees may be read in and the program will produce any number of data sets for each tree. Thus, large sets of replicate simulations can be easily created. This can be used to test phylogenetic hypotheses using the parametric bootstrap.</p><p><strong>Availability: </strong>Seq-Gen can be obtained by WWW from http:/(/)evolve.zoo.ox.ac.uk/Seq-Gen/seq-gen.html++ + or by FTP from ftp:/(/)evolve.zoo.ox.ac.uk/packages/Seq-Gen/. The package includes the source code, manual and example files. An Apple Macintosh version is available from the same sites.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.3.235","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Motivation: Efficient high-throughput genotyping experiments require the multiplexing of polymorphic markers, i.e. the use of multiple markers with non-overlapping allele size ranges in a single lane of a genotyping gel. The arrangement of such markers into sets can be facilitated by the availability of appropriate computer software.
Results: This article describes a program, Grouper, that automates the generation of marker sets for multiplexed genotyping experiments.
Availability: The software described in this article is available free of charge from the EBI software archive at (ftp://ftp.ebi.ac.uk/pub/software/unix).
{"title":"Grouper--creation of marker sets for multiplexed genotyping.","authors":"R Fuchs","doi":"","DOIUrl":"","url":null,"abstract":"<p><strong>Motivation: </strong>Efficient high-throughput genotyping experiments require the multiplexing of polymorphic markers, i.e. the use of multiple markers with non-overlapping allele size ranges in a single lane of a genotyping gel. The arrangement of such markers into sets can be facilitated by the availability of appropriate computer software.</p><p><strong>Results: </strong>This article describes a program, Grouper, that automates the generation of marker sets for multiplexed genotyping experiments.</p><p><strong>Availability: </strong>The software described in this article is available free of charge from the EBI software archive at (ftp://ftp.ebi.ac.uk/pub/software/unix).</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-01DOI: 10.1093/bioinformatics/13.3.297
A Fiser, Z Dosztányi, I Simon
Motivation: Secondary structure predictions based on the properties of individual residues, and sometimes on local interactions, usually fail to exceed 65% efficiency. Therefore, non-local, long-range interactions seem to be a significant cause of this limitation.
Results: In this paper, we apply approaches to localize highly interacting residues and clusters of residues involved in multiple non-local interactions, and test various secondary structure predictions on this separate subset to assess the effect of long-range interactions on the prediction efficiencies. It was found that only a marginal part of the failure of secondary structure predictions results from the presence of long-range interactions. Alternative possibilities are also discussed.
{"title":"The role of long-range interactions in defining the secondary structure of proteins is overestimated.","authors":"A Fiser, Z Dosztányi, I Simon","doi":"10.1093/bioinformatics/13.3.297","DOIUrl":"https://doi.org/10.1093/bioinformatics/13.3.297","url":null,"abstract":"<p><strong>Motivation: </strong>Secondary structure predictions based on the properties of individual residues, and sometimes on local interactions, usually fail to exceed 65% efficiency. Therefore, non-local, long-range interactions seem to be a significant cause of this limitation.</p><p><strong>Results: </strong>In this paper, we apply approaches to localize highly interacting residues and clusters of residues involved in multiple non-local interactions, and test various secondary structure predictions on this separate subset to assess the effect of long-range interactions on the prediction efficiencies. It was found that only a marginal part of the failure of secondary structure predictions results from the presence of long-range interactions. Alternative possibilities are also discussed.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.3.297","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Present-day sequences are the result of long and complex pathways of evolution. Many of the features encoded in them are the result of a series of evolutionary processes, including selection, genetic drift, etc. Following this, protein families have a great amount of unexplored information that can be useful for many purposes beyond simple evolutionary studies. An index is presented here which permits the localization of regions showing an unexpected degree of variability or conservation. This index uses the information contained in sequence alignments and compares the observed over expected level of variability using tables for the relative likelihood of amino acid change.
{"title":"A new index to find regions showing an unexpected variability or conservation in sequence alignments.","authors":"J Dopazo","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Present-day sequences are the result of long and complex pathways of evolution. Many of the features encoded in them are the result of a series of evolutionary processes, including selection, genetic drift, etc. Following this, protein families have a great amount of unexplored information that can be useful for many purposes beyond simple evolutionary studies. An index is presented here which permits the localization of regions showing an unexpected degree of variability or conservation. This index uses the information contained in sequence alignments and compares the observed over expected level of variability using tables for the relative likelihood of amino acid change.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-01DOI: 10.1093/bioinformatics/13.3.263
S Tiwari, S Ramachandran, A Bhattacharya, S Bhattacharya, R Ramaswamy
MOTIVATION The major signal in coding regions of genomic sequences is a three-base periodicity. Our aim is to use Fourier techniques to analyse this periodicity, and thereby to develop a tool to recognize coding regions in genomic DNA. RESULT The three-base periodicity in the nucleotide arrangement is evidenced as a sharp peak at frequency f = 1/3 in the Fourier (or power) spectrum. From extensive spectral analysis of DNA sequences of total length over 5.5 million base pairs from a wide variety or organisms (including the human genome), and by separately examining coding and non-coding sequences, we find that the relative-height of the peak at f = 1/3 in the Fourier spectrum is a good discriminator of coding potential. This feature is utilized by us to detect probable coding regions in DNA sequences, by examining the local signal-to-noise ratio of the peak within a sliding window. While the overall accuracy is comparable to that of other techniques currently in use, the measure that is presently proposed is independent of training sets or existing database information, and can thus find general application. AVAILABILITY A computer program GeneScan which locates coding open reading frames and exonic regions in genomic sequences has been developed, and is available on request.
{"title":"Prediction of probable genes by Fourier analysis of genomic sequences.","authors":"S Tiwari, S Ramachandran, A Bhattacharya, S Bhattacharya, R Ramaswamy","doi":"10.1093/bioinformatics/13.3.263","DOIUrl":"https://doi.org/10.1093/bioinformatics/13.3.263","url":null,"abstract":"MOTIVATION The major signal in coding regions of genomic sequences is a three-base periodicity. Our aim is to use Fourier techniques to analyse this periodicity, and thereby to develop a tool to recognize coding regions in genomic DNA. RESULT The three-base periodicity in the nucleotide arrangement is evidenced as a sharp peak at frequency f = 1/3 in the Fourier (or power) spectrum. From extensive spectral analysis of DNA sequences of total length over 5.5 million base pairs from a wide variety or organisms (including the human genome), and by separately examining coding and non-coding sequences, we find that the relative-height of the peak at f = 1/3 in the Fourier spectrum is a good discriminator of coding potential. This feature is utilized by us to detect probable coding regions in DNA sequences, by examining the local signal-to-noise ratio of the peak within a sliding window. While the overall accuracy is comparable to that of other techniques currently in use, the measure that is presently proposed is independent of training sets or existing database information, and can thus find general application. AVAILABILITY A computer program GeneScan which locates coding open reading frames and exonic regions in genomic sequences has been developed, and is available on request.","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.3.263","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-01DOI: 10.1093/bioinformatics/13.3.231
P Aloy, J Cedano, B Oliva, F X Avilés, E Querol
Motivation: Genomic sequences from different organisms, even prokaryotic, have plenty of orphan ORFs, making necessary methods for the prediction of protein structure and function. The prediction of the presence of hydrophobic transmembrane (HTM) stretches is a valuable clue for this.
Results: The program. TransMem, based on a neural network and running on personal computers (either Apple Macintosh or PC, using Excel worksheets), for the prediction and distribution of amino acid residues in transmembrane segments of integral membrane proteins is reported. The percentage of residue predictive accuracy obtained for the set of proteins tested is 93%, ranging from 99.9% for the best to 71.7% for the worst prediction. The segment-based accuracy is 93.6%; 63.6% of the protein set match any of the predicted and observed segment locations.
Availability: TransMem is available upon request or by anonymous up: IP address: luz.uab.es, directory/pub/ TransMem. It is also placed on the EMBL file server (ftp:/(/)ftp.ebi.ac.uk/pub/software/mac/TransMem ).
动机:来自不同生物,甚至原核生物的基因组序列都有大量的孤儿orf,这为预测蛋白质结构和功能提供了必要的方法。预测疏水跨膜(HTM)拉伸的存在是一个有价值的线索。结果:程序。TransMem基于神经网络,在个人电脑(苹果Macintosh或个人电脑,使用Excel工作表)上运行,用于预测完整膜蛋白跨膜段氨基酸残基的分布。对一组被测试的蛋白质获得的残基预测准确率百分比为93%,从最佳预测的99.9%到最差预测的71.7%不等。基于分段的准确率为93.6%;63.6%的蛋白质组与预测和观察到的片段位置相匹配。可用性:TransMem可根据请求或匿名访问:IP地址:luz.uab.es,目录/pub/ TransMem。它也放在EMBL文件服务器(ftp:/(/)ftp.ebi.ac)上。英国/ pub /软件/ mac / TransMem)。
{"title":"'TransMem': a neural network implemented in Excel spreadsheets for predicting transmembrane domains of proteins.","authors":"P Aloy, J Cedano, B Oliva, F X Avilés, E Querol","doi":"10.1093/bioinformatics/13.3.231","DOIUrl":"https://doi.org/10.1093/bioinformatics/13.3.231","url":null,"abstract":"<p><strong>Motivation: </strong>Genomic sequences from different organisms, even prokaryotic, have plenty of orphan ORFs, making necessary methods for the prediction of protein structure and function. The prediction of the presence of hydrophobic transmembrane (HTM) stretches is a valuable clue for this.</p><p><strong>Results: </strong>The program. TransMem, based on a neural network and running on personal computers (either Apple Macintosh or PC, using Excel worksheets), for the prediction and distribution of amino acid residues in transmembrane segments of integral membrane proteins is reported. The percentage of residue predictive accuracy obtained for the set of proteins tested is 93%, ranging from 99.9% for the best to 71.7% for the worst prediction. The segment-based accuracy is 93.6%; 63.6% of the protein set match any of the predicted and observed segment locations.</p><p><strong>Availability: </strong>TransMem is available upon request or by anonymous up: IP address: luz.uab.es, directory/pub/ TransMem. It is also placed on the EMBL file server (ftp:/(/)ftp.ebi.ac.uk/pub/software/mac/TransMem ).</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.3.231","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20130107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-01DOI: 10.1093/bioinformatics/13.3.249
E Depiereux, G Baudoux, P Briffeuil, I Reginster, X De Bolle, C Vinals, E Feytmans
Motivation: The Match-Box software comprises protein sequence alignment tools based on strict statistical thresholds of similarity between protein segments. The method circumvents the gap penalty requirement: gaps being the result of the alignment and not a governing parameter of the procedure. The reliable conserved regions outlined by Match-Box are particularly relevant for homology modelling of protein structures, prediction of essential residues for site-directed mutagenesis and oligonucleotide design for cloning homologous genes by polymerase chain reaction (PCR).
Results: The method produces reliable results, as assessed by tests performed on protein families of known structures and of low sequence similarity. A reliability score is computed in relation to a threshold of similarity progressively raised to extend the aligned regions to their maximal length, up to the significance limit of matching segments. The score obtained at each position is printed below the sequences and allows a discriminant reading of each aligned region.
Availability: Sequences may be submitted to a Web server at http://www.fundp.ac.be/sciences/biologie/bms/+ ++matchbox_submit.html or sent by e-mail to matchbox/biq.fundp.ac.be (help available by just mailing help).
{"title":"Match-Box_server: a multiple sequence alignment tool placing emphasis on reliability.","authors":"E Depiereux, G Baudoux, P Briffeuil, I Reginster, X De Bolle, C Vinals, E Feytmans","doi":"10.1093/bioinformatics/13.3.249","DOIUrl":"https://doi.org/10.1093/bioinformatics/13.3.249","url":null,"abstract":"<p><strong>Motivation: </strong>The Match-Box software comprises protein sequence alignment tools based on strict statistical thresholds of similarity between protein segments. The method circumvents the gap penalty requirement: gaps being the result of the alignment and not a governing parameter of the procedure. The reliable conserved regions outlined by Match-Box are particularly relevant for homology modelling of protein structures, prediction of essential residues for site-directed mutagenesis and oligonucleotide design for cloning homologous genes by polymerase chain reaction (PCR).</p><p><strong>Results: </strong>The method produces reliable results, as assessed by tests performed on protein families of known structures and of low sequence similarity. A reliability score is computed in relation to a threshold of similarity progressively raised to extend the aligned regions to their maximal length, up to the significance limit of matching segments. The score obtained at each position is printed below the sequences and allows a discriminant reading of each aligned region.</p><p><strong>Availability: </strong>Sequences may be submitted to a Web server at http://www.fundp.ac.be/sciences/biologie/bms/+ ++matchbox_submit.html or sent by e-mail to matchbox/biq.fundp.ac.be (help available by just mailing help).</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.3.249","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Motivation: The principal motivation was to design an environment for the development of image-analysis applications which would allow the integration of independent modules into one frame and make available tools for their build-up, running, management and mutual communication.
Results: The system was designed as modular, consisting of the core and work modules. The system core focuses on overall management and provides a library of classes for build-up of the work modules, their user interface and data communication. The work modules carry practical implementation of algorithms and data structures for the solution of a particular problem, and were implemented as dynamic-link libraries. They are mutually independent and run as individual threads, communicating with each other via a unified mechanism. The environment was designed to simplify the development and testing of new algorithms or applications. An example of implementation for the particular problem of the analysis of two-dimensional (2D) gel electrophoretograms is presented. The environment was designed for the Windows NT operating system with the use of Microsoft Foundation Class Library employing the possibilities of C++ programming language.
Availability: Available on request from the authors.
{"title":"Object-oriented developmental environment for image-analysis applications: implementation for 2D gel electrophoretogram analysis.","authors":"J Pánek, J Vohradský","doi":"","DOIUrl":"","url":null,"abstract":"<p><strong>Motivation: </strong>The principal motivation was to design an environment for the development of image-analysis applications which would allow the integration of independent modules into one frame and make available tools for their build-up, running, management and mutual communication.</p><p><strong>Results: </strong>The system was designed as modular, consisting of the core and work modules. The system core focuses on overall management and provides a library of classes for build-up of the work modules, their user interface and data communication. The work modules carry practical implementation of algorithms and data structures for the solution of a particular problem, and were implemented as dynamic-link libraries. They are mutually independent and run as individual threads, communicating with each other via a unified mechanism. The environment was designed to simplify the development and testing of new algorithms or applications. An example of implementation for the particular problem of the analysis of two-dimensional (2D) gel electrophoretograms is presented. The environment was designed for the Windows NT operating system with the use of Microsoft Foundation Class Library employing the possibilities of C++ programming language.</p><p><strong>Availability: </strong>Available on request from the authors.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-06-01DOI: 10.1093/bioinformatics/13.3.281
S Panzer, L Cooley, P L Miller
Motivation: The increasing availability of biological databases on the World-Wide Web and hypertext links between them has made a wealth of information easily accessible to biologists. Additional retrieval capabilities can be achieved by storing explicitly specified biological relationships between different entities as discrete database entries.
Results: We have built CySPID, a prototype database about the cytoskeleton that explores the approach of explicitly representing biological relationships. The stored relationships are displayed along with other retrieved information, can be used to make hyperlinks to related entities, and can be used to search for entities with specified properties. CySPID is extensible in that new types of relationships may be created without altering the database schema.
Availability: CySPID is available for public use (http://ycmi.med.yale.edu/cyspid/). The CGI scripts used by CySPID are available upon request.
{"title":"Using explicitly represented biological relationships for database navigation and searching via the World-Wide Web.","authors":"S Panzer, L Cooley, P L Miller","doi":"10.1093/bioinformatics/13.3.281","DOIUrl":"https://doi.org/10.1093/bioinformatics/13.3.281","url":null,"abstract":"<p><strong>Motivation: </strong>The increasing availability of biological databases on the World-Wide Web and hypertext links between them has made a wealth of information easily accessible to biologists. Additional retrieval capabilities can be achieved by storing explicitly specified biological relationships between different entities as discrete database entries.</p><p><strong>Results: </strong>We have built CySPID, a prototype database about the cytoskeleton that explores the approach of explicitly representing biological relationships. The stored relationships are displayed along with other retrieved information, can be used to make hyperlinks to related entities, and can be used to search for entities with specified properties. CySPID is extensible in that new types of relationships may be created without altering the database schema.</p><p><strong>Availability: </strong>CySPID is available for public use (http://ycmi.med.yale.edu/cyspid/). The CGI scripts used by CySPID are available upon request.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/13.3.281","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"20129530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}