Publications and Preprints

View: by year · by area  ·  107 publications

Phylogenetic mathematics (27)

  1. Bryant, D., Huber, K.T., Moulton, V. and Spillner, A. 2025. Buneman graphs, partial splits and subtree distances. Discrete Applied Mathematics 369: 28–44. [journal]
  2. Snyman, J., Fox, C. and Bryant, D. 2023. Parsimony and the rank of a flattening matrix. Journal of Mathematical Biology 86(3): 44. [journal · arXiv:2111.14961]
  3. Balvočiūtė, M., Bryant, D. and Spillner, A. 2017. When can splits be drawn in the plane?. SIAM Journal on Discrete Mathematics 31(2): 839–856. [journal · arXiv:1509.06104]
  4. Bryant, D., Francis, A. and Steel, M. 2017. Can We “Future-Proof” Consensus Trees?. Systematic Biology 66(4): 611–619. [journal · arXiv:1611.01225]
  5. Bryant, D. and Tupper, P.F. 2012. Hyperconvexity and tight-span theory for diversities. Advances in Mathematics 231(6): 3172–3198. [journal · arXiv:1006.1095]
  6. Bryant, D. and Steel, M. 2012. `Bureaucratic' set systems, and their role in phylogenetics. Applied Mathematics Letters. [arXiv:1106.1723]
  7. Bryant, D. and Klaere, S. 2012. The link between segregation and phylogenetic diversity. Journal of Mathematical Biology 64(1--2): 149–162. [journal · arXiv:1008.4625]
  8. Bryant, D. and Steel, M. 2009. Computing the Distribution of a Tree Metric. IEEE/ACM Transactions on Computational Biology and Bioinformatics 6(3): 420–426. [journal · arXiv:0810.0868]
  9. Bryant, D. 2009. Hadamard phylogenetic methods and the n-taxon process. Bulletin of Mathematical Biology 71(2): 339–351. [journal · arXiv:0806.1378]
  10. Bruen, T.C. and Bryant, D. 2008. Parsimony via consensus. Systematic Biology 57: 251–256.
  11. Bruen, T.C. and Bryant, D. 2008. A subdivision approach to maximum parsimony. Annals of Combinatorics 12: 45–51.
  12. Bryant, D. and Dress, A.W.M. 2007. Linearly independent split systems. European Journal of Combinatorics 28(6): 1814–1831. [journal]
  13. Bryant, D., Moulton, V. and Spillner, A. 2007. Consistency of the NeighborNet algorithm. Algorithms for Molecular Biology 2: 8. [journal]
  14. Lepage, T., Bryant, D., Philippe, H. and Lartillot, N. 2007. A general comparison of relaxed molecular clock models. Molecular Biology and Evolution 24: 2669–2680.
  15. Lepage, T., Lawi, S., Tupper, P.F. and Bryant, D. 2006. Continuous and tractable models for the variation of evolutionary rates. Mathematical Biosciences 199(2): 216–233. [journal · arXiv:math/0506145]
  16. Bryant, D. 2005. Extending tree models to split networks. In Algebraic Statistics for Computational Biology (Pachter, L. and Sturmfels, B., eds), Cambridge University Press, pp. 322–334.
  17. Bryant, D. 2005. On the uniqueness of the selection criterion in neighbor-joining. Journal of Classification 22(1): 3–15.
  18. Bryant, D. 2004. The splits in the neighbourhood of a tree. Annals of Combinatorics 8(1): 1–11.
  19. Lapointe, F.J., Wilkinson, M. and Bryant, D. 2004. Matrix representations with parsimony or with distances? A tale of two consensus approaches. Systematic Biology 52(6): 865–869.
  20. Bryant, D., Huson, D.H., Kloepper, T. and Nieselt-Struwe, K. 2003. Distance corrections on recombinant sequences. In Algorithms in Bioinformatics, Lecture Notes in Computer Science, vol. 2812, pp. 271–286.
  21. Bryant, D. 2003. A classification of consensus methods for phylogenies. In BioConsensus, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 163–184.
  22. Bryant, D., Steel, M. and MacKenzie, A. 2003. The size of a maximum agreement subtree for random binary trees. In BioConsensus, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 55–66.
  23. Bryant, D. and Berry, V. 2001. A family of clustering and tree construction methods. Advances in Applied Mathematics 27(4): 705–732.
  24. Gascuel, O., Bryant, D. and Denis, F. 2001. Theoretical limitations of the minimum evolution principle. Systematic Biology 50(5): 621–627.
  25. Böcker, S., Bryant, D., Dress, A.W.M. and Steel, M. 2000. Algorithmic aspects of tree amalgamation. Journal of Algorithms 37(2): 522–537.
  26. Bryant, D. 1997. Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. Ph.D. thesis, University of Canterbury.
  27. Bryant, D. and Steel, M. 1995. Extension operations on sets of leaf-labelled trees. Advances in Applied Mathematics 16(4): 425–453. [journal]

Algorithms for phylogenetics (26)

  1. Bryant, D., Scornavacca, C. and Swofford, D. 2026. LvD: A New Algorithm for Computing the Likelihood of a Phylogeny. Preprint. [arXiv:2601.19064]
  2. Bryant, D. and Huson, D.H. 2023. NeighborNet: improved algorithms and implementation. Frontiers in Bioinformatics 3: 1178600. [journal]
  3. Stoltz, M., Baeumer, B., Bouckaert, R., Fox, C., Hiscott, G. and Bryant, D. 2021. Bayesian inference of species trees using diffusion models. Systematic Biology 70(1): 145–161. [journal · arXiv:1909.07276]
  4. Bryant, D. and Scornavacca, C. 2019. An O(n log n) time algorithm for computing the path-length distance between trees. Algorithmica 81: 3692–3706. [journal · arXiv:1811.00619]
  5. Bryant, D. and Charleston, M. 2018. MAD roots for large trees. Preprint. [arXiv:1811.03174]
  6. Hiscott, G., Fox, C., Parry, M. and Bryant, D. 2016. Efficient recycled algorithms for quantitative trait models on phylogenies. Genome Biology and Evolution 8(5): 1338–1350. [journal · arXiv:1512.00890]
  7. Joly, S., Bryant, D. and Lockhart, P.J. 2015. Flexible methods for estimating genetic distances from single nucleotide polymorphisms. Methods in Ecology and Evolution 6(8): 938–948.
  8. Scornavacca, C., van Iersel, L., Kelk, S. and Bryant, D. 2014. The agreement problem for unrooted phylogenetic trees is FPT. Journal of Graph Algorithms and Applications 18(3): 385–392. [journal]
  9. Holder, M.T., Lewis, P.O., Swofford, D.L. and Bryant, D. 2013. Variable tree topology stepping-stone marginal likelihood estimation. In Bayesian Phylogenetics: Methods, Algorithms, and Applications (Chen, M.H., Kuo, L. and Lewis, P.O., eds), Chapman and Hall/CRC.
  10. Bryant, D., Bouckaert, R., Felsenstein, J., Rosenberg, N.A. and RoyChoudhury, A. 2012. Inferring Species Trees Directly from Biallelic Genetic Markers: Bypassing Gene Trees in a Full Coalescent Analysis. Molecular Biology and Evolution 29(8): 1917–1932. [journal · arXiv:0910.4193]
  11. Thierer, T., Bryant, D. and Steel, M. 2008. Counting ancestral reconstructions in a fixed phylogeny. Annals of Combinatorics 12(1): 123–132. [journal]
  12. Bevan, R., Bryant, D. and Lang, B.F. 2007. Accounting for gene rate heterogeneity in phylogenetic inference. Systematic Biology 56: 194–205.
  13. Bryant, D. and Lagergren, J. 2006. Compatibility of unrooted phylogenetic trees is FPT. Theoretical Computer Science 351(3): 296–302. [journal]
  14. Bevan, R., Lang, B.F. and Bryant, D. 2005. Calculating the Evolutionary Rates of Different Genes: A Fast, Accurate Estimator with Applications to Maximum Likelihood Phylogenetic Analysis. Systematic Biology 54(6): 900–915.
  15. Rodrigue, N., Lartillot, N., Bryant, D. and Philippe, H. 2005. Site interdependence attributed to tertiary structure in amino acid sequence evolution. Gene 207–217.
  16. Bryant, D., Semple, C. and Steel, M. 2004. Supertrees with ancestral divergence times. In Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life (Bininda-Emonds, O.R.P., eds), Kluwer Academic Publishers, pp. 129–150.
  17. Bryant, D. 2001. Optimal agreement supertrees. In Selected Papers from the First International Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science, vol. 2066, pp. 24–31.
  18. Bryant, D. and Steel, M. 2001. Constructing optimal trees from quartets. Journal of Algorithms 38(1): 237–259.
  19. Bryant, D., Tsang, J., Kearney, P. and Li, M. 2000. Computing the quartet distance between evolutionary trees. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.
  20. Berry, V., Bryant, D., Kearney, P., Li, M., Jiang, T., Wareham, T. and Zhang, H. 1999. A practical algorithm for recovering the best supported edges in an evolutionary tree. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.
  21. Berry, V. and Bryant, D. 1999. Faster reliable phylogenetic analysis. In Proceedings of the Third Annual International Conference on Computational Molecular Biology, pp. 59–69.
  22. Bryant, D. and Steel, M. 1999. Fast algorithms for constructing optimal trees from quartets. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, vol. 10, pp. 147–155.
  23. Bryant, D. and Moulton, V. 1999. A polynomial time algorithm for the refined Buneman tree. Applied Mathematics Letters 12: 51–56.
  24. Bryant, D. and Waddell, P.J. 1998. Rapid evaluation of least-squares and minimum-evolution criteria on phylogenetic trees. Molecular Biology and Evolution 15(10): 1346–1359.
  25. Bryant, D. 1997. Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. Ph.D. thesis, University of Canterbury.
  26. Bryant, D. 1996. Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration, and Optimization. Journal of Computational Biology 3(2): 275–288. [journal]

Phylogenetic networks (10)

  1. Huson, D.H. and Bryant, D. 2024. The SplitsTree App: interactive analysis and visualization using phylogenetic trees and networks. Nature Methods 21(10): 1773–1774. [journal]
  2. Bryant, D. and Huson, D.H. 2023. NeighborNet: improved algorithms and implementation. Frontiers in Bioinformatics 3: 1178600. [journal]
  3. Bagci, C., Bryant, D., Cetinkaya, B. and Huson, D.H. 2021. Microbial Phylogenetic Context Using Phylogenetic Outlines. Genome Biology and Evolution 13(9): evab213. [journal]
  4. Balvočiūtė, M., Bryant, D. and Spillner, A. 2017. When can splits be drawn in the plane?. SIAM Journal on Discrete Mathematics 31(2): 839–856. [journal · arXiv:1509.06104]
  5. Leigh, J.W. and Bryant, D. 2015. POPART: full-feature software for haplotype network construction. Methods in Ecology and Evolution 6(9): 1110–1116. [journal]
  6. Bryant, D., Moulton, V. and Spillner, A. 2007. Consistency of the NeighborNet algorithm. Algorithms for Molecular Biology 2: 8. [journal]
  7. Huson, D.H. and Bryant, D. 2006. Application of Phylogenetic Networks in Evolutionary Studies. Molecular Biology and Evolution 23(2): 254–267. [journal]
  8. Bryant, D. 2005. Extending tree models to split networks. In Algebraic Statistics for Computational Biology (Pachter, L. and Sturmfels, B., eds), Cambridge University Press, pp. 322–334.
  9. Winkworth, R., Bryant, D., Lockhart, P.J. and Moulton, V. 2005. Biogeographic interpretation of split graphs: studying Quaternary plant diversification. Systematic Biology 54(1): 56–65.
  10. Bryant, D. and Moulton, V. 2004. NeighborNet: an agglomerative algorithm for the construction of phylogenetic networks. Molecular Biology and Evolution 21(2): 255–265.

Diversities (13)

  1. Bryant, D., Huber, K.T., Moulton, V. and Spillner, A. 2025. Subtree distances, tight spans and diversities. Topology and its Applications 373: 109545. [journal · arXiv:2501.13202]
  2. Bryant, D. and Tupper, P.F. 2024. Linear and Sublinear Diversities. Preprint. [arXiv:2412.07092]
  3. Bryant, D., Huber, K.T., Moulton, V. and Tupper, P.F. 2023. Diversities and the Generalized Circumradius. Discrete and Computational Geometry 70(4): 1862–1883. [journal · arXiv:2110.13383]
  4. Bryant, D., Nies, A. and Tupper, P. 2021. Fraïssé limits for relational metric structures. The Journal of Symbolic Logic 86(3): 913–934. [journal · arXiv:1901.02122]
  5. Bryant, D., Cioica-Licht, P., Clark, L.O. and Young, R. 2021. Inner products for convex bodies. Journal of Convex Analysis 28(4): 1249–1264. [arXiv:1811.03686]
  6. Wu, P., Bryant, D. and Tupper, P.F. 2021. Negative-Type Diversities, a Multi-dimensional Analogue of Negative-Type Metrics. Journal of Geometric Analysis 31(2): 1703–1720. [journal · arXiv:1809.06523]
  7. Bryant, D., Felipe, R., Toledo-Acosta, M. and Tupper, P.F. 2020. Lattice Diversities. Preprint. [arXiv:2010.11442]
  8. Bryant, D., Nies, A. and Tupper, P. 2017. A universal separable diversity. Analysis and Geometry in Metric Spaces 5(1): 138–151. [journal · arXiv:1509.07173]
  9. Bryant, D. and Tupper, P.F. 2017. Open Problem Statement: Minimal Distortion Embeddings of Diversities in ℓ_1. . [arXiv:1712.01960]
  10. Bryant, D. and Tupper, P.F. 2016. Constant distortion embeddings of symmetric diversities. Analysis and Geometry in Metric Spaces 4(1): 326–335. [journal · arXiv:1604.01863]
  11. Bryant, D. and Tupper, P.F. 2014. Diversities and the geometry of hypergraphs. Discrete Mathematics and Theoretical Computer Science 16(2): 1–20. [journal · arXiv:1312.5408]
  12. Bryant, D. and Tupper, P.F. 2012. Hyperconvexity and tight-span theory for diversities. Advances in Mathematics 231(6): 3172–3198. [journal · arXiv:1006.1095]
  13. Bryant, D. and Klaere, S. 2012. The link between segregation and phylogenetic diversity. Journal of Mathematical Biology 64(1--2): 149–162. [journal · arXiv:1008.4625]

Species trees and speciation (12)

  1. Collienne, L., Elmes, K., Fischer, M., Bryant, D. and Gavryushkin, A. 2021. Discrete coalescent trees. Journal of Mathematical Biology 83(5): 60. [journal · arXiv:2101.02751]
  2. Stoltz, M., Baeumer, B., Bouckaert, R., Fox, C., Hiscott, G. and Bryant, D. 2021. Bayesian inference of species trees using diffusion models. Systematic Biology 70(1): 145–161. [journal · arXiv:1909.07276]
  3. Bryant, D. and Hahn, M.W. 2020. The Concatenation Question. In Phylogenetics in the Genomic Era, Hyper Articles en Ligne.
  4. Fraser, C., Davies, I.D., Bryant, D. and Waters, J.M. 2018. How disturbance and dispersal influence intraspecific structure. Journal of Ecology. [journal]
  5. Larcombe, M.J., Jordan, G.J., Bryant, D. and Higgins, S.I. 2018. The dimensionality of niche space allows bounded and unbounded processes to jointly influence diversification. Nature Communications 9: 4258. [journal]
  6. Mehta, R.S., Bryant, D. and Rosenberg, N.A. 2016. The probability of monophyly of a sample of gene lineages on a species tree. Proceedings of the National Academy of Sciences of the United States of America 113(29): 8002–8009. [journal]
  7. Joly, S., Bryant, D. and Lockhart, P.J. 2015. Flexible methods for estimating genetic distances from single nucleotide polymorphisms. Methods in Ecology and Evolution 6(8): 938–948.
  8. Bryant, D. and Kydd, J. 2013. Forty years of model-based phylogeography. In Models and Algorithms for Genome Evolution (Chauve, C., El-Mabrouk, N. and Tannier, E., eds), Springer, pp. 17–28. [journal]
  9. Heled, J., Bryant, D. and Drummond, A.J. 2013. Simulating gene trees under the multispecies coalescent and time-dependent migration. BMC Evolutionary Biology 13: 44. [journal]
  10. Bryant, D., Bouckaert, R., Felsenstein, J., Rosenberg, N.A. and RoyChoudhury, A. 2012. Inferring Species Trees Directly from Biallelic Genetic Markers: Bypassing Gene Trees in a Full Coalescent Analysis. Molecular Biology and Evolution 29(8): 1917–1932. [journal · arXiv:0910.4193]
  11. Degnan, J.H., DeGiorgio, M., Bryant, D. and Rosenberg, N.A. 2009. Properties of consensus methods for inferring species trees from gene trees. Systematic Biology 58: 35–54. [arXiv:0802.2355]
  12. Meudt, H.M., Lockhart, P.J. and Bryant, D. 2009. Species delimitation and phylogeny of a New Zealand plant species radiation. BMC Evolutionary Biology 9: 111.

Evolutionary rates (3)

  1. Bevan, R., Bryant, D. and Lang, B.F. 2007. Accounting for gene rate heterogeneity in phylogenetic inference. Systematic Biology 56: 194–205.
  2. Lepage, T., Bryant, D., Philippe, H. and Lartillot, N. 2007. A general comparison of relaxed molecular clock models. Molecular Biology and Evolution 24: 2669–2680.
  3. Lepage, T., Lawi, S., Tupper, P.F. and Bryant, D. 2006. Continuous and tractable models for the variation of evolutionary rates. Mathematical Biosciences 199(2): 216–233. [journal · arXiv:math/0506145]

Recombination (3)

  1. White, D.J., Bryant, D. and Gemmell, N.J. 2013. How good are indirect tests at detecting recombination in human mtDNA?. G3: Genes, Genomes, Genetics 3(7): 1095–1104. [journal]
  2. Bruen, T.C., Philippe, H. and Bryant, D. 2006. A simple and robust statistical test for detecting the presence of recombination. Genetics 172(4): 2665–2681. [journal]
  3. Bryant, D., Huson, D.H., Kloepper, T. and Nieselt-Struwe, K. 2003. Distance corrections on recombinant sequences. In Algorithms in Bioinformatics, Lecture Notes in Computer Science, vol. 2812, pp. 271–286.

Genomics (16)

  1. Kapust, N., Nelson-Sathi, S., Schönfeld, B., Hazkani-Covo, E., Bryant, D., Lockhart, P.J., Röttger, M., Xavier, J.C. and Martin, W.F. 2018. Failure to Recover Major Events of Gene Flux in Real Biological Data Due to Method Misapplication. Genome Biology and Evolution 10(5): 1198–1209. [journal]
  2. Ku, C., Nelson-Sathi, S., Roettger, M., Sousa, F.L., Lockhart, P.J., Bryant, D., Hazkani-Covo, E., McInerney, J.O., Landan, G. and Martin, W.F. 2015. Endosymbiotic origin and differential loss of eukaryotic genes. Nature 524(7566): 427–432. [journal]
  3. Nelson-Sathi, S., Sousa, F.L., Roettger, M., Lozada-Chávez, N., Thiergart, T., Janssen, A., Bryant, D., Landan, G., Schönheit, P., Siebers, B., McInerney, J.O. and Martin, W.F. 2015. Origins of major archaeal clades correspond to gene acquisitions from bacteria. Nature 517(7532): 77–80. [journal]
  4. Bryant, D. and Kydd, J. 2013. Forty years of model-based phylogeography. In Models and Algorithms for Genome Evolution (Chauve, C., El-Mabrouk, N. and Tannier, E., eds), Springer, pp. 17–28. [journal]
  5. Matroud, A.A., Tuffley, C.P., Bryant, D. and Hendy, M.D. 2012. A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats. In Bioinformatics Research and Applications, Lecture Notes in Computer Science, vol. 7409, pp. 37–48.
  6. Dagan, T., Roettger, M., Bryant, D. and Martin, W.F. 2010. Genome networks root the tree of life between prokaryotic domains. Genome Biology and Evolution 2: 379–392. [journal]
  7. Sangaralingam, A., Susko, E., Bryant, D. and Spencer, M. 2010. On the artefactual parasitic eubacteria clan in conditioned logdet phylogenies: heterotachy and ortholog identification artefacts as explanations. BMC Evolutionary Biology 10: 343.
  8. Spencer, M., Bryant, D. and Susko, E. 2007. Conditioned Genome Reconstruction: How to Avoid Choosing the Conditioning Genome. Systematic Biology 56(1): 25–43.
  9. Bryant, D. 2004. A lower bound for the breakpoint phylogeny problem. Journal of Discrete Algorithms 2(2): 229–255.
  10. Esser, C., Ahmadinejad, N., Wiegand, C., Rotte, C., Sebastiani, F., Gelius-Dietrich, G., Henzel, K., Kretschmann, E., Richly, E., Leister, D., Bryant, D., Steel, M., Lockhart, P., Penny, D. and Martin, W.F. 2004. A genome phylogeny for mitochondria among alpha-proteobacteria and a predominantly eubacterial ancestry of yeast nuclear genes. Molecular Biology and Evolution 21: 1643–1660.
  11. Bryant, D. 2001. The complexity of calculating exemplar distances. In Comparative Genomics (Sankoff, D. and Nadeau, J.H., eds), Kluwer Academic Publishers, pp. 207–212.
  12. Sankoff, D., Deneault, M., Bryant, D., Lemieux, C. and Turmel, M. 2001. Chloroplast gene order and the divergence of plants and algae, from the normalised number of induced breakpoints. In Comparative Genomics, Kluwer Academic Publishers, pp. 89–98.
  13. El-Mabrouk, N., Bryant, D. and Sankoff, D. 2000. Reconstructing the pre-doubling genome. In Proceedings of the Third Annual International Conference on Computational Molecular Biology, pp. 154–163.
  14. Sankoff, D., Parent, M.N. and Bryant, D. 2000. Accuracy and robustness of analyses based on numbers of genes in observed segments. In Comparative Genomics, Kluwer Academic Publishers, pp. 299–306.
  15. Sankoff, D., Bryant, D., Denault, M., Lang, B.F. and Burger, G. 2000. Early eukaryote evolution based on mitochondrial gene order breakpoints. Journal of Computational Biology 7(3): 521–536.
  16. Bryant, D. 1998. The complexity of the breakpoint median problem. Technical report CRM-2579, Centre de recherches mathématiques, Université de Montréal.

Language evolution (3)

  1. Gray, R.D., Greenhill, S.J. and Bryant, D. 2010. On the shape and fabric of human history. Philosophical Transactions of the Royal Society B: Biological Sciences 365(1559): 3923–3933. [journal]
  2. Bryant, D. 2006. Radiation and network breaking in Polynesian language evolution. In Phylogenetics and the Prehistory of Languages (Forster, P. and Renfrew, C., eds).
  3. Bryant, D., Filimon, F. and Gray, R.D. 2005. Untangling our past: languages, trees, splits and networks. In The Evolution of Cultural Diversity: Phylogenetic Approaches, UCL Press, pp. 67–84.

Chickens (2)

  1. Bryant, D. 2014. Statistical flaws undermine pre-Columbian chicken debate. Proceedings of the National Academy of Sciences of the United States of America 111(35): E3584–E3584. [journal]
  2. Storey, A.A., Athens, J.S., Bryant, D., Carson, M., Emery, K., Higham, C., Huynen, L., Intoh, M., Jones, S., Kirch, P.V., Ladefoged, T., McCoy, P., Morales-Muñiz, A., Quiroz, D., Reitz, E., Robins, J., Walter, R. and Matisoo-Smith, E. 2012. Investigating the Global Dispersal of Chickens in Prehistory Using Ancient Mitochondrial DNA Signatures. PLOS ONE 7(7): e39171. [journal]

Other applications (6)

  1. Cao, Z., Bryant, D., Molteno, T., Fox, C. and Parry, M. 2021. V-Spline: An Adaptive Smoothing Spline for Trajectory Reconstruction. Sensors 21(9): 3215. [journal]
  2. Stoltz, M., Stoltz, G., Obara, K., Wang, T. and Bryant, D. 2021. Acceleration of hidden Markov model fitting using graphical processing units, with application to low-frequency tremor classification. Computers and Geosciences 156: 104902. [journal]
  3. Leigh, J.W. and Bryant, D. 2015. Monte Carlo Strategies for Selecting Parameter Values in Simulation Experiments. Systematic Biology 64(5): 741–751. [journal]
  4. Davies, T.M. and Bryant, D. 2013. On Circulant Embedding for Gaussian Random Fields in R. Journal of Statistical Software 55(9): 1–21. [journal]
  5. Siekmann, I., Wagner, L.E., Yule, D., Fox, C., Bryant, D., Crampin, E.J. and Sneyd, J. 2011. MCMC Estimation of Markov Models for Ion Channels. Biophysical Journal 100(8): 1919–1929. [journal]
  6. Krishnan, P. and Bryant, D. 1994. A digraph model for extended event structures. Technical report 1/94, Department of Computer Science, University of Canterbury.

Reviews and opinions (7)

  1. Bryant, D. and Hahn, M.W. 2020. The Concatenation Question. In Phylogenetics in the Genomic Era, Hyper Articles en Ligne.
  2. Bryant, D. 2014. Statistical flaws undermine pre-Columbian chicken debate. Proceedings of the National Academy of Sciences of the United States of America 111(35): E3584–E3584. [journal]
  3. White, D.J., Bryant, D. and Gemmell, N.J. 2013. How good are indirect tests at detecting recombination in human mtDNA?. G3: Genes, Genomes, Genetics 3(7): 1095–1104. [journal]
  4. Winkworth, R., Bryant, D., Lockhart, P.J. and Moulton, V. 2005. Biogeographic interpretation of split graphs: studying Quaternary plant diversification. Systematic Biology 54(1): 56–65.
  5. Bryant, D., Galtier, N. and Poursat, M.A. 2004. Likelihood calculation in molecular phylogenetics. In Mathematics of Evolution and Phylogeny (Gascuel, O., eds), Oxford University Press, pp. 33-62.
  6. Lapointe, F.J., Wilkinson, M. and Bryant, D. 2004. Matrix representations with parsimony or with distances? A tale of two consensus approaches. Systematic Biology 52(6): 865–869.
  7. Bryant, D. 1997. Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. Ph.D. thesis, University of Canterbury.