David Bryant - RankMe

49 papers A* 3B 4C 2Journal 33Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	LvD: A New Algorithm for Computing the Likelihood of a Phylogeny. CoRR David Bryant, Céline Scornavacca, David Swofford
2025	J	`jnl`	Buneman graphs, partial splits and subtree distances. Discret. Appl. Math. David Bryant, Katharina T. Huber, Vincent Moulton, Andreas Spillner
2025	—	`conf`	Classification of smart films for spoilage detection in food products. CSAI Natthakan Iam-On, Tossapon Boongoen, David Bryant, Nguyen Ngoc Thanh Tien, Nhi Thi Yen Tran, Ngoc Lieu Le
2025	J	`jnl`	Subtree Distances, Tight Spans and Diversities. CoRR David Bryant, Katharina T. Huber, Vincent Moulton, Andreas Spillner
2023	J	`jnl`	Diversities and the Generalized Circumradius. Discret. Comput. Geom. David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper
2023	J	`jnl`	NeighborNet: improved algorithms and implementation. Frontiers Bioinform. David Bryant, Daniel H. Huson
2021	J	`jnl`	Acceleration of hidden Markov model fitting using graphical processing units, with application to low-frequency tremor classification. Comput. Geosci. Marnus Stoltz, Gene Stoltz, Kazushige Obara, Ting Wang, David Bryant
2021	J	`jnl`	FraïSSé Limits for Relational Metric Structures. J. Symb. Log. David Bryant, André Nies, Paul F. Tupper
2021	J	`jnl`	The Geometry of the space of Discrete Coalescent Trees. CoRR Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant, Alex Gavryushkin
2021	J	`jnl`	V-Spline: An Adaptive Smoothing Spline for Trajectory Reconstruction. Sensors Zhanglong Cao, David Bryant, Timothy C. A. Molteno, Colin Fox, Matthew Parry
2019	J	`jnl`	An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica David Bryant, Céline Scornavacca
2018	J	`jnl`	An O(n log n) time Algorithm for computing the Path-length Distance between Trees. CoRR David Bryant, Céline Scornavacca
2018	J	`jnl`	Negative type diversities, a multi-dimensional analogue of negative type metrics. CoRR Pei Wu, David Bryant, Paul F. Tupper
2017	J	`jnl`	When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. Monika Balvociute, David Bryant, Andreas Spillner
2015	J	`jnl`	Endosymbiotic origin and differential loss of eukaryotic genes. Nat. 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
2014	J	`jnl`	Diversities and the Geometry of Hypergraphs. Discret. Math. Theor. Comput. Sci. David Bryant, Paul F. Tupper
2014	J	`jnl`	The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. Céline Scornavacca, Leo van Iersel, Steven Kelk, David Bryant
2013	J	`jnl`	Diversities and the Geometry of Hypergraphs. CoRR David Bryant, Paul F. Tupper
2013	—	`ch.`	Forty Years of Model-Based Phylogeography. Models and Algorithms for Genome Evolution David Bryant, Jamie Kydd
2012	J	`jnl`	'Bureaucratic' set systems, and their role in phylogenetics. Appl. Math. Lett. David Bryant, Mike A. Steel
2012	—	`conf`	A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats. BSB Atheer A. Matroud, Christopher P. Tuffley, David Bryant, Michael D. Hendy
2009	J	`jnl`	Computing the Distribution of a Tree Metric. IEEE ACM Trans. Comput. Biol. Bioinform. David Bryant, Mike A. Steel
2007	J	`jnl`	Consistency of the Neighbor-Net Algorithm. Algorithms Mol. Biol. David Bryant, Vincent Moulton, Andreas Spillner
2007	J	`jnl`	DAVID Bioinformatics Resources: expanded annotation database and novel algorithms to better extract biology from large gene lists. Nucleic Acids Res. 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
2007	—	`ch.`	Likelihood calculation in molecular phylogenetics. Mathematics of Evolution and Phylogeny David Bryant, Nicolas Galtier, Marie-Anne Poursat
2007	J	`jnl`	Linearly independent split systems. Eur. J. Comb. David Bryant, Andreas W. M. Dress
2006	J	`jnl`	Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. David Bryant, Jens Lagergren
2005	J	`jnl`	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. 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
2005	J	`jnl`	On the Uniqueness of the Selection Criterion in Neighbor-Joining. J. Classif. David Bryant
2004	J	`jnl`	A lower bound for the breakpoint phylogeny problem. J. Discrete Algorithms David Bryant
2003	C	`conf`	Distance Corrections on Recombinant Sequences. WABI David Bryant, Daniel H. Huson, Tobias H. Klöpper, Kay Nieselt-Struwe
2002	C	`conf`	NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. WABI David Bryant, Vincent Moulton
2001	J	`jnl`	A Structured Family of Clustering and Tree Construction Methods. Adv. Appl. Math. David Bryant, Vincent Berry
2001	—	`conf`	A classification of consensus methods for phylogenetics. Bioconsensus David Bryant
2001	J	`jnl`	Constructing Optimal Trees from Quartets. J. Algorithms David Bryant, Mike A. Steel
2001	—	`conf`	The size of a maximum agreement subtree for random binary trees. Bioconsensus David Bryant, Andy McKenzie, Mike A. Steel
2000	B	`conf`	A Lower Bound for the Breakpoint Phylogeny Problem. CPM David Bryant
2000	A*	`conf`	A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang
2000	J	`jnl`	Algorithmic Aspects of Tree Amalgamation. J. Algorithms Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel
2000	A*	`conf`	Computing the quartet distance between evolutionary trees. SODA David Bryant, John Tsang, Paul E. Kearney, Ming Li
2000	J	`jnl`	Early Eukaryote Evolution Based on Mitochondrial Gene Order Breakpoints. J. Comput. Biol. David Sankoff, David Bryant, Mélanie Deneault, B. Franz Lang, Gertraud Burger
2000	B	`conf`	Early eukaryote evolution based on mitochondrial gene order breakpoints. RECOMB David Sankoff, David Bryant, Mélanie Deneault, B. Franz Lang, Gertraud Burger
2000	—	`conf`	Optimal Agreement Supertrees. JOBIM David Bryant
1999	A*	`conf`	Fast Algorithms for Constructing Optimal Trees from Quartets. SODA David Bryant, Mike A. Steel
1999	B	`conf`	Faster reliable phylogenetic analysis. RECOMB Vincent Berry, David Bryant
1999	J	`jnl`	Phylogenetic Reconstruction from Genome Order Data. Electron. Notes Discret. Math. David Bryant, David Sankoff
1999	B	`conf`	Reconstructing the pre-doubling genome. RECOMB Nadia El-Mabrouk, David Bryant, David Sankoff
1997	J	`jnl`	APPN Implementer's Workshop Closed Pages Document DLSw v2.0 Enhancements. RFC David Bryant, Paul Brittain
1996	J	`jnl`	Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration and Optimization. J. Comput. Biol. David Bryant