David Bryant

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 10

Top Topics

Euclidean Metric

Comparative Genomics

Distance Transform

Phylogenetic Trees

Top Venues

Discret. Comput. Geom.

Publications

David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper
Diversities and the Generalized Circumradius. Discret. Comput. Geom. 70 (4) (2023)
David Bryant, Daniel H. Huson
NeighborNet: improved algorithms and implementation. Frontiers Bioinform. 3 (2023)
Zhanglong Cao, David Bryant, Timothy C. A. Molteno, Colin Fox, Matthew Parry
V-Spline: An Adaptive Smoothing Spline for Trajectory Reconstruction. Sensors 21 (9) (2021)
David Bryant, André Nies, Paul F. Tupper
FraïSSé Limits for Relational Metric Structures. J. Symb. Log. 86 (3) (2021)
Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant, Alex Gavryushkin
The Geometry of the space of Discrete Coalescent Trees. CoRR (2021)
Marnus Stoltz, Gene Stoltz, Kazushige Obara, Ting Wang, David Bryant
Acceleration of hidden Markov model fitting using graphical processing units, with application to low-frequency tremor classification. Comput. Geosci. 156 (2021)
David Bryant, Céline Scornavacca
An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica 81 (9) (2019)
David Bryant, Céline Scornavacca
An O(n log n) time Algorithm for computing the Path-length Distance between Trees. CoRR (2018)
Pei Wu, David Bryant, Paul F. Tupper
Negative type diversities, a multi-dimensional analogue of negative type metrics. CoRR (2018)
Monika Balvociute, David Bryant, Andreas Spillner
When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. 31 (2) (2017)
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
Endosymbiotic origin and differential loss of eukaryotic genes. Nat. 524 (7566) (2015)
David Bryant, Paul F. Tupper
Diversities and the Geometry of Hypergraphs. Discret. Math. Theor. Comput. Sci. 16 (2) (2014)
Céline Scornavacca, Leo van Iersel, Steven Kelk, David Bryant
The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. 18 (3) (2014)
David Bryant, Paul F. Tupper
Diversities and the Geometry of Hypergraphs. CoRR (2013)
Atheer A. Matroud, Christopher P. Tuffley, David Bryant, Michael D. Hendy
A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats. BSB (2012)
David Bryant, Mike A. Steel
'Bureaucratic' set systems, and their role in phylogenetics. Appl. Math. Lett. 25 (8) (2012)
David Bryant, Mike A. Steel
Computing the Distribution of a Tree Metric. IEEE ACM Trans. Comput. Biol. Bioinform. 6 (3) (2009)
David Bryant, Vincent Moulton, Andreas Spillner
Consistency of the Neighbor-Net Algorithm. Algorithms Mol. Biol. 2 (2007)
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
DAVID Bioinformatics Resources: expanded annotation database and novel algorithms to better extract biology from large gene lists. Nucleic Acids Res. 35 (Web-Server-Issue) (2007)
David Bryant, Andreas W. M. Dress
Linearly independent split systems. Eur. J. Comb. 28 (6) (2007)
David Bryant, Jens Lagergren
Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. 351 (3) (2006)
David Bryant
On the Uniqueness of the Selection Criterion in Neighbor-Joining. J. Classif. 22 (1) (2005)
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, Thomas A. Wynn, Charlotte Cunningham-Rundles, Donn M. Stewart, David Nelson, John N. Weinstein
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). BMC Bioinform. 6 (2005)
David Bryant
A lower bound for the breakpoint phylogeny problem. J. Discrete Algorithms 2 (2) (2004)
David Bryant, Daniel H. Huson, Tobias H. Klöpper, Kay Nieselt-Struwe
Distance Corrections on Recombinant Sequences. WABI (2003)
David Bryant, Vincent Moulton
NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. WABI (2002)
David Bryant, Mike A. Steel
Constructing Optimal Trees from Quartets. J. Algorithms 38 (1) (2001)
David Bryant
A classification of consensus methods for phylogenetics. Bioconsensus (2001)
David Bryant, Vincent Berry
A Structured Family of Clustering and Tree Construction Methods. Adv. Appl. Math. 27 (4) (2001)
David Bryant, Andy McKenzie, Mike A. Steel
The size of a maximum agreement subtree for random binary trees. Bioconsensus (2001)
David Bryant
Optimal Agreement Supertrees. JOBIM (2000)
David Sankoff, David Bryant, Mélanie Deneault, B. Franz Lang, Gertraud Burger
Early Eukaryote Evolution Based on Mitochondrial Gene Order Breakpoints. J. Comput. Biol. 7 (3-4) (2000)
Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel
Algorithmic Aspects of Tree Amalgamation. J. Algorithms 37 (2) (2000)
David Sankoff, David Bryant, Mélanie Deneault, B. Franz Lang, Gertraud Burger
Early eukaryote evolution based on mitochondrial gene order breakpoints. RECOMB (2000)
Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA (2000)
David Bryant, John Tsang, Paul E. Kearney, Ming Li
Computing the quartet distance between evolutionary trees. SODA (2000)
David Bryant
A Lower Bound for the Breakpoint Phylogeny Problem. CPM (2000)
David Bryant, David Sankoff
Phylogenetic Reconstruction from Genome Order Data. Electron. Notes Discret. Math. 2 (1999)
Nadia El-Mabrouk, David Bryant, David Sankoff
Reconstructing the pre-doubling genome. RECOMB (1999)
Vincent Berry, David Bryant
Faster reliable phylogenetic analysis. RECOMB (1999)
David Bryant, Mike A. Steel
Fast Algorithms for Constructing Optimal Trees from Quartets. SODA (1999)
David Bryant, Paul Brittain
APPN Implementer's Workshop Closed Pages Document DLSw v2.0 Enhancements. RFC 2166 (1997)
David Bryant
Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration and Optimization. J. Comput. Biol. 3 (2) (1996)