Browsing by Author "Rapaport Zimermann, Iván"

Now showing items 1-7 of 7

    • Communication complexity and intrinsic universality in cellular automata 
      Goles Chacc, Eric,; Meunier, P.-E.; Rapaport Zimermann, Iván; Theyssier, G. (Elsevier, 2011)
      The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most cases. In this article, ...
    • Continuous Modeling of Metabolic Networks With Gene Regulation in Yeast and In Vivo Determination of Rate ... 
      Moisset, P.; Vaisman, D.; Cintolesi, A.; Urrutia, J.; Rapaport Zimermann, Iván; Andrews Farrow, Bárbara; Asenjo de Leuze, Juan (2012-09)
      A continuous model of a metabolic network including gene regulation to simulate metabolic fluxes during batch cultivation of yeast Saccharomyces cerevisiae was developed. The metabolic network includes reactions ...
    • Minimal Proper Interval Completions 
      Rapaport Zimermann, Iván; Suchan, Karol; Todinca, Ioan (ELSEVIER SCIENCE BV, 2008-05-31)
      Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich ...
    • New approaches for predicting protein retention time in hydrophobic interaction chromatography 
      Lienqueo Contreras, María Elena; Mahn Osses, Andrea; Navarro, Gonzalo; Salgado, J. Cristián; Pérez-Acle, Tomás; Rapaport Zimermann, Iván; Asenjo de Leuze, Juan (JOHN WILEY, 2006-08)
      Hydrophobic interaction chromatography (HIC) is an important technique for the purification of proteins. In this paper, we review three different approaches for predicting protein retention time in HIC, based either on a ...
    • On Dissemination Thresholds in Regular and Irregular Graph Classes 
      Rapaport Zimermann, Iván; Suchan, K.; Todinca, I.; Verstraete, J. (Springer, 2011-01)
      We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active vertices are chosen independently with ...
    • Prediction of retention times of proteins in hydrophobic interaction chromatography using only their amino ... 
      Salgado, J. Cristián; Rapaport Zimermann, Iván; Asenjo de Leuze, Juan (ELSEVIER SCIENCE BV, 2005-12-09)
      This paper focuses on the prediction of the dimensionless retention time of proteins (DRT) in hydrophobic interaction chromatography (HIC) by means of mathematical models based, essentially, only on aminoacidic composition. ...
    • Three notes on distributed property testing 
      Even, Guy; Fischer, Orr; Fraigniaud, Pierre; Gonen, Tzlil; Levi, Reut; Medina, Moti; Montealegre, Pedro; Olivetti, Dennis; Oshman, Rotem; Rapaport Zimermann, Iván; Todinca, Ioan (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      In this paper we present distributed property-testing algorithms for graph properties in thecongestmodel, with emphasis on testing subgraph-freeness. Testing a graph propertyPmeansdistinguishing graphsG= (V,E)having ...