Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration and Optimization. - David Bryant (J. Comput. Biol., 1996)

APPN Implementer's Workshop Closed Pages Document DLSw v2.0 Enhancements. - David Bryant; Paul Brittain (RFC, 1997)

Faster reliable phylogenetic analysis. - Vincent Berry; David Bryant (RECOMB, 1999)

Reconstructing the pre-doubling genome. - Nadia El-Mabrouk; David Bryant; David Sankoff (RECOMB, 1999)

Fast Algorithms for Constructing Optimal Trees from Quartets. - David Bryant; Mike A. Steel (SODA, 1999)

Phylogenetic Reconstruction from Genome Order Data. - David Bryant; David Sankoff (Electron. Notes Discret. Math., 1999)

Optimal Agreement Supertrees. - David Bryant (JOBIM, 2000)

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). - Vincent Berry; David Bryant; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham; Haoyong Zhang (SODA, 2000)

Computing the quartet distance between evolutionary trees. - David Bryant; John Tsang; Paul E. Kearney; Ming Li 001 (SODA, 2000)

Algorithmic Aspects of Tree Amalgamation. - Sebastian Böcker; David Bryant; Andreas W. M. Dress; Mike A. Steel (J. Algorithms, 2000)

Early Eukaryote Evolution Based on Mitochondrial Gene Order Breakpoints. - David Sankoff; David Bryant; Mélanie Deneault; B. Franz Lang; Gertraud Burger (J. Comput. Biol., 2000)

A classification of consensus methods for phylogenetics. - David Bryant (Bioconsensus, 2001)

The size of a maximum agreement subtree for random binary trees. - David Bryant; Andy McKenzie; Mike A. Steel (Bioconsensus, 2001)

A Structured Family of Clustering and Tree Construction Methods. - David Bryant; Vincent Berry (Adv. Appl. Math., 2001)

Constructing Optimal Trees from Quartets. - David Bryant; Mike A. Steel (J. Algorithms, 2001)

NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. - David Bryant; Vincent Moulton (WABI, 2002)

Distance Corrections on Recombinant Sequences. - David Bryant; Daniel H. Huson; Tobias H. Klöpper; Kay Nieselt-Struwe (WABI, 2003)

A lower bound for the breakpoint phylogeny problem. - David Bryant (J. Discrete Algorithms, 2004)

High-Throughput GoMiner, an 'industrial-strength' integrative gene ontology tool for interpretation of multiple-microarray experiments, with application to studies of Common Variable Immune Deficiency (CVID). - Barry Zeeberg; Haiying Qin; Sudarshan Narasimhan; Margot Sunshine; Hong Cao; David W. Kane; Mark Reimers; Robert M. Stephens; David Bryant; Stanley K. Burt; Eldad Elnekave; Danielle M. Hari; et al. (BMC Bioinform., 2005)

On the Uniqueness of the Selection Criterion in Neighbor-Joining. - David Bryant (J. Classif., 2005)

Compatibility of unrooted phylogenetic trees is FPT. - David Bryant; Jens Lagergren (Theor. Comput. Sci., 2006)

Likelihood calculation in molecular phylogenetics. - David Bryant; Nicolas Galtier; Marie-Anne Poursat (Mathematics of Evolution and Phylogeny, 2007)

Consistency of the Neighbor-Net Algorithm. - David Bryant; Vincent Moulton; Andreas Spillner 001 (Algorithms Mol. Biol., 2007)

Linearly independent split systems. - David Bryant; Andreas W. M. Dress (Eur. J. Comb., 2007)

DAVID Bioinformatics Resources: expanded annotation database and novel algorithms to better extract biology from large gene lists. - Da Wei Huang; Brad T. Sherman; Qina Tan; Joseph Kir; David Liu; David Bryant; Yongjian Guo; Robert M. Stephens; Michael W. Baseler; H. Clifford Lane; Richard A. Lempicki (Nucleic Acids Res., 2007)

Computing the Distribution of a Tree Metric. - David Bryant; Mike A. Steel (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats. - Atheer A. Matroud; Christopher P. Tuffley; David Bryant; Michael D. Hendy (BSB, 2012)

'Bureaucratic' set systems, and their role in phylogenetics. - David Bryant; Mike A. Steel (Appl. Math. Lett., 2012)

Forty Years of Model-Based Phylogeography. - David Bryant; Jamie Kydd (Models and Algorithms for Genome Evolution, 2013)

Diversities and the Geometry of Hypergraphs. - David Bryant; Paul F. Tupper (Discret. Math. Theor. Comput. Sci., 2014)

The agreement problem for unrooted phylogenetic trees is FPT. - Céline Scornavacca; Leo van Iersel; Steven Kelk; David Bryant (J. Graph Algorithms Appl., 2014)

Endosymbiotic origin and differential loss of eukaryotic genes. - Chuan Ku; Shijulal Nelson-Sathi; Mayo Roettger; Filipa L. Sousa; Peter J. Lockhart; David Bryant; Einat Hazkani-Covo; James O. McInerney; Giddy Landan; William F. Martin (Nat., 2015)

When Can Splits be Drawn in the Plane? - Monika Balvociute; David Bryant; Andreas Spillner 001 (SIAM J. Discret. Math., 2017)

Negative type diversities, a multi-dimensional analogue of negative type metrics. - Pei Wu; David Bryant; Paul F. Tupper (CoRR, 2018)

An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. - David Bryant; Céline Scornavacca (Algorithmica, 2019)

The Geometry of the space of Discrete Coalescent Trees. - Lena Collienne; Kieran Elmes; Mareike Fischer 001; David Bryant; Alex Gavryushkin (CoRR, 2021)

Acceleration of hidden Markov model fitting using graphical processing units, with application to low-frequency tremor classification. - Marnus Stoltz; Gene Stoltz; Kazushige Obara; Ting Wang 002; David Bryant (Comput. Geosci., 2021)

FraïSSé Limits for Relational Metric Structures. - David Bryant; André Nies; Paul F. Tupper (J. Symb. Log., 2021)

V-Spline: An Adaptive Smoothing Spline for Trajectory Reconstruction. - Zhanglong Cao; David Bryant; Timothy C. A. Molteno; Colin Fox; Matthew Parry (Sensors, 2021)

NeighborNet: improved algorithms and implementation. - David Bryant; Daniel H. Huson (Frontiers Bioinform., 2023)

Diversities and the Generalized Circumradius. - David Bryant; Katharina T. Huber; Vincent Moulton; Paul F. Tupper (Discret. Comput. Geom., 2023)

Buneman graphs, partial splits and subtree distances. - David Bryant; Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (Discret. Appl. Math., 2025)

Subtree Distances, Tight Spans and Diversities. - David Bryant; Katharina T. Huber; Vincent Moulton; Andreas Spillner 001 (CoRR, 2025)