Automated tracking of living cells in microscopy image sequences is an important and challenging problem. With this application in mind, we propose a global track linking algorithm, which links cell ...

Viterbi, A. (1967). Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Transactions on Information Theory, 13, 260-269.

This project explores three core computational challenges in bioinformatics using Python 🐍. It covers the application of the Viterbi algorithm for decoding hidden state sequences, game-theoretic ...

Then, we consider the application of the list Viterbi algorithm and we discuss some techniques useful to reduce its complexity in practical implementations. Results show that it is possible to ...

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

In this project we implmented a directed weighted graph and graph algorithms. In addition, we created a GUI that can load grpahs json file and show them.