Results 81 to 90 of about 10,268,798 (293)
Maximum independent sets of commuting and noninterfering inversions [PDF]
BMC Bioinformatics, 2009 AbstractBackgroundGiven three signed permutations, an inversion median is a fourth permutation that minimizes the sum of the pairwise inversion distances between it and the three others. This problem is NP-hard as well as hard to approximate. Yet median-based approaches to phylogenetic reconstruction have been shown to be among the most accurate ...
Krister M. Swenson +3 more
openaire +4 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Computational Aspects of Carbon and Boron Nanotubes
Molecules, 2010 Carbon hexagonal nanotubes, boron triangular nanotubes and boron a-nanotubes are a few popular nano structures. Computational researchers look at these structures as graphs where each atom is a node and an atomic bond is an edge.
Paul Manuel
doaj +1 more source
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 +4 more
wiley +1 more source
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core
Faster approximation for maximum independent set on unit disk graph
, 2017 Maximum independent set from a given set D of unit disks intersecting a horizontal line can be solved in O(n2) time and O(n2) space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph ...
Sasanka Roy +5 more
core +1 more source
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 +2 more
wiley +1 more source
Applied SciencesLarge Language Models (LLMs) have shown a strong performance across various tasks but still face challenges in automatic text summarization. While they are effective in capturing semantic patterns from large corpora, they typically lack mechanisms for ...
Cengiz Hark
doaj +1 more source
On Independent [1, 2]-sets in Hypercubes [PDF]
ITM Web of ConferencesGiven a simple graph G, a subset S ⊆ V(G) is an independent [1, 2]-set if no two vertices in S are adjacent and for every vertex υ ϵ V(G)\S, 1 ≤ |N(υ) ∩ S | ≤ 2, that is, every vertex υ ϵ V(G)\S is adjacent to at least one but not more than two vertices ...
Santoso Eko Budi +2 more
doaj +1 more source
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 +6 more
wiley +1 more source