J. Gordon Burleigh
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j12 | Saad I. Sheikh, Tamer Kahveci, Sanjay Ranka, J. Gordon Burleigh: Stability analysis of phylogenetic trees. Bioinformatics 29(2): 166-174 (2013) | |
| 2012 | ||
| j11 | Avinash Ramu, Tamer Kahveci, J. Gordon Burleigh: A scalable method for identifying frequent subtrees in sets of large phylogenetic trees. BMC Bioinformatics 13: 256 (2012) | |
| j10 | Ruchi Chaudhary, J. Gordon Burleigh, Oliver Eulenstein: Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinformatics 13(S-10): S11 (2012) | |
| j9 | Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein: Consensus properties for the deep coalescence problem and their application for scalable tree search. BMC Bioinformatics 13(S-10): S12 (2012) | |
| j8 | Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca: Fast Local Search for Unrooted Robinson-Foulds Supertrees. IEEE/ACM Trans. Comput. Biology Bioinform. 9(4): 1004-1013 (2012) | |
| c10 | Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein: GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. ISBRA 2012: 102-114 | |
| c9 | André Wehe, J. Gordon Burleigh, Oliver Eulenstein: Algorithms for Knowledge-Enhanced Supertrees. ISBRA 2012: 263-274 | |
| i1 | Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca: Inferring Species Trees from Incongruent Multi-Copy Gene Trees Using the Robinson-Foulds Distance. CoRR abs/1210.2665 (2012) | |
| 2011 | ||
| j7 | Wen-Chieh Chang, J. Gordon Burleigh, David Fernández-Baca, Oliver Eulenstein: An ILP solution for the gene duplication problem. BMC Bioinformatics 12(S-1): S14 (2011) | |
| j6 | Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein: Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. BMC Bioinformatics 12(S-1): S15 (2011) | |
| c8 | Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein: The Deep Coalescence Consensus Tree Problem is Pareto on Clusters. ISBRA 2011: 172-183 | |
| c7 | Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca: Fast Local Search for Unrooted Robinson-Foulds Supertrees. ISBRA 2011: 184-196 | |
| c6 | Ruchi Chaudhary, J. Gordon Burleigh, Oliver Eulenstein: Algorithms for Rapid Error Correction for the Gene Duplication Problem. ISBRA 2011: 227-239 | |
| 2010 | ||
| j5 | Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, David Fernández-Baca: Robinson-Foulds Supertrees. Algorithms for Molecular Biology 5: 18 (2010) | |
| j4 | Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein: Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models. BMC Bioinformatics 11(S-1): 42 (2010) | |
| c5 | J. Gordon Burleigh, Mukul S. Bansal, Oliver Eulenstein, Todd J. Vision: Inferring species trees from gene duplication episodes. BCB 2010: 198-203 | |
| c4 | Max Homilius, John Gordon Burleigh, Oliver Eulenstein: Triplet-Supertrees constructed from Minimum Triplet Presentations. BICoB 2010: 127-132 | |
| c3 | André Wehe, John Gordon Burleigh: Scaling the Gene Duplication Problem Towards the Tree of Life. BICoB 2010: 133-138 | |
| 2009 | ||
| j3 | Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein: Triplet supertree heuristics for the tree of life. BMC Bioinformatics 10(S-1) (2009) | |
| j2 | John Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein: Locating Large-Scale Gene Duplication Events through Reconciled Trees: Implications for Identifying Ancient Polyploidy Events in Plants. Journal of Computational Biology 16(8): 1071-1083 (2009) | |
| 2008 | ||
| j1 | André Wehe, Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein: DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony. Bioinformatics 24(13): 1540-1541 (2008) | |
| c2 | J. Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein: Locating Multiple Gene Duplications through Reconciled Trees. RECOMB 2008: 273-284 | |
| 2007 | ||
| c1 | Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, André Wehe: Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search. RECOMB 2007: 238-252 | |
Colors in the list of coauthors
Last update Sat May 25 15:36:49 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page