The Experts below are selected from a list of 245067 Experts worldwide ranked by ideXlab platform

Magalie Lecourtois - One of the best experts on this subject based on the ideXlab platform.

  • A Connected Network of Interacting Proteins Is Involved in Human-Tau Toxicity in Drosophila
    Frontiers in Neuroscience, 2020
    Co-Authors: Sébastien Feuillette, Camille Charbonnier, Thierry Frebourg, Dominique Campion, Magalie Lecourtois
    Abstract:

    Tauopathies are neurodegenerative diseases characterized by the presence of aggregates of abnormally phosphorylated Tau. Deciphering the pathophysiological mechanisms that lead from the alteration of Tau biology to neuronal death depends on the identification of Tau cellular partners. Combining genetic and transcriptomic analyses in Drosophila, we identified 77 new modulators of human Tau-induced toxicity, bringing to 301 the number of Tau genetic interactors identified so far in flies. Network analysis showed that 229 of these genetic modulators constitute a Connected Network. The addition of 77 new genes strengthened the Network structure, increased the intergenic connectivity and brought up key hubs with high connectivities, namely Src64B/FYN, Src42A/FRK, kuz/ADAM10, heph/PTBP1, scrib/SCRIB, and Cam/CALM3. Interestingly, we established for the first time a genetic link between Tau-induced toxicity and ADAM10, a recognized Alzheimer Disease protective factor. In addition, our data support the importance of the presynaptic compartment in mediating Tau toxicity.

Sébastien Feuillette - One of the best experts on this subject based on the ideXlab platform.

  • A Connected Network of Interacting Proteins Is Involved in Human-Tau Toxicity in Drosophila
    Frontiers in Neuroscience, 2020
    Co-Authors: Sébastien Feuillette, Camille Charbonnier, Thierry Frebourg, Dominique Campion, Magalie Lecourtois
    Abstract:

    Tauopathies are neurodegenerative diseases characterized by the presence of aggregates of abnormally phosphorylated Tau. Deciphering the pathophysiological mechanisms that lead from the alteration of Tau biology to neuronal death depends on the identification of Tau cellular partners. Combining genetic and transcriptomic analyses in Drosophila, we identified 77 new modulators of human Tau-induced toxicity, bringing to 301 the number of Tau genetic interactors identified so far in flies. Network analysis showed that 229 of these genetic modulators constitute a Connected Network. The addition of 77 new genes strengthened the Network structure, increased the intergenic connectivity and brought up key hubs with high connectivities, namely Src64B/FYN, Src42A/FRK, kuz/ADAM10, heph/PTBP1, scrib/SCRIB, and Cam/CALM3. Interestingly, we established for the first time a genetic link between Tau-induced toxicity and ADAM10, a recognized Alzheimer Disease protective factor. In addition, our data support the importance of the presynaptic compartment in mediating Tau toxicity.

Pak Ming Hui - One of the best experts on this subject based on the ideXlab platform.

  • DisConnected-Connected Network transitions and phase separation driven by co-evolving dynamics
    EPL (Europhysics Letters), 2009
    Co-Authors: Oliver Gräser, Pak Ming Hui
    Abstract:

    A general model that involves agents competing in an evolutionary game and an adaptive Networking environment is proposed and studied. Using the snowdrift game as an example, an agent may switch character or rewire the connection when the actual payoff is less than what the agent expected of its character. Depending on the value of a payoff parameter and the initial fraction of cooperators, the system shows two distinct phases: A frozen phase, in which all non-cooperative agents are expelled as isolated agents from clusters of cooperators, and a phase in which agents of different characters form a Connected Network that continues to evolve. The connectivity of agents of different characters differs significantly in both phases. A theory that treats the two characters separately is constructed. The theory captures the co-evolving dynamics driven disConnected-Connected Network transition, the phase separation, the phase diagram, and how the system evolves in time.

  • Evolutionary snowdrift game with an additional strategy in fully Connected Networks and regular lattices
    Physica A: Statistical Mechanics and its Applications, 2007
    Co-Authors: Li-xin Zhong, Dafang Zheng, Bo Zheng, Pak Ming Hui
    Abstract:

    Abstract The effects of an additional strategy or character in the evolutionary snowdrift game (SG) are studied in a well-mixed population or fully Connected Network and in a square lattice. The SG, which is a possible alternative to the prisoner's dilemma game in studying cooperative phenomena in competing populations, consists of two types of strategies, C (cooperators) and D (defectors). The additional L-strategy amounts to a strongly persuasive character that a fixed payoff is given to each player when a L-player is involved, regardless of the character of the opponent. In a fully Connected Network, it is found that either C lives with D or the L-players take over the whole population. In a square lattice, three possible situations are found: a uniform C-population, C lives with D, and the coexistence of all three characters. The presence of L-players is found to enhance cooperation in a square lattice by enhancing the payoff of cooperators. The results are discussed in terms of the effects in restricting a player to compete only with his nearest neighbors in a square lattice, as opposed to competing with all players in a fully Connected Network.

