Andreas Sand
Andreas Sand
PhD student at Bioinformatics Research Centre and Department of Computer Science, Aarhus University
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
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
362014
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
242013
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
202011
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
192010
Algorithms for computing the triplet and quartet distances for binary and general trees
A Sand, MK Holt, J Johansen, R Fagerberg, GS Brodal, CNS Pedersen, ...
Biology 2 (4), 1189-1209, 2013
152013
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), 1-11, 2013
132013
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
92013
A practical O (n log 2 n) time algorithm for computing the triplet distance on binary trees
A Sand, GS Brodal, R Fagerberg, CNS Pedersen, T Mailund
BMC bioinformatics 14 (2), 1-9, 2013
72013
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
62013
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
22013
Paths in Continuous-Time Markov Chains with Applications to Studies of Protein Tertiary Structure Evolution
A Sand
University Of Aarhus, Aarhus, Denmark, 2009
12009
Computing Triplet and Quartet Distances Between Trees
GS Brodal, MK Holt, J Johansen, R Fagerberg, T Mailund, CNS Pedersen, ...
2014
Engineering of Algorithms for Hidden Markov Models and Tree Distances
A Sand
Department Office 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
Efficient Algorithms for Computing the Triplet and Quartet Distances Between Trees of Arbitrary Degree
A Sand, GS Brodal, R Fagerberg, CNS Pedersen, T Mailund
The system can't perform the operation now. Try again later.
Articles 1–15