David Bryant

According to our database, David Bryant authored at least 40 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Diversities and the Generalized Circumradius.

David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper

Discret. Comput. Geom., December, 2023

2021

V-Spline: An Adaptive Smoothing Spline for Trajectory Reconstruction.

Zhanglong Cao, David Bryant, Timothy C. A. Molteno, Colin Fox, Matthew Parry

Sensors, 2021

FraïSSé Limits for Relational Metric Structures.

David Bryant, André Nies, Paul F. Tupper

J. Symb. Log., 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, David Bryant

Comput. Geosci., 2021

The Geometry of the space of Discrete Coalescent Trees.

Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant, Alex Gavryushkin

CoRR, 2021

2019

An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees.

David Bryant, Céline Scornavacca

Algorithmica, 2019

2018

Negative type diversities, a multi-dimensional analogue of negative type metrics.

Pei Wu, David Bryant, Paul F. Tupper

CoRR, 2018

2017

When Can Splits be Drawn in the Plane?

Monika Balvociute, David Bryant, Andreas Spillner

SIAM J. Discret. Math., 2017

2015

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

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

Diversities and the Geometry of Hypergraphs.

David Bryant, Paul F. Tupper

Discret. Math. Theor. Comput. Sci., 2014

2013

Forty Years of Model-Based Phylogeography.

David Bryant, Jamie Kydd

Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012

'Bureaucratic' set systems, and their role in phylogenetics.

David Bryant, Mike A. Steel

Appl. Math. Lett., 2012

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

Proceedings of the Advances in Bioinformatics and Computational Biology, 2012

2009

Computing the Distribution of a Tree Metric.

David Bryant, Mike A. Steel

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

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

Linearly independent split systems.

David Bryant, Andreas W. M. Dress

Eur. J. Comb., 2007

Consistency of the Neighbor-Net Algorithm.

David Bryant, Vincent Moulton, Andreas Spillner

Algorithms Mol. Biol., 2007

Likelihood calculation in molecular phylogenetics.

David Bryant, Nicolas Galtier, Marie-Anne Poursat

Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006

Compatibility of unrooted phylogenetic trees is FPT.

David Bryant, Jens Lagergren

Theor. Comput. Sci., 2006

2005

On the Uniqueness of the Selection Criterion in Neighbor-Joining.

David Bryant

J. Classif., 2005

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, Thomas A. Wynn, Charlotte Cunningham-Rundles, Donn M. Stewart, David Nelson, John N. Weinstein

BMC Bioinform., 2005

2004

A lower bound for the breakpoint phylogeny problem.

David Bryant

J. Discrete Algorithms, 2004

2003

Distance Corrections on Recombinant Sequences.

David Bryant, Daniel H. Huson, Tobias H. Klöpper, Kay Nieselt-Struwe

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

2002

NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks.

David Bryant, Vincent Moulton

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

2001

Constructing Optimal Trees from Quartets.

David Bryant, Mike A. Steel

J. Algorithms, 2001

A Structured Family of Clustering and Tree Construction Methods.

David Bryant, Vincent Berry

Adv. Appl. Math., 2001

The size of a maximum agreement subtree for random binary trees.

David Bryant, Andy McKenzie, Mike A. Steel

Proceedings of the Bioconsensus, 2001

A classification of consensus methods for phylogenetics.

David Bryant

Proceedings of the Bioconsensus, 2001

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

Algorithmic Aspects of Tree Amalgamation.

Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel

J. Algorithms, 2000

Computing the quartet distance between evolutionary trees.

David Bryant, John Tsang, Paul E. Kearney, Ming Li

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).

Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Optimal Agreement Supertrees.

David Bryant

Proceedings of the Computational Biology, 2000

1999

Phylogenetic Reconstruction from Genome Order Data.

David Bryant, David Sankoff

Electron. Notes Discret. Math., 1999

Fast Algorithms for Constructing Optimal Trees from Quartets.

David Bryant, Mike A. Steel

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Reconstructing the pre-doubling genome.

Nadia El-Mabrouk, David Bryant, David Sankoff

Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

Faster reliable phylogenetic analysis.

Vincent Berry, David Bryant

Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

1997

APPN Implementer's Workshop Closed Pages Document DLSw v2.0 Enhancements.

David Bryant, Paul Brittain

RFC, June, 1997

1996

Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration and Optimization.

David Bryant

J. Comput. Biol., 1996