Bernard Fortz - One of the best experts on this subject based on the ideXlab platform.

  • Two-Connected Networks with Rings of Bounded Cardinality
    Computational Optimization and Applications, 2004
    Co-Authors: Bernard Fortz, Martine Labbé
    Abstract:

    We study the problem of designing at minimum cost a two-Connected Network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-Connected Networks with bounded meshes problem studied by Fortz, Labbe and Maffioli (Operations Research, vol. 48, no. 6, pp. 866–877, 2000). In this paper, we compute a lower bound on the number of edges in a feasible solution, we show that the problem is strongly NP-complete for any fixed K, and we derive a new class of facet defining inequalities. Numerical results obtained with a branch-and-cut algorithm using these inequalities show their effectiveness for solving the problem.

  • Polyhedral results for two Connected Networks with bounded rings
    Mathematical Programming, 2002
    Co-Authors: Bernard Fortz, Marylène Labbé
    Abstract:

    We study the polyhedron associated with a Network design problem which consists in determining at minimum cost a two-Connected Network such that the shortest cycle to which each edge belongs (a "ring") does not exceed a given length K. We present here a new formulation of the problem and derive facet results for different classes of valid inequalities. We study the separation problems associated to these inequalities and their integration in a Branch-and-Cut algorithm, and provide extensive computational results.

  • A tabu search heuristic for the design of two-Connected Networks with bounded rings
    2002
    Co-Authors: Bernard Fortz, Martine Labbé
    Abstract:

    We present a tabu search heuristic for a Network design problem which consists in determining at minimum cost a two-Connected Network such that the shortest cycle to which each edge belongs (a "ring") does not exceed a given length K. Numerical results are provided for randomly generated graphs and graphs coming from real-world applications.

  • Solving the Two-Connected Network with Bounded Meshes Problem
    Operations Research, 2000
    Co-Authors: Bernard Fortz, Martine Labbé, Francesco Maffioli
    Abstract:

    We study the problem of designing at minimum cost a two-Connected Network such that the shortest cycle to which each edge belongs (a "mesh") does not exceed a given lengthK. This problem arises in the design of fiber-optic-based backbone telecommunication Networks. A Branch-and-Cut approach to this problem is presented for which we introduce several families of valid inequalities and discuss the corresponding separation algorithms. Because the size of the problems solvable to optimality by this approach is too small, we also develop some heuristics. The computational performances of these exact and approximate methods are then thoroughly assessed both on randomly generated instances as well as instances suggested by real applications.

  • Two-Connected Networks with Bounded Rings: The Model
    Network Theory and Applications, 2000
    Co-Authors: Bernard Fortz
    Abstract:

    This chapter is devoted to the description of our model for designing survivable Networks. The first section explains what reasons led us to develop this new model, and gives a description of the problem in terms of Connectivity and cycle lengths. Mathematical formulations of the Two-Connected Network with Bounded Rings problem (2CNBR) are given in the second section.

Thierry Frebourg - One of the best experts on this subject based on the ideXlab platform.

  • A Connected Network of Interacting Proteins Is Involved in Human-Tau Toxicity in Drosophila
    Frontiers in Neuroscience, 2020
    Co-Authors: Sébastien Feuillette, Camille Charbonnier, Thierry Frebourg, Dominique Campion, Magalie Lecourtois
    Abstract:

    Tauopathies are neurodegenerative diseases characterized by the presence of aggregates of abnormally phosphorylated Tau. Deciphering the pathophysiological mechanisms that lead from the alteration of Tau biology to neuronal death depends on the identification of Tau cellular partners. Combining genetic and transcriptomic analyses in Drosophila, we identified 77 new modulators of human Tau-induced toxicity, bringing to 301 the number of Tau genetic interactors identified so far in flies. Network analysis showed that 229 of these genetic modulators constitute a Connected Network. The addition of 77 new genes strengthened the Network structure, increased the intergenic connectivity and brought up key hubs with high connectivities, namely Src64B/FYN, Src42A/FRK, kuz/ADAM10, heph/PTBP1, scrib/SCRIB, and Cam/CALM3. Interestingly, we established for the first time a genetic link between Tau-induced toxicity and ADAM10, a recognized Alzheimer Disease protective factor. In addition, our data support the importance of the presynaptic compartment in mediating Tau toxicity.