default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Gordon Burleigh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c13]Lorena Endara, J. Gordon Burleigh, Laurel Cooper, Pankaj Jaiswal, Marie-Angélique Laporte, Hong Cui:
A Natural Language Processing Pipeline to Extract Phenotypic Data from Formal Taxonomic Descriptions with a Focus on Flagellate Plants. ICBO 2018- 2015
- [j15]Ruchi Chaudhary, David Fernández-Baca, John Gordon Burleigh:
MulRF: a software package for phylogenetic analysis using multi-copy gene trees. Bioinform. 31(3): 432-433 (2015) - [c12]Ruchi Chaudhary, David Fernández-Baca, J. Gordon Burleigh:
Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis. AlCoB 2015: 97-108 - [i2]Ruchi Chaudhary, David Fernández-Baca, J. Gordon Burleigh:
Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis. CoRR abs/1503.03877 (2015) - 2014
- [c11]Ryan Cobb, Rasha Elhesha, J. Gordon Burleigh, Tamer Kahveci:
Extracting phylogenetic signals from multi-labeled gene trees and its significance for species tree construction. BCB 2014: 3-12 - 2013
- [j14]Ruchi Chaudhary, John Gordon Burleigh, David Fernández-Baca:
Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance. Algorithms Mol. Biol. 8: 28 (2013) - [j13]Saad I. Sheikh, Tamer Kahveci, Sanjay Ranka
, J. Gordon Burleigh:
Stability analysis of phylogenetic trees. Bioinform. 29(2): 166-174 (2013) - [j12]André Wehe, J. Gordon Burleigh, Oliver Eulenstein:
Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1432-1441 (2013) - 2012
- [j11]Avinash Ramu, Tamer Kahveci, J. Gordon Burleigh:
A scalable method for identifying frequent subtrees in sets of large phylogenetic trees. BMC Bioinform. 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 Bioinform. 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 Bioinform. 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. Biol. 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 Bioinform. 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 Bioinform. 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 Mol. Biol. 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 Bioinform. 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
2000 – 2009
- 2009
- [j3]Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein:
Triplet supertree heuristics for the tree of life. BMC Bioinform. 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. J. Comput. Biol. 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. Bioinform. 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
Coauthor Index
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 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
