Jack D. Griffith

Bio: Jack D. Griffith is an academic researcher from University of North Carolina at Chapel Hill. The author has contributed to research in topics: DNA & DNA replication. The author has an hindex of 77, co-authored 262 publications receiving 21083 citations. Previous affiliations of Jack D. Griffith include University of Cambridge & University of Colorado Boulder.

T-loop assembly in vitro involves binding of TRF2 near the 3' telomeric overhang.

Abstract: Mammalian telomeres contain a duplex TTAGGG-repeat tract terminating in a 3′ single-stranded overhang. TRF2 protein has been implicated in remodeling telomeres into duplex lariats, termed t-loops, in vitro and t-loops have been isolated from cells in vivo. To examine the features of the telomeric DNA essential for TRF2-promoted looping, model templates containing a 500 bp double-stranded TTAGGG tract and ending in different single-stranded overhangs were constructed. As assayed by electron microscopy, looped molecules containing most of the telomeric tract are observed with TRF2 at the loop junction. A TTAGGG-3′ overhang of at least six nucleotides is required for loop formation. Termini with 5′ overhangs, blunt ends or 3′ termini with non-telomeric sequences at the junction are deficient in loop formation. Addition of non-telomeric sequences to the distal portion of a 3′ overhang beginning with TTAGGG repeats only modestly diminishes looping. TRF2 preferentially localizes to the junction between the duplex repeats and the single-stranded overhang. Based on these findings we suggest a model for the mechanism by which TRF2 remodels telomeres into t-loops.

Fast parallel algorithms for short-range molecular dynamics

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。