Остановите войну!
for scientists:
default search action
David Bryant
- > Home > Persons > David Bryant
Publications
- 2023
- [j24]David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper:
Diversities and the Generalized Circumradius. Discret. Comput. Geom. 70(4): 1862-1883 (2023) - 2021
- [j23]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: 104902 (2021) - [j22]David Bryant, André Nies, Paul F. Tupper:
FraïSSé Limits for Relational Metric Structures. J. Symb. Log. 86(3): 913-934 (2021) - [i5]Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant, Alex Gavryushkin:
The Geometry of the space of Discrete Coalescent Trees. CoRR abs/2101.02751 (2021) - 2019
- [j20]David Bryant, Céline Scornavacca:
An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica 81(9): 3692-3706 (2019) - 2018
- [i4]Pei Wu, David Bryant, Paul F. Tupper:
Negative type diversities, a multi-dimensional analogue of negative type metrics. CoRR abs/1809.06523 (2018) - [i3]David Bryant, Céline Scornavacca:
An O(n log n) time Algorithm for computing the Path-length Distance between Trees. CoRR abs/1811.00619 (2018) - 2017
- [j19]Monika Balvociute, David Bryant, Andreas Spillner:
When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. 31(2): 839-856 (2017) - 2014
- [j17]David Bryant, Paul F. Tupper:
Diversities and the Geometry of Hypergraphs. Discret. Math. Theor. Comput. Sci. 16(2): 1-20 (2014) - [j16]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): 385-392 (2014) - 2013
- [i2]David Bryant, Paul F. Tupper:
Diversities and the Geometry of Hypergraphs. CoRR abs/1312.5408 (2013) - 2012
- [j15]David Bryant, Mike A. Steel:
'Bureaucratic' set systems, and their role in phylogenetics. Appl. Math. Lett. 25(8): 1148-1152 (2012) - [c13]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: 37-48 - 2009
- [j14]David Bryant, Mike A. Steel:
Computing the Distribution of a Tree Metric. IEEE ACM Trans. Comput. Biol. Bioinform. 6(3): 420-426 (2009) - 2007
- [j13]David Bryant, Vincent Moulton, Andreas Spillner:
Consistency of the Neighbor-Net Algorithm. Algorithms Mol. Biol. 2 (2007) - [j12]David Bryant, Andreas W. M. Dress:
Linearly independent split systems. Eur. J. Comb. 28(6): 1814-1831 (2007) - 2006
- [j10]David Bryant, Jens Lagergren:
Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. 351(3): 296-302 (2006) - 2003
- [c12]David Bryant, Daniel H. Huson, Tobias H. Klöpper, Kay Nieselt-Struwe:
Distance Corrections on Recombinant Sequences. WABI 2003: 271-286 - 2002
- [c11]David Bryant, Vincent Moulton:
NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. WABI 2002: 375-391 - 2001
- [j6]David Bryant, Vincent Berry:
A Structured Family of Clustering and Tree Construction Methods. Adv. Appl. Math. 27(4): 705-732 (2001) - [j5]David Bryant, Mike A. Steel:
Constructing Optimal Trees from Quartets. J. Algorithms 38(1): 237-259 (2001) - [c10]David Bryant, Andy McKenzie, Mike A. Steel:
The size of a maximum agreement subtree for random binary trees. Bioconsensus 2001: 55-65 - 2000
- [j4]Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel:
Algorithmic Aspects of Tree Amalgamation. J. Algorithms 37(2): 522-537 (2000) - [j3]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): 521-535 (2000) - [c6]David Sankoff, David Bryant, Mélanie Deneault, B. Franz Lang, Gertraud Burger:
Early eukaryote evolution based on mitochondrial gene order breakpoints. RECOMB 2000: 254-262 - [c5]David Bryant, John Tsang, Paul E. Kearney, Ming Li:
Computing the quartet distance between evolutionary trees. SODA 2000: 285-286 - [c4]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: 287-296 - 1999
- [j2]David Bryant, David Sankoff:
Phylogenetic Reconstruction from Genome Order Data. Electron. Notes Discret. Math. 2: 158 (1999) - [c3]Vincent Berry, David Bryant:
Faster reliable phylogenetic analysis. RECOMB 1999: 59-68 - [c2]Nadia El-Mabrouk, David Bryant, David Sankoff:
Reconstructing the pre-doubling genome. RECOMB 1999: 154-163 - [c1]David Bryant, Mike A. Steel:
Fast Algorithms for Constructing Optimal Trees from Quartets. SODA 1999: 147-155
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-12-18 20:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint