Publication

Computational pipeline to probe NaV1.7 gain-of-function variants in neuropathic painful syndromes

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Microsimulation framework for urban price-taker markets

Bilal Farooq

In the context of integrated transportation and other urban engineering infrastructure systems, there are many examples of markets, where consumers exhibit price-taking behaviour. While this behaviour is ubiquitous, the underlying mechanism can be captured ...

2012

Extraction of network topology from multi-electrode recordings: is there a small-world effect?

Wulfram Gerstner, Joao Emanuel Felipe Gerhard

The simultaneous recording of the activity of many neurons poses challenges for multivariate data analysis. Here, we propose a general scheme of reconstruction of the functional network from spike train recordings. Effective, causal interactions are estima ...

Frontiers Research Foundation2011

Beyond Graphs: A New Synthesis

Dario Floreano, Claudio Mattiussi, Daniel Marbach, Peter Dürr

Artiﬁcial neural networks, electronic circuits, and gene networks are some examples of systems that can be modeled as networks, that is, as collections of interconnected nodes. In this paper we introduce the concept of terminal graph (t-graph for short), w ...

2011

Microsimulation Framework for Urban Price-Taker Markets

Bilal Farooq

2011

Microsimulation Framework for Urban Price-Taker Markets

Bilal Farooq

2011

MARGIN: Maximal frequent subgraph mining

Ramachandra Satyanarayana Valluri

The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs providing ample scope for pruning. MARGIN is a maximal su ...

2010

Early consensus in complex networks under variable graph topology

Martin Hasler, Leonidas Georgopoulos

Analysis of the linear algorithm for consensus on complex networks shows the existence of two distinct phases, the asymptotic and the transient. The network reaches the asymptotic when the components corresponding to the spectral gap eigenvalue of the weig ...

IEEE2009

Wavelets on Graphs via Spectral Graph Theory

Pierre Vandergheynst, Rémi Gribonval

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite graph. We define a notion of scaling using the graph analogue of the Fourier domain, namely the space of eigenfunctions forming the sp ...

2008

Structure and function of the nicotinic acetylcholine receptor

Jörg Grandl

The subject of this thesis is the study of the structure and function of the human muscle nicotinic acetylcholine receptor (nAChR), which is a typical member of the large class of ligand-gated ion channels. Appropriate techniques, like site-directed mutage ...

EPFL2005

Suboptimal colorings and solution of large chromatic scheduling problems

Ivo Blöchliger

Graph Coloring is a very active field of research in graph theory as well as in the domain of the design of efficient heuristics to solve problems which, due to their computational complexity, cannot be solved exactly (no guarantee that an optimal solution ...

EPFL2005