Abeer Eshra
Menoufia University
10 Papers
3 Citations
Abeer Eshra is an academic researcher from Menoufia University. The author has contributed to research in topics: Logic gate & Sequential logic. The author has an hindex of 6, co-authored 9 publications. Previous affiliations of Abeer Eshra include Duke University.
Chat about Author
Papers
Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase.
TL;DR: A new DNA logic circuits architecture based on single-stranded logic gates and strand-displacing DNA polymerase requires less computation time and fewer DNA strands.
194
Programming DNA-Based Biomolecular Reaction Networks on Cancer Cell Membranes
Tianqi Song,Shalin Shah,Hieu Bui,Sudhanshu Garg,Abeer Eshra,Abeer Eshra,Daniel Fu,Ming Yang,Reem Mokhtar,John H. Reif +9 more
TL;DR: Compared to prior work of DNA circuits for evaluating cell membrane receptors, the DNA circuits by the architecture introduced have several major advantages including simpler design, lower leak, lower cost, and higher signal-to-background ratio.
62
Improving the Performance of DNA Strand Displacement Circuits by Shadow Cancellation.
Tianqi Song,Nikhil Gopalkrishnan,Abeer Eshra,Abeer Eshra,Sudhanshu Garg,Reem Mokhtar,Hieu Bui,Harish Chandran,John H. Reif +8 more
TL;DR: Shadow cancellation is presented, a general-purpose technique to mitigate leak in catalytic DNA strand displacement circuits that makes no modifications to the underlying amplifier circuit and is agnostic to its leak mechanism.
50
Renewable DNA seesaw logic circuits enabled by photoregulation of toehold-mediated strand displacement
TL;DR: This work proposes a scalable design and in silico verifications for photoregulated renewable DNA seesaw logic circuits, which after processing a given set of inputs, can be repeatedly reset to reliably process other distinct inputs.
Renewable DNA Hairpin-Based Logic Circuits
TL;DR: In this paper, a hairpin-based motif was proposed to implement a Boolean logic gate for a single-use logic circuit, which can be reused to achieve the same (or a different) computation again.
41