Results 71 to 80 of about 2,510,319 (291)

Modelling stem cell differentiation related processes—A practical overview for biologists

FEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar, Xinqi Yan, Lucas F. Jansen Klomp, Stefano Schivo, Janine N. Post   +4 more
wiley   +1 more source

Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences

Algorithms, 2013
The stable matching problem (also known as the stable marriage problem) is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other.
Maria Silvia Pini, Francesca Rossi, K. Brent Venable, Toby Walsh   +3 more
doaj   +1 more source

Design and analysis strategies for robust microbiome ageing research

FEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik, İsmail Güderer, Yi Wang, Tayyaba Alvi, Prasoon Pandey, Handan Melike Dönertaş   +5 more
wiley   +1 more source

e-Fuel: An EV-Friendly Urgent Electrical Charge-Sharing Model with Preference-Based Off-Grid Services

World Electric Vehicle Journal
Electric-powered vehicles (EVs) allow for an environmentally friendly and economic alternative to fuel-running ones. However, such an alternative is expected to impose further usage hikes and periods of instability on cities’ power systems.
Ahmad Nahar Quttoum, Mohammed N. AlJarrah, Fawaz A. Khasawneh, Mohammad Bany Taha   +3 more
doaj   +1 more source

Byzantine Stable Matching

Proceedings of the ACM Symposium on Principles of Distributed Computing
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who they want to be matched with. Moreover a matching is said to be stable if no pair of agents prefer each other over their current matching. We consider solving stable matching
Andrei Constantinescu 0001, Marc Dufay, Diana Ghinea, Roger Wattenhofer   +3 more
openaire   +4 more sources

Reconstructing enzyme evolution by protein engineering

FEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler, Markus R. Busch, Reinhard Sterner   +2 more
wiley   +1 more source

UAV Network Channel Allocation Method Based on Bipartite Graph Popular Matching Algorithm

IEEE Access
To address the challenges of selecting task schemes and ensuring secure channels duringdata collection and transmission by unmanned aerial vehicles, the study divides the secure transmission model into physical domain and social domain based on graph ...
Weihan Li, Jianwei Guo
doaj   +1 more source

Identification of a Shiga toxin A‐derived peptide internalized into Gb3 receptor‐bearing cells via interaction with the Shiga toxin B subunit

FEBS Letters, EarlyView.
The process of internalization of the Shiga toxin A subunit via formation of a complex with the Shiga toxin B subunit, which specifically binds to the Gb3 receptor. The peptide is designed to act as a carrier of drugs into cancer cells. Here, we explored the potential of peptides derived from the catalytic A subunit of Shiga toxin (STxA) to be drug ...
Giulia Opassi, João C. Encarnação, Valeria Napolitano, Grzegorz Dubin, Grzegorz Popowicz, Karl Andersson, U. Helena Danielson   +6 more
wiley   +1 more source

Stability and Nash implementation in matching markets with couples [PDF]

We consider two-sided matching markets with couples. First, we extend a result by Klaus and Klijn (2005, Theorem 3.3) and show that for any weakly responsive couples market there always exists a "double stable" matching, i.e., a matching that is stable ...
Claus-Jochen Haake, Bettina Klaus
core   +2 more sources

The Distortion of Stable Matching

CoRR
We initiate the study of distortion in stable matching. Concretely, we aim to design algorithms that have limited access to the agents' cardinal preferences and compute stable matchings of high quality with respect to some aggregate objective, e.g., the social welfare.
Aris Filos-Ratsikas, Georgios Kalantzis 0002   +1 more
openaire   +2 more sources