Zobrazeno 1 - 10
of 24
pro vyhledávání: '"network based biocomputation"'
Improved longevity of actomyosin in vitro motility assays for sustainable lab-on-a-chip applications
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-15 (2024)
Abstract In the in vitro motility assay (IVMA), actin filaments are observed while propelled by surface-adsorbed myosin motor fragments such as heavy meromyosin (HMM). In addition to fundamental studies, the IVMA is the basis for a range of lab-on-a-
Externí odkaz:
https://doaj.org/article/fe341cff723b492aac0481db0bd3cf01
Autor:
Zhu, Jingyuan, Salhotra, Aseem, Meinecke, Christoph Robert, Surendiran, Pradheebha, Lyttleton, Roman, Reuter, Danny, Kugler, Hillel, Diez, Stefan, Månsson, Alf, Linke, Heiner, Korten, Till
The 3-satisfiability Problem (3-SAT) is a demanding combinatorial problem that is of central importance among the nondeterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence, and logistics. Even wi
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A89147
https://tud.qucosa.de/api/qucosa%3A89147/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A89147/attachment/ATT-0/
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Jingyuan Zhu, Aseem Salhotra, Christoph Robert Meinecke, Pradheebha Surendiran, Roman Lyttleton, Danny Reuter, Hillel Kugler, Stefan Diez, Alf Månsson, Heiner Linke, Till Korten
Publikováno v:
Advanced Intelligent Systems, Vol 4, Iss 12, Pp n/a-n/a (2022)
The 3‐satisfiability Problem (3‐SAT) is a demanding combinatorial problem that is of central importance among the nondeterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence, and logistics. Eve
Externí odkaz:
https://doaj.org/article/b6ef298c7c3a4354be2768b55cfedbea
Publikováno v:
New Journal of Physics, Vol 23, Iss 8, p 085004 (2021)
Exact cover is a non-deterministic polynomial time (NP)—complete problem that is central to optimization challenges such as airline fleet planning and allocation of cloud computing resources. Solving exact cover requires the exploration of a soluti
Externí odkaz:
https://doaj.org/article/f17d1c4e9c1441618fbbaa0dbdba4ae1
Autor:
Jingyuan Zhu, Till Korten, Hillel Kugler, Falco van Delft, Alf Månsson, Danny Reuter, Stefan Diez, Heiner Linke
Publikováno v:
New Journal of Physics, Vol 23, Iss 10, p 105004 (2021)
The high energy consumption of electronic data processors, together with physical challenges limiting their further improvement, has triggered intensive interest in alternative computation paradigms. Here we focus on network-based biocomputation (NBC
Externí odkaz:
https://doaj.org/article/07cba2e29ec3467db4f74b4d0fc53b1d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Verification, Model Checking, and Abstract Interpretation
Network-Based Biocomputation Circuits (NBCs) offer a new paradigm for solving complex computational problems by utilizing biological agents that operate in parallel to explore manufactured planar devices. The approach can also have future application
Autor:
Christoph R. Meinecke, Georg Heldt, Thomas Blaudeck, Frida W. Lindberg, Falco C. M. J. M. van Delft, Mohammad Ashikur Rahman, Aseem Salhotra, Alf Månsson, Heiner Linke, Till Korten, Stefan Diez, Danny Reuter, Stefan E. Schulz
Publikováno v:
Materials
Volume 16
Issue 3
Pages: 1046
Volume 16
Issue 3
Pages: 1046
Network-based biocomputation (NBC) relies on accurate guiding of biological agents through nanofabricated channels produced by lithographic patterning techniques. Here, we report on the large-scale, wafer-level fabrication of optimized microfluidic c
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.