Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Bishal Basak"'
Publikováno v:
Biology Open, Vol 10, Iss 3 (2021)
During phospholipase C-β (PLC-β) signalling in Drosophila photoreceptors, the phosphatidylinositol transfer protein (PITP) RDGB, is required for lipid transfer at endoplasmic reticulum (ER)–plasma membrane (PM) contact sites (MCS). Depletion of R
Externí odkaz:
https://doaj.org/article/b050e5c6951645969f7169fc163edeba
Autor:
Deepti Trivedi, Vinitha CM, Karishma Bisht, Vishnu Janardan, Awadhesh Pandit, Bishal Basak, Shwetha H, Navyashree Ramesh, Padinjat Raghu
Publikováno v:
eLife, Vol 9 (2020)
Phosphoinositides (PI) are key regulators of cellular organization in eukaryotes and genes that tune PI signaling are implicated in human disease mechanisms. Biochemical analyses and studies in cultured cells have identified a large number of protein
Externí odkaz:
https://doaj.org/article/55d03f35196145a298b499fab390966c
Autor:
Rajan Thakur, Aniruddha Panda, Elise Coessens, Nikita Raj, Shweta Yadav, Sruthi Balakrishnan, Qifeng Zhang, Plamen Georgiev, Bishal Basak, Renu Pasricha, Michael JO Wakelam, Nicholas T Ktistakis, Padinjat Raghu
Publikováno v:
eLife, Vol 5 (2016)
During illumination, the light-sensitive plasma membrane (rhabdomere) of Drosophila photoreceptors undergoes turnover with consequent changes in size and composition. However, the mechanism by which illumination is coupled to rhabdomere turnover rema
Externí odkaz:
https://doaj.org/article/a48dd85c78a4448c856450bd969c1c28
A graph $G=(V,E)$ is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $u$ of $T$ corresponds to a vertex $u \in V$ and there is an edge
Externí odkaz:
http://arxiv.org/abs/2205.04225
Publikováno v:
The Computer Journal. 66:1256-1267
A graph $G = (V,E)$ is called a pairwise compatibility graph (PCG) if it admits a tuple $(T, d_{min},d_{max})$ of an edge-weighted tree $T$ of non-negative edge weights with leaf set $L$, two non-negative real numbers $d_{min} \leq d_{max}$ such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31093141a8d3f11974fdab217bdf8222
https://doi.org/10.1093/comjnl/bxac011
https://doi.org/10.1093/comjnl/bxac011
Lipid transfer proteins (LTPs) that shuttle lipids at membrane contact sites (MCS) play an important role in maintaining cellular homeostasis. One such important LTP is the Retinal Degeneration B (RDGB) protein. RDGB is localized at the MCS formed be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2535625d1bd4567058370ce9ea789422
Publikováno v:
Computer Journal; May2023, Vol. 66 Issue 5, p1256-1267, 12p
A graph $G=(V,E)$ is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $u$ of $T$ corresponds to a vertex $u \in V$ and there is an edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::322a77ef9b5c274bda917d373e488f3a
Publikováno v:
2021 IEEE International Conference on Telecommunications and Photonics (ICTP).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba6200e7a1f19da50503351d011d98b0
https://doi.org/10.1109/ictp53732.2021.9744182
https://doi.org/10.1109/ictp53732.2021.9744182
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.