Results 61 to 70 of about 649,217 (300)

AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]

, 2005
A combinatorial map is a connected topological graph cellularly embedded in a surface. As a linking of combinatorial configuration with the classical mathematics, it fascinates more and more mathematician’s interesting.
Linfan Mao, MAO, LINFAN
core   +1 more source

Emerging experimental and computational methods for studying redox‐regulated structural transitions

FEBS Letters, EarlyView.
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass, Dana Reichmann, Gábor Erdős   +2 more
wiley   +1 more source

Spatio-Temporal Graph Convolutional Network Incorporating Knowledge Graph Embeddings for Hydrological Time Series Prediction

IEEE Access
This paper proposes a spatio-temporal graph convolutional network incorporating knowledge graph embeddings for hydrological time series prediction. A knowledge graph is constructed to integrate the spatio-temporal features of hydrological monitoring ...
Xin Jin, Mengyuan Qin, Hao Duan
doaj   +1 more source

Weight Adaptive Multi-view Spectral Clustering Algorithm Based on Consistent Graphs [PDF]

Jisuanji gongcheng
With the popularity of mobile devices and the Internet, it has become easier to collect and share multi-view data. Multi-view data can describe data from multiple views more accurately.
Lijuan WANG, Jinping XING, Ming YIN, Zhifeng HAO, Ruichu CAI, Wen WEN
doaj   +1 more source

Embedding graphs in surfaces

Journal of Combinatorial Theory, Series B, 1984
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are used to prove the folk theorem that any surface embedding of a graph is combinatorial. A basic technical lemma for this proof (a version of what it means to apply scissors to an embedded graph) is then used to give a rigourous definition of the ...
Peter Hoffman, R. Bruce Richter
openaire   +3 more sources

Multilevel graph embedding

Numerical Linear Algebra with Applications, 2020
AbstractThe goal of the present paper is the design of embeddings of a general sparse graph into a set of points in for appropriated ≥ 2. The embeddings that we are looking at aim to keep vertices that are grouped in communities together and keep the rest apart. To achieve this property, we utilize coarsening that respects possible community structures
Benjamin Quiring, Panayot S. Vassilevski
openaire   +3 more sources

Equivalent birational embeddings.

, 2009
Let X be a projective variety of dimension r. We want to understand when two birational embeddings of the same variety are equivalent up to a Cremona transformation of the projective space, in this case we say that they are Cremona equivalent.
MELLA, Massimiliano, Polastri, Elena
core   +1 more source

Translophagy—A potential link between autophagy impairment and translational errors

FEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk, Gailing Ma, Robin Antrobus, Diego Manni, Marco Trevisan‐Herraz, Mustafa Khwaja, Max Brown, Gavin D. Richardson, Masaaki Komatsu, Daniel Erskine, Viktor I. Korolchuk, Tetsushi Kataura   +11 more
wiley   +1 more source

Prospecting the protein design landscape

FEBS Letters, EarlyView.
This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona, Katharina T. Stonig, Jens Meiler, Clara T. Schoeder, Monica L. Fernández‐Quintero   +4 more
wiley   +1 more source

An SPQR-tree-like embedding representation for level planarity

Journal of Computational Geometry, 2023
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a  connected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which seek a planar embedding of a graph subject to some given set
Guido Brückner, Ignaz Rutter
doaj   +1 more source