Andreas Sand

According to our database, Andreas Sand authored at least 5 papers between 2011 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2014

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

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

A practical O(n log² 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

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

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2011

Algorithms for a Parallel Implementation of Hidden Markov Models with a Small State Space.

Jesper Buus Nielsen, Andreas Sand

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011