2007 |
20 | EE | David Bryant,
Andreas W. M. Dress:
Linearly independent split systems.
Eur. J. Comb. 28(6): 1814-1831 (2007) |
19 | EE | 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 Research 35(Web-Server-Issue): 169-175 (2007) |
2006 |
18 | EE | David Bryant,
Jens Lagergren:
Compatibility of unrooted phylogenetic trees is FPT.
Theor. Comput. Sci. 351(3): 296-302 (2006) |
2005 |
17 | EE | 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 Bioinformatics 6: 168 (2005) |
2004 |
16 | EE | David Bryant:
A lower bound for the breakpoint phylogeny problem.
J. Discrete Algorithms 2(2): 229-255 (2004) |
2003 |
15 | EE | David Bryant,
Daniel H. Huson,
Tobias H. Klöpper,
Kay Nieselt-Struwe:
Distance Corrections on Recombinant Sequences.
WABI 2003: 271-286 |
2002 |
14 | EE | David Bryant,
Vincent Moulton:
NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks.
WABI 2002: 375-391 |
2001 |
13 | | David Bryant,
Mike A. Steel:
Constructing Optimal Trees from Quartets.
J. Algorithms 38(1): 237-259 (2001) |
2000 |
12 | EE | David Bryant:
A Lower Bound for the Breakpoint Phylogeny Problem.
CPM 2000: 235-247 |
11 | EE | David Bryant:
Optimal Agreement Supertrees.
JOBIM 2000: 24-31 |
10 | EE | 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 |
9 | EE | David Bryant,
John Tsang,
Paul E. Kearney,
Ming Li:
Computing the quartet distance between evolutionary trees.
SODA 2000: 285-286 |
8 | EE | 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 |
7 | | Sebastian Böcker,
David Bryant,
Andreas W. M. Dress,
Mike A. Steel:
Algorithmic Aspects of Tree Amalgamation.
J. Algorithms 37(2): 522-537 (2000) |
6 | | David Sankoff,
David Bryant,
Mélanie Deneault,
B. Franz Lang,
Gertraud Burger:
Early Eukaryote Evolution Based on Mitochondrial Gene Order Breakpoints.
Journal of Computational Biology 7(3-4): 521-535 (2000) |
1999 |
5 | EE | Nadia El-Mabrouk,
David Bryant,
David Sankoff:
Reconstructing the pre-doubling genome.
RECOMB 1999: 154-163 |
4 | EE | Vincent Berry,
David Bryant:
Faster reliable phylogenetic analysis.
RECOMB 1999: 59-68 |
3 | EE | David Bryant,
Mike A. Steel:
Fast Algorithms for Constructing Optimal Trees from Quartets.
SODA 1999: 147-155 |
2 | EE | David Bryant,
David Sankoff:
Phylogenetic Reconstruction from Genome Order Data.
Electronic Notes in Discrete Mathematics 2: 158 (1999) |
1996 |
1 | | David Bryant:
Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration and Optimization.
Journal of Computational Biology 3(2): 275-288 (1996) |