全文获取类型
收费全文 | 1459篇 |
免费 | 104篇 |
国内免费 | 27篇 |
专业分类
1590篇 |
出版年
2025年 | 11篇 |
2024年 | 23篇 |
2023年 | 24篇 |
2022年 | 19篇 |
2021年 | 33篇 |
2020年 | 37篇 |
2019年 | 51篇 |
2018年 | 34篇 |
2017年 | 46篇 |
2016年 | 53篇 |
2015年 | 41篇 |
2014年 | 65篇 |
2013年 | 94篇 |
2012年 | 47篇 |
2011年 | 73篇 |
2010年 | 69篇 |
2009年 | 83篇 |
2008年 | 88篇 |
2007年 | 97篇 |
2006年 | 89篇 |
2005年 | 68篇 |
2004年 | 62篇 |
2003年 | 56篇 |
2002年 | 41篇 |
2001年 | 48篇 |
2000年 | 36篇 |
1999年 | 37篇 |
1998年 | 27篇 |
1997年 | 20篇 |
1996年 | 16篇 |
1995年 | 17篇 |
1994年 | 18篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1972年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有1590条查询结果,搜索用时 15 毫秒
1.
2.
Touraj Mohammadpour Amir Massoud Bidgoli Rasul Enayatifar Hamid Haj Seyyed Javadi 《Genomics》2019,111(6):1902-1912
The ultimate goal of the Recommender System (RS) is to offer a proposal that is very close to the user's real opinion. Data clustering can be effective in increasing the accuracy of production proposals by the RS. In this paper, single-objective hybrid evolutionary approach is proposed for clustering items in the offline collaborative filtering RS. This method, after generating a population of randomized solutions, at each iteration, improves the population of solutions first by Genetic Algorithm (GA) and then by using the Gravitational Emulation Local Search (GELS) algorithm. Simulation results on standard datasets indicate that although the proposed hybrid meta-heuristic algorithm requires a relatively high run time, it can lead to more appropriate clustering of existing data and thus improvement of the Mean Absolute Error (MAE), Root Mean Square Error (RMSE) and Coverage criteria. 相似文献
3.
Many important characteristics of proteins such as biochemical activity and subcellular localization present a challenge to machine-learning methods: it is often difficult to encode the appropriate input features at the residue level for the purpose of making a prediction for the entire protein. The problem is usually that the biophysics of the connection between a machine-learning method's input (sequence feature) and its output (observed phenomenon to be predicted) remains unknown; in other words, we may only know that a certain protein is an enzyme (output) without knowing which region may contain the active site residues (input). The goal then becomes to dissect a protein into a vast set of sequence-derived features and to correlate those features with the desired output. We introduce a framework that begins with a set of global sequence features and then vastly expands the feature space by generically encoding the coexistence of residue-based features. It is this combination of individual features, that is the step from the fractions of serine and buried (input space 20 + 2) to the fraction of buried serine (input space 20 * 2) that implicitly shifts the search space from global feature inputs to features that can capture very local evidence such as a the individual residues of a catalytic triad. The vast feature space created is explored by a genetic algorithm (GA) paired with neural networks and support vector machines. We find that the GA is critical for selecting combinations of features that are neither too general resulting in poor performance, nor too specific, leading to overtraining. The final framework manages to effectively sample a feature space that is far too large for exhaustive enumeration. We demonstrate the power of the concept by applying it to prediction of protein enzymatic activity. 相似文献
5.
Arunachalam J Kanagasabai V Gautham N 《Biochemical and biophysical research communications》2006,342(2):424-433
We combine a new, extremely fast technique to generate a library of low energy structures of an oligopeptide (by using mutually orthogonal Latin squares to sample its conformational space) with a genetic algorithm to predict protein structures. The protein sequence is divided into oligopeptides, and a structure library is generated for each. These libraries are used in a newly defined mutation operator that, together with variation, crossover, and diversity operators, is used in a modified genetic algorithm to make the prediction. Application to five small proteins has yielded near native structures. 相似文献
6.
Rafael Beine Alfred Rocas Valente Rebekka Biedendieck Dieter Jahn Jürgen Seibel 《Process Biochemistry》2009,44(10):1103-1114
Many biocatalysts exhibit strict stereospecificity and regioselectivity. However, their thermodynamically controlled equilibria often limit yields in industrial production processes. Herein, we describe the synthesis of fructooligosaccharides from sucrose by various fructansucrases. We previously demonstrated that transfructosylation to diverse acceptors yields d-glucose and the fructose-containing product along with diverse by-products. To streamline this reaction, we developed a procedure that allows the enhanced transfructosylation of diverse acceptors by different fructansucrases. By diverting the released glucose from the reaction via metabolism by living cells we limited the back reaction and forced the consumption of sucrose. The basic conditions for the resulting fermentation process were optimized by a genetic algorithm and integrated into a kinetic model. This strategy allows the prediction of optimal reaction parameters for the production of desired target compounds. 相似文献
7.
Investigating the interactions between universal and culturally specific influences on color categorization across individuals and cultures has proven to be a challenge for human color categorization and naming research. The present article simulates the evolution of color lexicons to evaluate the role of two realistic constraints found in the human phenomenon: (i) heterogeneous observer populations and (ii) heterogeneous color stimuli. Such constraints, idealized and implemented as agent categorization and communication games, produce interesting and unexpected consequences for stable categorization solutions evolved and shared by agent populations. We find that the presence of a small fraction of color deficient agents in a population, or the presence of a “region of increased salience” in the color stimulus space, break rotational symmetry in population categorization solutions, and confine color category boundaries to a subset of available locations. Further, these heterogeneities, each in a different, predictable, way, might lead to a change of category number and size. In addition, the concurrent presence of both types of heterogeneity gives rise to novel constrained solutions which optimize the success rate of categorization and communication games. Implications of these agent-based results for psychological theories of color categorization and the evolution of color naming systems in human societies are discussed. 相似文献
8.
Yicheng Ren;Ziyi Xu;Manyu Li;Wenyu Dai;Jiechen Wang; 《Journal of Biogeography》2024,51(12):2512-2525
Literature and fossil records document the long-term occurrence sites of large herbivorous mammals in China. These sites exhibit spatially uneven distribution, potentially reflecting constraints on the dispersal of large herbivorous mammals imposed by stable geomorphic factors. In this study, we examine the impact of landforms on the dispersal of four taxa of large herbivorous mammals across China. 相似文献
9.
10.
It has been proposed that proteins fold by a process called \"Zipping and Assembly\" (Z&A). Zipping refers to the growth of local substructures within the chain, and assembly refers to the coming together of already-formed pieces. Our interest here is in whether Z&A is a general method that can fold most of sequence space, to global minima, efficiently. Using the HP model, we can address this question by enumerating full conformation and sequence spaces. We find that Z&A reaches the global energy minimum native states, even though it searches only a very small fraction of conformational space, for most sequences in the full sequence space. We find that Z&A, a mechanism-based search, is more efficient in our tests than the replica exchange search method. Folding efficiency is increased for chains having: (a) small loop-closure steps, consistent with observations by Plaxco et al. 1998;277;985-994 that folding rates correlate with contact order, (b) neither too few nor too many nucleation sites per chain, and (c) assembly steps that do not occur too early in the folding process. We find that the efficiency increases with chain length, although our range of chain lengths is limited. We believe these insights may be useful for developing faster protein conformational search algorithms. 相似文献