Results 101 to 110 of about 1,312,414 (329)

From the Crossing Numbers of K₅ + P_n and K₅ + C_n to the Crossing Numbers of W_m + S_n and W_m + W_n

Axioms
The crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs,
Michal Staš, Jana Fortes, Mária Švecová   +2 more
doaj   +1 more source

Projective Cross-ratio on Hypercomplex Numbers [PDF]

Advances in Applied Clifford Algebras, 2012
The paper presents a new cross-ratio of hypercomplex numbers based on projective geometry. We discuss the essential properties of the projective cross-ratio, notably its invariance under Mobius transformations. Applications to the geometry of conic sections and Mobius-invariant metrics on the upper half-plane are also given.
openaire   +2 more sources

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

FEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang, Satoshi Hashimoto, Sota Ito, Chisato Kikuguchi, Miho Hoshi, Kiyoshi Yamaguchi, Yoichi Furukawa, Toru Suzuki, Toshifumi Inada   +8 more
wiley   +1 more source

Nonplanarity of Iterated Line Graphs

Journal of Mathematics, 2020
The 1-crossing index of a graph G is the smallest integer k such that the kth iterated line graph of G has crossing number greater than 1. In this paper, we show that the 1-crossing index of a graph is either infinite or it is at most 5.
Jing Wang
doaj   +1 more source

The rectilinear local crossing number of $K_n$

, 2017
We determine ${\bar{\rm{lcr}}}(K_n)$, the rectilinear local crossing number of the complete graph $K_n$ for every $n$. More precisely, for every $n \notin \{8, 14 \}, $ \[ {\bar{\rm{lcr}}}(K_n)=\left\lceil \frac{1}{2} \left( n-3-\left\lceil \frac{n-3}{3}
Fernández-Merchant, Silvia, Ábrego, Bernardo M.   +1 more
core  

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

FEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe, Tanmay Kumar Mohanty, Rashna Bhandari, Dorothea Fiedler   +3 more
wiley   +1 more source

The role of histone modifications in transcription regulation upon DNA damage

FEBS Letters, EarlyView.
This review discusses the critical role of histone modifications in regulating gene expression during the DNA damage response (DDR). By modulating chromatin structure and recruiting repair factors, these post‐translational modifications fine‐tune transcriptional programmes to maintain genomic stability.
Angelina Job Kolady, Siyao Wang
wiley   +1 more source

Function‐driven design of a surrogate interleukin‐2 receptor ligand

FEBS Letters, EarlyView.
Interleukin (IL)‐2 signaling can be achieved and precisely fine‐tuned through the affinity, distance, and orientation of the heterodimeric receptors with their ligands. We designed a biased IL‐2 surrogate ligand that selectively promotes effector T and natural killer cell activation and differentiation. Interleukin (IL) receptors play a pivotal role in
Ziwei Tang, Zelin Cheng, Teng Li, Fulian Wang, Liangminghui Zhang, Xiuxiu He, Lili Liu, Wei Wang, Aibin Liang, Guang Yang   +9 more
wiley   +1 more source

Marking Algorithms in Permutation Tableaux and Transformations on Linked Partitions

Mathematics
In this paper, we focus on the internal structural characteristics of permutation tableaux and their correspondence with linked partitions. We begin by introducing new statistics for permutation tableaux, designed to thoroughly describe various ...
Carol Jian Wang, Meryl Nan Wang
doaj   +1 more source

Various heuristic algorithms to minimise the two-page crossing numbers of graphs

Open Computer Science, 2015
We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei, Sălăgean Ana, Mäkinen Erkki, Vrt’o Imrich   +3 more
doaj   +1 more source