首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1055篇
  免费   59篇
  国内免费   51篇
  1165篇
  2024年   6篇
  2023年   22篇
  2022年   12篇
  2021年   17篇
  2020年   34篇
  2019年   41篇
  2018年   29篇
  2017年   28篇
  2016年   37篇
  2015年   48篇
  2014年   40篇
  2013年   65篇
  2012年   32篇
  2011年   36篇
  2010年   48篇
  2009年   46篇
  2008年   45篇
  2007年   49篇
  2006年   51篇
  2005年   41篇
  2004年   37篇
  2003年   34篇
  2002年   34篇
  2001年   24篇
  2000年   33篇
  1999年   28篇
  1998年   23篇
  1997年   18篇
  1996年   25篇
  1995年   13篇
  1994年   6篇
  1993年   10篇
  1992年   10篇
  1990年   7篇
  1989年   7篇
  1988年   8篇
  1987年   5篇
  1985年   10篇
  1984年   8篇
  1983年   6篇
  1982年   10篇
  1980年   6篇
  1979年   5篇
  1977年   9篇
  1976年   6篇
  1975年   10篇
  1974年   6篇
  1973年   7篇
  1972年   8篇
  1971年   8篇
排序方式: 共有1165条查询结果,搜索用时 15 毫秒
51.
52.
Understanding the tradeoffs faced by organisms is a major goal of evolutionary biology. One of the main approaches for identifying these tradeoffs is Pareto task inference (ParTI). Two recent papers claim that results obtained in ParTI studies are spurious due to phylogenetic dependence (Mikami T, Iwasaki W. 2021. The flipping t-ratio test: phylogenetically informed assessment of the Pareto theory for phenotypic evolution. Methods Ecol Evol. 12(4):696–706) or hypothetical p-hacking and population-structure concerns (Sun M, Zhang J. 2021. Rampant false detection of adaptive phenotypic optimization by ParTI-based Pareto front inference. Mol Biol Evol. 38(4):1653–1664). Here, we show that these claims are baseless. We present a new method to control for phylogenetic dependence, called SibSwap, and show that published ParTI inference is robust to phylogenetic dependence. We show how researchers avoided p-hacking by testing for the robustness of preprocessing choices. We also provide new methods to control for population structure and detail the experimental tests of ParTI in systems ranging from ammonites to cancer gene expression. The methods presented here may help to improve future ParTI studies.  相似文献   
53.
54.
55.
Ca2+‐binding sites in proteins exhibit a wide range of polygonal geometries that directly relate to an equally‐diverse set of biological functions. Although the highly‐conserved EF‐Hand motif has been studied extensively, non‐EF‐Hand sites exhibit much more structural diversity which has inhibited efforts to determine the precise location of Ca2+‐binding sites, especially for sites with few coordinating ligands. Previously, we established an algorithm capable of predicting Ca2+‐binding sites using graph theory to identify oxygen clusters comprised of four atoms lying on a sphere of specified radius, the center of which was the predicted calcium position. Here we describe a new algorithm, MUG (MUltiple Geometries), which predicts Ca2+‐binding sites in proteins with atomic resolution. After first identifying all the possible oxygen clusters by finding maximal cliques, a calcium center (CC) for each cluster, corresponding to the potential Ca2+ position, is located to maximally regularize the structure of the (cluster, CC) pair. The structure is then inspected by geometric filters. An unqualified (cluster, CC) pair is further handled by recursively removing oxygen atoms and relocating the CC until its structure is either qualified or contains fewer than four ligand atoms. Ligand coordination is then determined for qualified structures. This algorithm, which predicts both Ca2+ positions and ligand groups, has been shown to successfully predict over 90% of the documented Ca2+‐binding sites in three datasets of highly‐diversified protein structures with 0.22 to 0.49 Å accuracy. All multiple‐binding sites (i.e. sites with a single ligand atom associated with multiple calcium ions) were predicted, as were half of the low‐coordination sites (i.e. sites with less than four protein ligand atoms) and 14/16 cofactor‐coordinating sites. Additionally, this algorithm has the flexibility to incorporate surface water molecules and protein cofactors to further improve the prediction for low‐coordination and cofactor‐coordinating Ca2+‐binding sites. Proteins 2009. © 2008 Wiley‐Liss, Inc.  相似文献   
56.
Feeding studies can provide researchers with important insights towards understanding potential fishery impacts on marine systems. Raja rhina is one of the most common elasmobranch species landed in central and northern California demersal fisheries, yet life history information is extremely limited for this species and aspects of its diet are unknown. Specimens of R. rhina were collected between September, 2002 and August, 2003 from fisheries-independent trawl surveys. Percent Index of Relative Importance values indicated that the five most important prey items in 618 stomachs of R. rhina were unidentified teleosts (31.6% IRI), unidentified shrimps (19.6% IRI), unidentified euphausiids (10.9% IRI), Crangonidae (7.4% IRI), and Neocrangon resima (6.0% IRI). There were significant dietary shifts with increasing skate total length and with increasing depths. Smaller skates ate small crustaceans and larger skates ate larger fishes and cephalopods. With increasing depths, diet included bentho-pelagic teleosts and more cephalopods and euphausiids. The findings of this study are consistent with previous researchers that report similar diet shifts in skate species with size and depth.  相似文献   
57.
58.
Patterns of DNA sequence polymorphisms can be used to understand the processes of demography and adaptation within natural populations. High-throughput generation of DNA sequence data has historically been the bottleneck with respect to data processing and experimental inference. Advances in marker technologies have largely solved this problem. Currently, the limiting step is computational, with most molecular population genetic software allowing a gene-by-gene analysis through a graphical user interface. An easy-to-use analysis program that allows both high-throughput processing of multiple sequence alignments along with the flexibility to simulate data under complex demographic scenarios is currently lacking. We introduce a new program, named DnaSAM, which allows high-throughput estimation of DNA sequence diversity and neutrality statistics from experimental data along with the ability to test those statistics via Monte Carlo coalescent simulations. These simulations are conducted using the ms program, which is able to incorporate several genetic parameters (e.g. recombination) and demographic scenarios (e.g. population bottlenecks). The output is a set of diversity and neutrality statistics with associated probability values under a user-specified null model that are stored in easy to manipulate text file.  相似文献   
59.
The evolution of sociality is facilitated by the recognition of close kin, but if kin recognition is too accurate, nepotistic behaviour within societies can dissolve social cohesion. In social insects, cuticular hydrocarbons act as nestmate recognition cues and are usually mixed among colony members to create a Gestalt odour. Although earlier studies have established that hydrocarbon profiles are influenced by heritable factors, transfer among nestmates and additional environmental factors, no studies have quantified these relative contributions for separate compounds. Here, we use the ant Formica rufibarbis in a cross‐fostering design to test the degree to which hydrocarbons are heritably synthesized by young workers and transferred by their foster workers. Bioassays show that nestmate recognition has a significant heritable component. Multivariate quantitative analyses based on 38 hydrocarbons reveal that a subset of branched alkanes are heritably synthesized, but that these are also extensively transferred among nestmates. In contrast, especially linear alkanes are less heritable and little transferred; these are therefore unlikely to act as cues that allow within‐colony nepotistic discrimination or as nestmate recognition cues. These results indicate that heritable compounds are suitable for establishing a genetic Gestalt for efficient nestmate recognition, but that recognition cues within colonies are insufficiently distinct to allow nepotistic kin discrimination.  相似文献   
60.
A simple Monte Carlo method was used to generate ensembles of simulated polypeptide conformations that are restricted only by steric repulsion. The models used for these simulations were based on the sequences of four real proteins, ranging in size from 26 to 268 amino acid residues, and included all non-hydrogen atoms. Two sets of calculations were performed, one that included only intra-residue steric repulsion terms and those between adjacent residues, and one that included repulsion terms between all possible atom pairs, so as to explicitly account for the excluded volume effect. Excluded volume was found to increase the average radius of gyration of the chains by 20-40%, with the expansion factor increasing with chain length. Contrary to recent suggestions, however, the excluded volume effect did not greatly restrict the distribution of dihedral angles or favor native-like topologies. The average dimensions of the ensembles calculated with excluded volume were consistent with those measured experimentally for unfolded proteins of similar sizes under denaturing conditions, without introducing any adjustable scaling factor. The simulations also reproduced experimentally determined effective concentrations for the formation of disulfide bonds in reduced and unfolded proteins. The statistically generated ensembles included significant numbers of conformations that were nearly as compact as the corresponding native proteins, as well as many that were as accessible to solvent as a fully extended chain. On the other hand, conformations with as much buried surface area as the native proteins were very rare, as were highly extended conformations. These results suggest that the overall properties of unfolded proteins can be usefully described by a random coil model and that an unfolded polypeptide can undergo significant collapse while losing only a relatively small fraction of its conformational entropy.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号