tqDist: a library for computing the quartet and triplet distances between binary or general trees A Sand, MK Holt, J Johansen, GS Brodal, T Mailund, CNS Pedersen Bioinformatics 30 (14), 2079-2080, 2014 | 90 | 2014 |
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree GS Brodal, R Fagerberg, T Mailund, CNS Pedersen, A Sand Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 43 | 2013 |
Algorithms for computing the triplet and quartet distances for binary general trees A Sand, MK Holt, J Johansen, R Fagerberg, GS Brodal, CNS Pedersen, ... Biology 2 (4), 1189-1209, 2013 | 23 | 2013 |
Algorithms for a parallel implementation of hidden Markov models with a small state space J Nielsen, A Sand 2011 IEEE International Symposium on Parallel and Distributed Processing …, 2011 | 21 | 2011 |
HMMlib: A C++ library for general hidden Markov models exploiting modern CPUs A Sand, CNS Pedersen, T Mailund, AT Brask 2010 Ninth International Workshop on Parallel and Distributed Methods in …, 2010 | 21 | 2010 |
zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm A Sand, M Kristiansen, CNS Pedersen, T Mailund BMC bioinformatics 14, 1-11, 2013 | 17 | 2013 |
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees A Sand, GS Brodal, R Fagerberg, CNS Pedersen, T Mailund BMC bioinformatics 14, 1-9, 2013 | 11 | 2013 |
Hide and seek: placing and finding an optimal tree for thousands of homoplasy-rich sequences D Radel, A Sand, M Steel Molecular phylogenetics and evolution 69 (3), 1186-1189, 2013 | 10 | 2013 |
Algorithms for hidden markov models restricted to occurrences of regular expressions P Tataru, A Sand, A Hobolth, T Mailund, CNS Pedersen Biology 2 (4), 1282-1295, 2013 | 9 | 2013 |
The standard lateral gene transfer model is statistically consistent for pectinate four-taxon trees A Sand, M Steel Journal of theoretical biology 335, 295-298, 2013 | 3 | 2013 |
Paths in Continuous-Time Markov Chains with Applications to Studies of Protein Tertiary Structure Evolution A Sand University Of Aarhus, Aarhus, Denmark, 2009 | 1 | 2009 |
Engineering of Algorithms for Hidden Markov models and Tree Distances A Sand Department of Computer Science, Aarhus University, 2014 | | 2014 |
Efficient implementations of algorithms for analyzing biological data, using hidden Markov models and tree data structures A Sand | | 2012 |
Using the Power of Modern Processors in Bioformatics M Simonsen, A Sand, T Mailund, CNS Pedersen | | 2010 |
Efficient Algorithms for Computing the Triplet and Quartet Distances Between Trees of Arbitrary Degree A Sand, GS Brodal, R Fagerberg, CNS Pedersen, T Mailund | | |
Computing Triplet and Quartet Distances Between Trees GS Brodal, MK Holt, J Johansen, R Fagerberg, T Mailund, CNS Pedersen, ... | | |