Search research articles
Contact Us
Filters
Showing results (1-10 of 8) with videos related to
Page
of 1
Sort By:
Journal of Theoretical Biology
|
July 18, 2013
The standard lateral gene transfer model is statistically consistent for pectinate four-taxon trees
Andreas Sand, Mike Steel
Molecular Phylogenetics and Evolution
|
August 14, 2013
Hide and seek: placing and finding an optimal tree for thousands of homoplasy-rich sequences
Dietrich Radel, Andreas Sand, Mike Steel
BMC Bioinformatics
|
November 26, 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, et al.
Biology
|
May 17, 2014
Algorithms for hidden markov models restricted to occurrences of regular expressions
Paula Tataru, Andreas Sand, Asger Hobolth, et al.
BMC Bioinformatics
|
February 2, 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, et al.
Bioinformatics (Oxford, England)
|
March 22, 2014
tqDist: a library for computing the quartet and triplet distances between binary or general trees
Andreas Sand, Morten K Holt, Jens Johansen, et al.
BMC Medical Genomics
|
January 29, 2024
Whole genome sequencing in clinical practice
Frederik Otzen Bagger, Line Borgwardt, Andreas Sand Jespersen, et al.
Biology
|
May 17, 2014
Algorithms for computing the triplet and quartet distances for binary and general trees
Andreas Sand, Morten K Holt, Jens Johansen, et al.
Page
of 1
Search research articles
Search
Showing results (1-10 of 8) with videos related to
Sort By:
Page
of 1
Journal of Theoretical Biology
|
July 18, 2013
The standard lateral gene transfer model is statistically consistent for pectinate four-taxon trees
Andreas Sand, Mike Steel
Molecular Phylogenetics and Evolution
|
August 14, 2013
Hide and seek: placing and finding an optimal tree for thousands of homoplasy-rich sequences
Dietrich Radel, Andreas Sand, Mike Steel
BMC Bioinformatics
|
November 26, 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, et al.
Biology
|
May 17, 2014
Algorithms for hidden markov models restricted to occurrences of regular expressions
Paula Tataru, Andreas Sand, Asger Hobolth, et al.
BMC Bioinformatics
|
February 2, 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, et al.
Bioinformatics (Oxford, England)
|
March 22, 2014
tqDist: a library for computing the quartet and triplet distances between binary or general trees
Andreas Sand, Morten K Holt, Jens Johansen, et al.
BMC Medical Genomics
|
January 29, 2024
Whole genome sequencing in clinical practice
Frederik Otzen Bagger, Line Borgwardt, Andreas Sand Jespersen, et al.
Biology
|
May 17, 2014
Algorithms for computing the triplet and quartet distances for binary and general trees
Andreas Sand, Morten K Holt, Jens Johansen, et al.
Page
of 1