A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction

This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving general- ized arc-consistency according to some properties. SEQ BIN can be used for encoding counting con- straints such as CHANGE, SMOOTH or INCREAS- ING NVALUE. For some of these constraints and some of their variants GAC can be enforced with a time and space complexity linear in the sum of domain sizes, which improves or equals the best known results of the literature

Self-decomposable Global Constraints

International audienceScalability becomes more and more critical to decision support technologies. In order to address this issue in Constraint Programming, we introduce the family of self-decomposable constraints. These constraints can be satisfied by applying their own filtering algorithms on variable subsets only. We introduce a generic framework which dynamically decompose propagation, by filtering over variable subsets. Our experiments over the CUMULATIVE constraint illustrate the practical relevance of self-decomposition

La contrainte Increasing NValue

National audienceCet article introduit la contrainte Increasing NValue, qui restreint le nombre de valeurs distinctes affectées à une séquence de variables, de sorte que chaque variable de la séquence soit inférieure ou égale à la variable la succédant immédiatement. Cette contrainte est une spécialisation de la contrainte NValue, motivée par le besoin de casser des symétries. Il est bien connu que propager la contrainte NValue est un problème NP-Difficile. Nous montrons que la spécialisation au cas d'une séquence ordonnée de variables rend le problème polynomial. Nous proposons un algorithme d'arc-consistance ayant une complexité temporelle en O(sum D), où sum D est la somme des tailles des domaines. Cet algorithme est une amélioration significative, en termes de complexité, des algorithmes issus d'une représentation de la contrainte Increasing NValue à l'aide d'automates ou de la contrainte SLIDE. Nous utilisons notre contrainte dans le cadre d'un problème d'allocation de ressources

Multiple phosphorylation events control mitotic degradation of the muscle transcription factor Myf5.

BACKGROUND: The two myogenic regulatory factors Myf5 and MyoD are basic helix-loop-helix muscle transcription factors undergoing differential cell cycle dependent proteolysis in proliferating myoblasts. This regulated degradation results in the striking expression of these two factors at distinct phases of the cell cycle, and suggests that their precise and alternated disappearance is an important feature of myoblasts, maybe connected to the maintenance of the proliferative status and/or commitment to the myogenic lineage of these cells. One way to understand the biological function(s) of the cyclic expression of these proteins is to specifically alter their degradation, and to analyze the effects of their stabilization on cells. To this aim, we undertook the biochemical analysis of the mechanisms governing Myf5 mitotic degradation, using heterologous systems. RESULTS: We show here that mitotic degradation of Myf5 is conserved in non-myogenic cells, and is thus strictly under the control of the cell cycle apparatus. Using Xenopus egg extracts as an in vitro system to dissect the main steps of Myf5 mitotic proteolysis, we show that (1) Myf5 stability is regulated by a complex interplay of phosphorylation/dephosphorylation, probably involving various kinases and phosphatases, (2) Myf5 is ubiquitylated in mitotic extracts, and this is a prerequisite to its degradation by the proteasome and (3) at least in the Xenopus system, the E3 responsible for its mitotic degradation is not the APC/C (the major E3 during mitosis). CONCLUSION: Altogether, our data strongly suggest that the mitotic degradation of Myf5 by the ubiquitin-proteasome system is precisely controlled by multiple phosphorylation of the protein, and that the APC/C is not involved in this process.RIGHTS : This article is licensed under the BioMed Central licence at http://www.biomedcentral.com/about/license which is similar to the 'Creative Commons Attribution Licence'. In brief you may : copy, distribute, and display the work; make derivative works; or make commercial use of the work - under the following conditions: the original author must be given credit; for any reuse or distribution, it must be made clear to others what the license terms of this work are

La contrainte Increasing NValue

National audienceCet article introduit la contrainte Increasing NValue, qui restreint le nombre de valeurs distinctes affectées à une séquence de variables, de sorte que chaque variable de la séquence soit inférieure ou égale à la variable la succédant immédiatement. Cette contrainte est une spécialisation de la contrainte NValue, motivée par le besoin de casser des symétries. Il est bien connu que propager la contrainte NValue est un problème NP-Difficile. Nous montrons que la spécialisation au cas d'une séquence ordonnée de variables rend le problème polynomial. Nous proposons un algorithme d'arc-consistance ayant une complexité temporelle en O(sum D), où sum D est la somme des tailles des domaines. Cet algorithme est une amélioration significative, en termes de complexité, des algorithmes issus d'une représentation de la contrainte Increasing NValue à l'aide d'automates ou de la contrainte SLIDE. Nous utilisons notre contrainte dans le cadre d'un problème d'allocation de ressources

