Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have discovered an even faster method.

Probabilistic models, such as hidden Markov models or Bayesian networks, are commonly used to model biological data. Much of their popularity can be attributed to the existence of efficient and robust ...