Algorithms for a Parallel Implementation of Hidden Markov Models with a Small State Space. - Jesper Buus Nielsen; Andreas Sand (IPDPS Workshops, 2011)

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. - Gerth Stølting Brodal; Rolf Fagerberg; Thomas Mailund; Christian N. S. Pedersen; Andreas Sand (SODA, 2013)

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. - Andreas Sand; Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Thomas Mailund (BMC Bioinform., 2013)

zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm. - Andreas Sand; Martin Kristiansen; Christian N. S. Pedersen; Thomas Mailund (BMC Bioinform., 2013)

tqDist: a library for computing the quartet and triplet distances between binary or general trees. - Andreas Sand; Morten Kragelund Holt; Jens Johansen; Gerth Stølting Brodal; Thomas Mailund; Christian N. S. Pedersen (Bioinform., 2014)