4,941 research outputs found

    An information-bearing seed for nucleating algorithmic self-assembly

    Get PDF
    Self-assembly creates natural mineral, chemical, and biological structures of great complexity. Often, the same starting materials have the potential to form an infinite variety of distinct structures; information in a seed molecule can determine which form is grown as well as where and when. These phenomena can be exploited to program the growth of complex supramolecular structures, as demonstrated by the algorithmic self-assembly of DNA tiles. However, the lack of effective seeds has limited the reliability and yield of algorithmic crystals. Here, we present a programmable DNA origami seed that can display up to 32 distinct binding sites and demonstrate the use of seeds to nucleate three types of algorithmic crystals. In the simplest case, the starting materials are a set of tiles that can form crystalline ribbons of any width; the seed directs assembly of a chosen width with >90% yield. Increased structural diversity is obtained by using tiles that copy a binary string from layer to layer; the seed specifies the initial string and triggers growth under near-optimal conditions where the bit copying error rate is 17 kb of sequence information. In sum, this work demonstrates how DNA origami seeds enable the easy, high-yield, low-error-rate growth of algorithmic crystals as a route toward programmable bottom-up fabrication

    Psychosocial Predictors of Metabolic Syndrome among Latino Groups in the Multi-Ethnic Study of Atherosclerosis (MESA).

    Get PDF
    ObjectiveWe sought to determine the contribution of psychological variables to risk for metabolic syndrome (MetS) among Latinos enrolled in the Multi-Ethnic Study of Atherosclerosis (MESA), and to investigate whether social support moderates these associations, and whether inflammatory markers mediate the association between psychological variables and MetS.Research design and methodsCross-sectional analyses at study baseline were conducted with a national Latino cohort (n = 1,388) that included Mexican Americans, Dominican Americans, Puerto Rican Americans and Central/South Americans. Hierarchical logistic regression analyses were conducted to test the effects of psychosocial variables (chronic stress, depressive symptoms, and social support) on MetS. In addition, separate subgroup-specific models, controlling for nationality, age, gender, socioeconomic position, language spoken at home, exercise, smoking and drinking status, and testing for the effects of chronic stress, depressive symptoms and inflammation (IL-6, CRP, fibrinogen) in predicting risk for MetS were conducted.ResultsIn the overall sample, high chronic stress independently predicted risk for MetS, however this association was found to be significant only in Mexican Americans and Puerto Rican Americans. Social support did not moderate the associations between chronic stress and MetS for any group. Chronic stress was not associated with inflammatory markers in either the overall sample or in each group.ConclusionsOur results suggest a differential contribution of chronic stress to the prevalence of MetS by national groups

    Binary pattern tile set synthesis is NP-hard

    Full text link
    In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The kk-PATS problem is that of designing a tile assembly system with the smallest number of tile types which will self-assemble an input pattern of kk colors. Of both theoretical and practical significance, kk-PATS has been studied in a series of papers which have shown kk-PATS to be NP-hard for k=60k = 60, k=29k = 29, and then k=11k = 11. In this paper, we close the fundamental conjecture that 2-PATS is NP-hard, concluding this line of study. While most of our proof relies on standard mathematical proof techniques, one crucial lemma makes use of a computer-assisted proof, which is a relatively novel but increasingly utilized paradigm for deriving proofs for complex mathematical problems. This tool is especially powerful for attacking combinatorial problems, as exemplified by the proof of the four color theorem by Appel and Haken (simplified later by Robertson, Sanders, Seymour, and Thomas) or the recent important advance on the Erd\H{o}s discrepancy problem by Konev and Lisitsa using computer programs. We utilize a massively parallel algorithm and thus turn an otherwise intractable portion of our proof into a program which requires approximately a year of computation time, bringing the use of computer-assisted proofs to a new scale. We fully detail the algorithm employed by our code, and make the code freely available online
    corecore