[Objectives]To clone the sucC gene of Vibrio alginolyticus strain HY9901 and conduct the bioinformatics analysis.[Methods]Based on the sucC gene of V.alginolyticus strain HY9901,specific primers were designed to ampli...[Objectives]To clone the sucC gene of Vibrio alginolyticus strain HY9901 and conduct the bioinformatics analysis.[Methods]Based on the sucC gene of V.alginolyticus strain HY9901,specific primers were designed to amplify the full length sequence by PCR and make further analysis.[Results]The theoretical molecular weight of SucC protein was about 41528.45 Da,and the full length was 1167 bp,encoding 388 amino acids.It has no signal peptide and transmembrane region,and has a variety of functional sites.It is predicted that it is mainly located in the cytoplasm,and the ubiquitin and lactate modification sites overlap,and it has high gene homology with Vibrio parahaemolyticus.Theα-helix,random coil and extended strand are the main secondary structures.The similarity between the constructed three-level structure model and the template is high.[Conclusions]This study reveals the structural characteristics and functional potential of SucC protein,and provides a theoretical basis for the study of drug resistance mechanism and prevention strategies.展开更多
On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need ...On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. We first introduce the ap- plication of graph search in various scenarios. We then for- malize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we analyze the difficulties and challenges of big graph search. Finally, we present three classes of techniques to- wards big graph search： query techniques, data techniques and distributed computing techniques.展开更多
基金Supported by National Natural Science Foundation of China(32073015)Graduate Education Innovation Program of Guangdong Province(YJYH[2022]1)+1 种基金Undergraduate Innovation and Entrepreneurship Training Program of Guangdong Ocean University(CXXL2024007)Undergraduate Innovation Team of Guangdong Ocean University(CCTD201802).
文摘[Objectives]To clone the sucC gene of Vibrio alginolyticus strain HY9901 and conduct the bioinformatics analysis.[Methods]Based on the sucC gene of V.alginolyticus strain HY9901,specific primers were designed to amplify the full length sequence by PCR and make further analysis.[Results]The theoretical molecular weight of SucC protein was about 41528.45 Da,and the full length was 1167 bp,encoding 388 amino acids.It has no signal peptide and transmembrane region,and has a variety of functional sites.It is predicted that it is mainly located in the cytoplasm,and the ubiquitin and lactate modification sites overlap,and it has high gene homology with Vibrio parahaemolyticus.Theα-helix,random coil and extended strand are the main secondary structures.The similarity between the constructed three-level structure model and the template is high.[Conclusions]This study reveals the structural characteristics and functional potential of SucC protein,and provides a theoretical basis for the study of drug resistance mechanism and prevention strategies.
基金This work was supported in part by 973 program （2014CB340300）, National Natural Science Foundation of China （Grant No. 61322207） and the Fundamental Research Funds for the Central Universi- ties.
文摘On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. We first introduce the ap- plication of graph search in various scenarios. We then for- malize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we analyze the difficulties and challenges of big graph search. Finally, we present three classes of techniques to- wards big graph search： query techniques, data techniques and distributed computing techniques.