CDK1 Prevents Unscheduled PLK4-STIL Complex Assembly in Centriole Biogenesis

The deposited article is a post-print version (author's manuscript from PMC and available in PMC 2017 May 9).This publication hasn't any creative commons license associated.This deposit is composed by the main article and the supplementary materials are present in the publisher's page in the following link: https://www.sciencedirect.com/science/article/pii/S0960982216303001?via%3Dihub#sec4Centrioles are essential for the assembly of both centrosomes and cilia. Centriole biogenesis occurs once and only once per cell cycle and is temporally coordinated with cell-cycle progression, ensuring the formation of the right number of centrioles at the right time. The formation of new daughter centrioles is guided by a pre-existing, mother centriole. The proximity between mother and daughter centrioles was proposed to restrict new centriole formation until they separate beyond a critical distance. Paradoxically, mother and daughter centrioles overcome this distance in early mitosis, at a time when triggers for centriole biogenesis Polo-like kinase 4 (PLK4) and its substrate STIL are abundant. Here we show that in mitosis, the mitotic kinase CDK1-CyclinB binds STIL and prevents formation of the PLK4-STIL complex and STIL phosphorylation by PLK4, thus inhibiting untimely onset of centriole biogenesis. After CDK1-CyclinB inactivation upon mitotic exit, PLK4 can bind and phosphorylate STIL in G1, allowing pro-centriole assembly in the subsequent S phase. Our work shows that complementary mechanisms, such as mother-daughter centriole proximity and CDK1-CyclinB interaction with centriolar components, ensure that centriole biogenesis occurs once and only once per cell cycle, raising parallels to the cell-cycle regulation of DNA replication and centromere formation.ERC grant: (ERC-2010-StG-261344); FCT grants: (FCT Investigator, EXPL/BIM-ONC/0830/2013, PTDC/SAU-BD/105616/2008); EMBO installation grant.info:eu-repo/semantics/publishedVersio

Gaia Data Release 3. The Galaxy in your preferred colours: Synthetic photometry from Gaia low-resolution spectra

peer reviewedGaia Data Release 3 provides novel flux-calibrated low-resolution spectrophotometry for ≃220 million sources in the wavelength range 330 nm ≤ λ ≤ 1050 nm (XP spectra). Synthetic photometry directly tied to a flux in physical units can be obtained from these spectra for any passband fully enclosed in this wavelength range. We describe how synthetic photometry can be obtained from XP spectra, illustrating the performance that can be achieved under a range of different conditions - for example passband width and wavelength range - as well as the limits and the problems affecting it. Existing top-quality photometry can be reproduced within a few per cent over a wide range of magnitudes and colour, for wide and medium bands, and with up to millimag accuracy when synthetic photometry is standardised with respect to these external sources. Some examples of potential scientific application are presented, including the detection of multiple populations in globular clusters, the estimation of metallicity extended to the very metal-poor regime, and the classification of white dwarfs. A catalogue providing standardised photometry for ≃2.2 × 108 sources in several wide bands of widely used photometric systems is provided (Gaia Synthetic Photometry Catalogue; GSPC) as well as a catalogue of ≃105 white dwarfs with DA/non-DA classification obtained with a Random Forest algorithm (Gaia Synthetic Photometry Catalogue for White Dwarfs; GSPC-WD)

A GAC Algorithm for a Class of Global Counting Constraints

Research Report, TR-10-1-Info, Ecole des Mines de NantesThis paper presents the constraint class seq bin(N;X;C;B) where N is an integer variable, X is a sequence of integer variables and C and B are two binary constraints. A constraint of the seq bin class enforces the two following conditions: (1) N is equal to the number of times that the constraint C is satised on two consecutive variables in X, and (2) B holds on any pair of consecutive variables in X. Providing that B satises the particular property of neighborhood-substitutability, we come up with a ltering algorithm that achieves generalized arc-consistency (GAC) for seq bin(N;X;C;B). This algorithm can be directly used for the constraints Change, Smooth, Increasing Nvalue, Among and Increasing Among, in time linear in the sum of domain sizes. For all these constraints, this time complexity either improves the best known results, or equals those results