Results 91 to 100 of about 293,400 (267)

Optimal Sequential Partitions of Graphs [PDF]

, 1971
Brian W. Kernighan
openalex   +1 more source

A Vascularized Microphysiological System Reproducing Endochondral Ossification in Vitro to Study Ewing Sarcoma Proliferation and Migration

Advanced Functional Materials, EarlyView.
A biofabricated 3D in vitro model recapitulating endochondral ossification (ECO) is described, mimicking the steps from condensation to chondrogenesis and hypertrophy, culminating with vascularization of the hypertrophic construct. As a model proof of concept application, Ewing Sarcoma cells are seeded in the model, showing modifications in their ...
Maria Vittoria Colombo, Chiara Arrigoni, Tobias Faehling, Antonietta Verrillo, Viviana Secci, Thomas G. P. Grünewald, Giuseppe Talò, Alexandra Kummer, Jorge Gonzalez, Vincenzo De Rosa, Christian Candrian, Andrea Barbero, Florencia Cidre‐Aranaz, Matteo Moretti   +13 more
wiley   +1 more source

3D (Bio) Printing Combined Fiber Fabrication Methods for Tissue Engineering Applications: Possibilities and Limitations

Advanced Functional Materials, EarlyView.
Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana, Indra Apsite, Leonid Ionov   +2 more
wiley   +1 more source

Causal structure learning in directed, possibly cyclic, graphical models

Journal of Causal Inference
We consider the problem of learning a directed graph G⋆{G}^{\star } from observational data. We assume that the distribution that gives rise to the samples is Markov and faithful to the graph G⋆{G}^{\star } and that there are no unobserved variables.
Semnani Pardis, Robeva Elina
doaj   +1 more source

Trees with Certain Locating-chromatic Number

Journal of Mathematical and Fundamental Sciences, 2016
The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun   +2 more
doaj   +1 more source

Matrix Tropism Influences Endometriotic Cell Attachment Patterns

Advanced Functional Materials, EarlyView.
The influence of substrate stiffness and multicellular coculture on endometriotic cell attachment to extracellular matrix‐laden microarrayed islands is reported. This model investigates early endometriotic cell attachment, aiming to capture “lesion initiation events”.
Hannah S. Theriault, Hannah R.C. Kimmel, Alison C. Nunes, Allison L. Paxhia, Sarah Hashim, Kathryn B.H. Clancy, Gregory H. Underhill, Brendan A.C. Harley   +7 more
wiley   +1 more source

Some formulas that enumerate certain partitions and graphs [PDF]

, 1976
Roger Grimson
openalex   +1 more source

Machine Learning‐Enabled Polymer Discovery for Enhanced Pulmonary siRNA Delivery

Advanced Functional Materials, EarlyView.
This study provides an efficient approach to train a machine learning model by merging heterogeneous literature data to predict suitable polymers for siRNA delivery. Without the need for extensive laboratory synthesis, the machine learning enabled a virtual screening and successfully predicted a polymer that is validated for effective gene silencing in
Felix Sieber‐Schäfer, Min Jiang, Adrian Kromer, Anny Nguyen, Müge Molbay, Simone Pinto Carneiro, David Jürgens, Gerald Burgstaller, Bastian Popper, Benjamin Winkeljann, Olivia Monika Merkel   +10 more
wiley   +1 more source

Paired coalition in graphs

AKCE International Journal of Graphs and Combinatorics
A paired coalition in a graph [Formula: see text] consists of two disjoint sets of vertices [Formula: see text] and [Formula: see text], neither of which is a paired dominating set but whose union [Formula: see text] is a paired dominating set.
Mohammad Reza Samadzadeh, Doost Ali Mojdeh, Reza Nadimi   +2 more
doaj   +1 more source

On the parameterized complexity of computing tree-partitions [PDF]

Discrete Mathematics & Theoretical Computer Science
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender, Carla Groenland, Hugo Jacob   +2 more
doaj   +1 more source