Searching the coding region for microRNA targets

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Toward a mechanistic understanding of variable chromatin modules

Gerard Llimos Aubach

Our genome is a long sequence of DNA that contains all the information to be able to constitute a living organism like us, similarly to what the letters in a book do to create a story. This sequence, which is a stretch of molecules called nucleotides, is a ...

EPFL2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Adam Teodor Polak

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Circadian dynamics of RNA localisation in the mammalian liver

Clémence Yumie Syloun Hurni

Gene expression in eukaryotes is a complex multi-step process. It starts in the nucleus with transcription, the synthesis of a mRNA copy from a DNA template. While in the nucleus, the RNA transcript is subject to multiple co- and post-transcriptional modif ...

EPFL2021

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

ASSOC COMPUTING MACHINERY2021

Forward-reflected-backward method with variance reduction

Volkan Cevher, Ahmet Alacaoglu

We propose a variance reduced algorithm for solving monotone variational inequalities. Without assuming strong monotonicity, cocoercivity, or boundedness of the domain, we prove almost sure convergence of the iterates generated by the algorithm to a soluti ...

2021

Yapa: Accelerated Proximal Algorithm For Convex Composite Problems

Giovanni Chierchia, Mireille El Gheche

Proximal splitting methods are standard tools for nonsmooth optimization. While primal-dual methods have become very popular in the last decade for their flexibility, primal methods may still be preferred for two reasons: acceleration schemes are more effe ...

IEEE2021

Enteric infection induces Lark-mediated intron retention at the 5 ' end of Drosophila genes

Michael Vincent Frochaux, Bart Deplancke, Dani Osman, Maroun Bou Sleiman, Tommaso Andreani

Background RNA splicing is a key post-transcriptional mechanism that generates protein diversity and contributes to the fine-tuning of gene expression, which may facilitate adaptation to environmental challenges. Here, we employ a systems approach to study ...

2020

Robust landscapes of ribosome dwell times and aminoacyl-tRNAs in response to nutrient stress in liver

Felix Naef, Cédric Gobet, Frédéric Bruno Martin Gachon, Benjamin Dieter Weger, Nagammal Neelagandan

Translation depends on messenger RNA (mRNA)-specific initiation, elongation, and termination rates. While translation elongation is well studied in bacteria and yeast, less is known in higher eukaryotes. Here we combined ribosome and transfer RNA (tRNA) pr ...

National Academy of Sciences2020

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Page 2 sur 2