@misc{RazzaqKaminskiRomeroetal.2018,
  author    = {Razzaq, Misbah and Kaminski, Roland and Romero, Javier and Schaub, Torsten H. and Bourdon, Jeremie and Guziolowski, Carito},
  title     = {Computing diverse boolean networks from phosphoproteomic time series data},
  series = {Computational Methods in Systems Biology},
  volume    = {11095},
  journal   = {Computational Methods in Systems Biology},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-319-99429-1},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-319-99429-1_4},
  pages     = {59 -- 74},
  year      = {2018},
  abstract  = {Logical modeling has been widely used to understand and expand the knowledge about protein interactions among different pathways. Realizing this, the caspo-ts system has been proposed recently to learn logical models from time series data. It uses Answer Set Programming to enumerate Boolean Networks (BNs) given prior knowledge networks and phosphoproteomic time series data. In the resulting sequence of solutions, similar BNs are typically clustered together. This can be problematic for large scale problems where we cannot explore the whole solution space in reasonable time. Our approach extends the caspo-ts system to cope with the important use case of finding diverse solutions of a problem with a large number of solutions. We first present the algorithm for finding diverse solutions and then we demonstrate the results of the proposed approach on two different benchmark scenarios in systems biology: (1) an artificial dataset to model TCR signaling and (2) the HPN-DREAM challenge dataset to model breast cancer cell lines.},
  language  = {en}
}