首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   117篇
  免费   19篇
  2017年   2篇
  2015年   2篇
  2013年   25篇
  2011年   5篇
  2009年   6篇
  2008年   2篇
  2007年   3篇
  2006年   2篇
  2005年   9篇
  2004年   3篇
  2002年   5篇
  1999年   2篇
  1998年   2篇
  1997年   2篇
  1996年   4篇
  1992年   2篇
  1989年   2篇
  1982年   1篇
  1981年   1篇
  1980年   1篇
  1978年   1篇
  1975年   2篇
  1971年   1篇
  1948年   1篇
  1943年   1篇
  1929年   1篇
  1926年   1篇
  1925年   1篇
  1924年   1篇
  1921年   1篇
  1920年   1篇
  1915年   2篇
  1914年   1篇
  1909年   1篇
  1902年   1篇
  1901年   1篇
  1897年   2篇
  1892年   1篇
  1891年   1篇
  1889年   1篇
  1888年   1篇
  1887年   1篇
  1883年   3篇
  1882年   5篇
  1881年   2篇
  1880年   1篇
  1879年   6篇
  1878年   2篇
  1877年   2篇
  1876年   1篇
排序方式: 共有136条查询结果,搜索用时 750 毫秒
1.
2.
3.
4.
5.

Background  

Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from sequence alignments, which often involves some sort of correction for multiple substitutions. The problem is to accurately estimate the number of true substitutions given an observed alignment. So far, the most accurate protein distance estimators have looked for the optimal matrix in a series of transition probability matrices, e.g. the Dayhoff series. The evolutionary distance between two aligned sequences is here estimated as the evolutionary distance of the optimal matrix. The optimal matrix can be found either by an iterative search for the Maximum Likelihood matrix, or by integration to find the Expected Distance. As a consequence, these methods are more complex to implement and computationally heavier than correction-based methods. Another problem is that the result may vary substantially depending on the evolutionary model used for the matrices. An ideal distance estimator should produce consistent and accurate distances independent of the evolutionary model used.  相似文献   
6.

Background  

Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling are not fully known. In the present work we approached this by using two of the most popular HMM packages: SAM and HMMER. The programs' abilities to build models and score sequences were compared on a SCOP/Pfam based test set. The comparison was done separately for local and global HMM scoring.  相似文献   
7.
8.
The galactose/glucose-binding protein (GBP) is synthesized in the cytoplasm of Escherichia coli in a precursor form and exported into the periplasmic space upon cleavage of a 23-amino-acid leader sequence. GBP binds galactose and glucose in a highly specific manner. The ligand induces a hinge motion in GBP and the resultant protein conformational change constitutes the basis of the sensing system. The mglB gene, which codes for GBP, was isolated from the chromosome of E. coli using the polymerase chain reaction (PCR). Since wild-type GBP lacks cysteines in its structure, introducing this amino acid by site-directed mutagenesis ensures single-label attachment at specific sites with a sulfhydro-specific fluorescent probe. Site-directed mutagenesis by overlap extension PCR was performed to prepare three different mutants to introduce a single cysteine residue at positions 148, 152, and 182. Since these residues are not involved in ligand binding and since they are located at the edge of the binding cleft, they experience a significant change in environment upon binding of galactose or glucose. The sensing system strategy is based on the fluorescence changes of the probe as the protein undergoes a structural change on binding. In this work a reagentless sensing system has been rationally designed that can detect submicromolar concentrations of glucose. The calibration plots have a linear working range of three orders of magnitude. Although the system can sense galactose as well, this epimer is not a potential interfering substance since its concentration in blood is negligible.  相似文献   
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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