全文获取类型
收费全文 | 149篇 |
免费 | 9篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2019年 | 2篇 |
2016年 | 2篇 |
2015年 | 8篇 |
2014年 | 5篇 |
2013年 | 3篇 |
2012年 | 8篇 |
2011年 | 6篇 |
2010年 | 4篇 |
2009年 | 6篇 |
2008年 | 8篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 5篇 |
2003年 | 8篇 |
2002年 | 4篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1995年 | 5篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 7篇 |
1991年 | 2篇 |
1990年 | 8篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1972年 | 2篇 |
1971年 | 1篇 |
1969年 | 2篇 |
排序方式: 共有158条查询结果,搜索用时 15 毫秒
1.
2.
A branch and bound algorithm is described for searching rapidlyfor minimal length trees from biological data. The algorithmadds characters one at a time, rather than adding taxa, as inprevious branch and bound methods. The algorithm has been programmedand is available from the authors. A worked example is givenwith 33 characters and 15 taxa. About 8 x 1012 binary treesare possible with 15 taxa but the branch and bound program findsthe minimal tree in <5 min on an IBM PC.
Received on January 15, 1987; accepted on February 23, 1987 相似文献
3.
A. P. Read R. V. Thakker K. E. Davies R. C. Mountford D. P. Brenton M. Davies F. Glorieux R. Harris G. N. Hendy A. King S. McGlade C. J. Peacock R. Smith J. L. H. O'Riordan 《Human genetics》1986,73(3):267-270
Summary Eleven families with X-linked dominant hypophosphataemic rickets (HPDR) have been typed for a series of X chromosome markers. Linkage with probe 99.6 (DXS41) was demonstrated with a peak lod score of 4.82 at 10% recombination. Multilocus linkage analysis showed that HPDR maps distal to 99.6; this probe has previously been located at Xp22.31-p21.3 by in situ hybridisation. In the mouse hypophosphataemia (Hyp) maps to the distal part of the X chromosome; our location in man is consistent with a scheme which relates the mouse and human X chromosomes by two rearrangements. No marker has yet been found which shows no recombination with HPDR. 相似文献
4.
Fragmentation of bovine chromogranin A by plasma kallikrein 总被引:1,自引:0,他引:1
Chromogranin A has been reported to be processed in vivo by an as yet undefined proteinase(s) suggesting that it is a precursor of biologically active peptides such as pancreastatin. In this study, plasma kallikrein was used as a model proteinase to identify the cleavage sites exposed in bovine parathyroid chromogranin A. Purified bovine parathyroid chromogranin A was digested with human plasma kallikrein. The proteolytic fragments produced were isolated by HPLC and chemically characterized by amino acid composition and sequence analysis. The combined results indicate that the enzyme has preference for specific single Arg residues, cutting C-terminal to this amino acid, although certain pairs of basic sites were also cleaved. The characterized fragments were released in a selective manner from the whole molecule with rapid production of the fragments covering positions 1-247 and 352-358. 相似文献
5.
L. Hendy J. Gallagher A. Winters T. J. Hackett L. McHale A. P. McHale 《Biotechnology letters》1990,12(9):673-678
Summary The thermophilic fungusTalaromyces emersonii CBS 814.70 produces a thermostable extracellular chitinolytic system when cultured on chitin containing media. The chitinolytic system consists of chitinase (EC 3.2.1.14) and N-acetylglucosaminidase (EC 3.2.1.30). Using fluorescent substrate analogues, in zymogram staining of polyacrylamide gradient and isoelectric focusing gels on which the chitinase system was electrophoresed and focused, respectively, it was found that a number of bands could be resolved. Using isoelectric focusing it was observed that at least 4 extracellular forms of chitinase activity are produced. 相似文献
6.
Summary The problem of determining the minimal phylogenetic tree is discussed in relation to graph theory. It is shown that this problem is an example of the Steiner problem in graphs which is to connect a set of points by a minimal length network where new points can be added. There is no reported method of solving realistically-sized Steiner problems in reasonable computing time. A heuristic method of approaching the phylogenetic problem is presented, together with a worked example with 7 mammalian cytochrome c sequences. It is shown in this case that the method develops a phylogenetic tree that has the smallest possible number of amino acid replacements. The potential and limitations of the method are discussed. It is stressed that objective methods must be used for comparing different trees. In particular it should be determined how close a given tree is to a mathematically determined lower bound. A theorem is proved which is used to establish a lower bound on the length of any tree and if a tree is found with a length equal to the lower bound, then no shorter tree can exist. 相似文献
7.
Evolutionists dream of a tree-reconstruction method that is efficient (fast), powerful, consistent, robust and falsifiable. These criteria are at present conflicting in that the fastest methods are weak (in their use of information in the sequences) and inconsistent (even with very long sequences they may lead to an incorrect tree). But there has been exciting progress in new approaches to tree inference, in understanding general properties of methods, and in developing ideas for estimating the reliability of trees. New phylogenetic invariant methods allow selected parameters of the underlying model to be estimated directly from sequences. There is still a need for more theoretical understanding and assistance in applying what is already known. 相似文献
8.
Maximum likelihood Jukes-Cantor triplets: analytic solutions 总被引:1,自引:0,他引:1
Maximum likelihood (ML) is a popular method for inferring a phylogenetic tree of the evolutionary relationship of a set of taxa, from observed homologous aligned genetic sequences of the taxa. Generally, the computation of the ML tree is based on numerical methods, which in a few cases, are known to converge to a local maximum on a tree, which is suboptimal. The extent of this problem is unknown, one approach is to attempt to derive algebraic equations for the likelihood equation and find the maximum points analytically. This approach has so far only been successful in the very simplest cases, of three or four taxa under the Neyman model of evolution of two-state characters. In this paper we extend this approach, for the first time, to four-state characters, the Jukes-Cantor model under a molecular clock, on a tree T on three taxa, a rooted triple. We employ spectral methods (Hadamard conjugation) to express the likelihood function parameterized by the path-length spectrum. Taking partial derivatives, we derive a set of polynomial equations whose simultaneous solution contains all critical points of the likelihood function. Using tools of algebraic geometry (the resultant of two polynomials) in the computer algebra packages (Maple), we are able to find all turning points analytically. We then employ this method on real sequence data and obtain realistic results on the primate-rodents divergence time. 相似文献
9.
10.
Sarah H. Ross Emma Spanjaard Anneke Post Marjolein J. Vliem Hendy Kristyanto Johannes L. Bos Johan de Rooij 《PloS one》2012,7(11)
We developed new image analysis tools to analyse quantitatively the extracellular-matrix-dependent cell spreading process imaged by live-cell epifluorescence microscopy. Using these tools, we investigated cell spreading induced by activation of the small GTPase, Rap1. After replating and initial adhesion, unstimulated cells exhibited extensive protrusion and retraction as their spread area increased, and displayed an angular shape that was remodelled over time. In contrast, activation of endogenous Rap1, via 007-mediated stimulation of Epac1, induced protrusion along the entire cell periphery, resulting in a rounder spread surface, an accelerated spreading rate and an increased spread area compared to control cells. Whereas basal, anisotropic, spreading was completely dependent on Src activity, Rap1-induced spreading was refractory to Src inhibition. Under Src inhibited conditions, the characteristic Src-induced tyrosine phosphorylations of FAK and paxillin did not occur, but Rap1 could induce the formation of actomyosin-connected adhesions, which contained vinculin at levels comparable to that found in unperturbed focal adhesions. From these results, we conclude that Rap1 can induce cell adhesion and stimulate an accelerated rate of cell spreading through mechanisms that bypass the canonical FAK-Src-Paxillin signalling cascade. 相似文献