A5090572145- Advanced biosensing and bioanalysis techniques
- DNA and Nucleic Acid Chemistry
- DNA and Biological Computing
- Modular Robots and Swarm Intelligence
- graph theory and CDMA systems
- Advanced Computing and Algorithms
- Advanced Graph Theory Research
- Immune Cell Function and Interaction
- T-cell and B-cell Immunology
- Click Chemistry and Applications
- Single-cell and spatial transcriptomics
- Bacteriophages and microbial interactions
- Luminescence and Fluorescent Materials
- Cooperative Communication and Network Coding
- Molecular Sensors and Ion Detection
- Cellular Automata and Applications
- 3D Printing in Biomedical Research
- Neural and Behavioral Psychology Studies
- Heart Rate Variability and Autonomic Control
- SARS-CoV-2 detection and testing
- Molecular Junctions and Nanostructures
- EEG and Brain-Computer Interfaces
- RNA Interference and Gene Delivery
- Biosensors and Analytical Detection
Massachusetts Institute of Technology
2018-2024
California Institute of Technology
2017-2018
Abstract Biochemical circuits made of rationally designed DNA molecules are proofs concept for embedding control within complex molecular environments. They hold promise transforming the current technologies in chemistry, biology, medicine and material science by introducing programmable responsive behaviour to diverse systems. As transformative power a technology depends on its accessibility, two main challenges an automated design process simple experimental procedures. Here we demonstrate...
As an engineering material, DNA is well suited for the construction of biochemical circuits and systems, because it simple enough that its interactions can be rationally designed using Watson–Crick base pairing rules, yet design space remarkably rich. When designing this simplicity permits functional sections each strand, called domains, without considering particular nucleotide sequences. However, actual sequences used may have not predicted at domain-level abstraction, new rigorous...
It has been observed that the performing for high stakes can, paradoxically, lead to uncharacteristically poor performance. Here we investigate a novel approach attenuating such 'choking under pressure' by instructing participants demanding motor task rewards successful performance with monetary gain, reappraise this incentive as loss unsuccessful We show when applied simple strategy, choking was significantly reduced. This strategy also influenced participants' neural and physiological...
A mapping
Abstract Motivation The study of T cell receptor (TCR) repertoires has generated new insights into immune system recognition. However, the ability to robustly characterize these populations been limited by technical barriers and an inability reliably infer heterodimeric chain pairings for TCRs. Results Here, we describe a novel analytical approach emerging repertoire sequencing method, improving resolving power this low-cost technology. This method relies upon distribution population across...
ABSTRACT DNA is an ultra-high-density storage medium that could meet exponentially growing worldwide demand for archival data if synthesis costs declined sufficiently and random access of files within exabyte-to-yottabyte-scale pools were feasible. To overcome the second barrier, here we encapsulate data-encoding file sequences impervious silica capsules are surface-labeled with single-stranded barcodes. Barcodes chosen to represent metadata, enabling efficient direct selection sets Boolean...
ABSTRACT The surge in nucleic acid analytics requires scalable storage and retrieval systems akin to electronic databases used organize digital data. Such a system could transform disease diagnosis, ecological preservation, molecular surveillance of biothreats. Current use individual containers for samples, requiring single-sample that falls short compared with allow complex combinatorial data on aggregated Here, we leverage protective microcapsules DNA labeling enables arbitrary pooled...
For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products smaller graphs. When isomorphic a graph product, we call the factors this product factorization $G$. an subgraph those pseudofactorization Prior work has shown that graph's can be used generate canonical embedding smallest possible pseudofactors. However, for arbitrary weighted which represent richer variety metric spaces, methods or determining their existence remain...
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another $H$ is an isometric embedding if shortest path distance between any two vertices in equals their images $H$. Here, we consider embeddings a weighted into unweighted Hamming graphs, called embeddings, when satisfies property that every edge its endpoints. Using Cartesian product decomposition pseudofactorization, show may be partitioned for each irreducible pseudofactor $G$, which call canonical partition. This...