Data augmentation is required for the implementation of many Markov chain Monte Carlo (MCMC) algorithms. The inclusion of augmented data can often lead to conditional distributions from well-known ...

On Tuesday the 3rd of October 2023, M.Sc. Manuel Cáceres defends his PhD thesis on Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. The thesis is related to research done in the ...

Finding a Minimum Path Cover of a DAG is a fundamental algorithmic problem, with applications in various fields, including Bioinformatics. While a classical solution leads to a quadratic-time ...

Graph algorithms constitute a fundamental area of computational research that focuses on the analysis and manipulation of graph structures, which represent systems of interconnected entities. In ...

Daniel Lokshtanov is a Professor and Vice Chair of Computer Science at UCSB, and a Visiting Professor at the University of Bergen. He received his PhD in Computer Science (2009), from the University ...

The use of algorithms to filter and present information online is increasingly shaping our everyday experience of the real world, a study argues. The use of algorithms to filter and present ...

We propose an application of the parameterized expectations algorithm (PEA) to business cycle accounting (BCA). The PEA has an advantage in that it is simple and easier to understand and implement ...