首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   757篇
  免费   114篇
  国内免费   2篇
  2021年   20篇
  2020年   9篇
  2019年   14篇
  2018年   9篇
  2017年   7篇
  2016年   15篇
  2015年   21篇
  2014年   32篇
  2013年   39篇
  2012年   56篇
  2011年   53篇
  2010年   33篇
  2009年   30篇
  2008年   37篇
  2007年   38篇
  2006年   34篇
  2005年   40篇
  2004年   40篇
  2003年   26篇
  2002年   36篇
  2001年   17篇
  2000年   15篇
  1999年   30篇
  1998年   15篇
  1997年   8篇
  1996年   11篇
  1995年   12篇
  1994年   9篇
  1993年   11篇
  1992年   10篇
  1991年   17篇
  1990年   11篇
  1989年   10篇
  1988年   12篇
  1987年   6篇
  1986年   11篇
  1985年   8篇
  1984年   8篇
  1983年   7篇
  1982年   9篇
  1981年   4篇
  1980年   2篇
  1979年   5篇
  1978年   4篇
  1977年   6篇
  1976年   2篇
  1973年   2篇
  1969年   5篇
  1967年   2篇
  1966年   3篇
排序方式: 共有873条查询结果,搜索用时 343 毫秒
171.
At least three million people in the United States suffer from seasonal allergy caused by inhalation of airborne pollens of many species. Each affected person is a potential ultimate consumer of refined pollen products, and the annual collecting of pollen for this purpose amounts to $80,000 to $100,000 for the collectors.  相似文献   
172.
173.
The formation of neuronal networks requires axonal growth towards target neutons. A simple set of grammar rules is introduced to describe axonal growth towards target cells situated both at short and long distances from the growing neuron. Growth for short distances is descrbed by growth following the highest gradient of a chemical compound (which is spread by diffusion from the targets). This approach fails to describe long-distance growth, which is addressed by adopting a graph grammar theory for growing trees. With these rules a flexible tool to draw network of neurons by computer can be developed.  相似文献   
174.
Closing gaps in our current knowledge about biological pathways is a fundamental challenge. The development of novel computational methods along with high-throughput experimental data carries the promise to help in the challenge. We present an algorithm called MORPH (for module-guided ranking of candidate pathway genes) for revealing unknown genes in biological pathways. The method receives as input a set of known genes from the target pathway, a collection of expression profiles, and interaction and metabolic networks. Using machine learning techniques, MORPH selects the best combination of data and analysis method and outputs a ranking of candidate genes predicted to belong to the target pathway. We tested MORPH on 230 known pathways in Arabidopsis thaliana and 93 known pathways in tomato (Solanum lycopersicum) and obtained high-quality cross-validation results. In the photosynthesis light reactions, homogalacturonan biosynthesis, and chlorophyll biosynthetic pathways of Arabidopsis, genes ranked highly by MORPH were recently verified to be associated with these pathways. MORPH candidates ranked for the carotenoid pathway from Arabidopsis and tomato are derived from pathways that compete for common precursors or from pathways that are coregulated with or regulate the carotenoid biosynthetic pathway.  相似文献   
175.
176.
177.
MOTIVATION: The discovery of solid-binding peptide sequences is accelerating along with their practical applications in biotechnology and materials sciences. A better understanding of the relationships between the peptide sequences and their binding affinities or specificities will enable further design of novel peptides with selected properties of interest both in engineering and medicine. RESULTS: A bioinformatics approach was developed to classify peptides selected by in vivo techniques according to their inorganic solid-binding properties. Our approach performs all-against-all comparisons of experimentally selected peptides with short amino acid sequences that were categorized for their binding affinity and scores the alignments using sequence similarity scoring matrices. We generated novel scoring matrices that optimize the similarities within the strong-binding peptide sequences and the differences between the strong- and weak-binding peptide sequences. Using the scoring matrices thus generated, a given peptide is classified based on the sequence similarity to a set of experimentally selected peptides. We demonstrate the new approach by classifying experimentally characterized quartz-binding peptides and computationally designing new sequences with specific affinities. Experimental verifications of binding of these computationally designed peptides confirm our predictions with high accuracy. We further show that our approach is a general one and can be used to design new sequences that bind to a given inorganic solid with predictable and enhanced affinity.  相似文献   
178.
Founder populations and large pedigrees offer many well-known advantages for genetic mapping studies, including cost-efficient study designs. Here, we describe PRIMAL (PedigRee IMputation ALgorithm), a fast and accurate pedigree-based phasing and imputation algorithm for founder populations. PRIMAL incorporates both existing and original ideas, such as a novel indexing strategy of Identity-By-Descent (IBD) segments based on clique graphs. We were able to impute the genomes of 1,317 South Dakota Hutterites, who had genome-wide genotypes for ~300,000 common single nucleotide variants (SNVs), from 98 whole genome sequences. Using a combination of pedigree-based and LD-based imputation, we were able to assign 87% of genotypes with >99% accuracy over the full range of allele frequencies. Using the IBD cliques we were also able to infer the parental origin of 83% of alleles, and genotypes of deceased recent ancestors for whom no genotype information was available. This imputed data set will enable us to better study the relative contribution of rare and common variants on human phenotypes, as well as parental origin effect of disease risk alleles in >1,000 individuals at minimal cost.  相似文献   
179.
180.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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