John Gordon Burleigh

According to our database1, John Gordon Burleigh authored at least 27 papers between 2007 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
A Natural Language Processing Pipeline to Extract Phenotypic Data from Formal Taxonomic Descriptions with a Focus on Flagellate Plants.
Proceedings of the 9th International Conference on Biological Ontology (ICBO 2018), 2018

2015
MulRF: a software package for phylogenetic analysis using multi-copy gene trees.
Bioinform., 2015

Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis.
Proceedings of the Algorithms for Computational Biology, 2015

2014
Extracting phylogenetic signals from multi-labeled gene trees and its significance for species tree construction.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2013
Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Stability analysis of phylogenetic trees.
Bioinform., 2013

Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance.
Algorithms Mol. Biol., 2013

2012
Fast Local Search for Unrooted Robinson-Foulds Supertrees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

A scalable method for identifying frequent subtrees in sets of large phylogenetic trees.
BMC Bioinform., 2012

Consensus properties for the deep coalescence problem and their application for scalable tree search.
BMC Bioinform., 2012

Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
BMC Bioinform., 2012

Algorithms for Knowledge-Enhanced Supertrees.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

2011
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.
BMC Bioinform., 2011

An ILP solution for the gene duplication problem.
BMC Bioinform., 2011

The Deep Coalescence Consensus Tree Problem is Pareto on Clusters.
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

Algorithms for Rapid Error Correction for the Gene Duplication Problem.
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

2010
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models.
BMC Bioinform., 2010

Robinson-Foulds Supertrees.
Algorithms Mol. Biol., 2010

Scaling the Gene Duplication Problem Towards the Tree of Life.
Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

Triplet-Supertrees constructed from Minimum Triplet Presentations.
Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

Inferring species trees from gene duplication episodes.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

2009
Locating Large-Scale Gene Duplication Events through Reconciled Trees: Implications for Identifying Ancient Polyploidy Events in Plants.
J. Comput. Biol., 2009

Triplet supertree heuristics for the tree of life.
BMC Bioinform., 2009

2008
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Bioinform., 2008

Locating Multiple Gene Duplications through Reconciled Trees.
Proceedings of the Research in Computational Molecular Biology, 2008

2007
Heuristics for the Gene-Duplication Problem: A <i>Theta</i> ( <i>n</i> ) Speed-Up for the Local Search.
Proceedings of the Research in Computational Molecular Biology, 2007


  Loading...