6 citations · 12 across the 5 of their papers we have counts for
6 papers
Learning the structure of Bayesian Networks: A quantitative assessment of the effect of different algorithmic schemes
Stefano Beretta, Mauro Castelli, Ivo Goncalves +2
One of the most challenging tasks when adopting Bayesian Networks (BNs) is the one of learning their structure from data. This task is complicated by the huge search space of possi…
Combining Bayesian Approaches and Evolutionary Techniques for the Inference of Breast Cancer Networks
Stefano Beretta, Mauro Castelli, Ivo Goncalves +2
Gene and protein networks are very important to model complex large-scale systems in molecular biology. Inferring or reverseengineering such networks can be defined as the process…
Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem
Stefano Beretta, Mauro Castelli, Riccardo Dondi
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem.…
Covering Pairs in Directed Acyclic Graphs
Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni +2
The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in differ…
Reconstructing Isoform Graphs from RNA-Seq data
Stefano Beretta, Paola Bonizzoni, Gianluca Della Vedova +1
Next-generation sequencing (NGS) technologies allow new methodologies for alternative splicing (AS) analysis. Current computational methods for AS from NGS data are mainly focused…
Parameterized Complexity of the k-anonymity Problem
Stefano Beretta, Paola Bonizzoni, Gianluca Della Vedova +2
The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the -anonym…