Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonathan H. Badger

dblp:77/3305 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0002-5662-423XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › phylogenetics › computational phylogenetics
alignment-free phylogeny
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology
phylogenetics
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology
sequence analysis
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology › phylogenetics › phylogenomics
whole-genome phylogeny
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001

Methods — techniques the papers use, named apart from their topics

kolmogorov complexity · 0.0compression-based distance estimation · 0.0
YearPublicationVenuePosition
2008 IDEA: Interactive Display for Evolutionary Analyses
abstract
BACKGROUND: The availability of complete genomic sequences for hundreds of organisms promises to make obtaining genome-wide estimates of substitution rates, selective constraints and other molecular evolution variables of interest an increasingly important approach to addressing broad evolutionary questions. Two of the programs most widely used for this purpose are codeml and baseml, parts of the PAML (Phylogenetic Analysis by Maximum Likelihood) suite. A significant drawback of these programs is their lack of a graphical user interface, which can limit their user base and considerably reduce their efficiency. RESULTS: We have developed IDEA (Interactive Display for Evolutionary Analyses), an intuitive graphical input and output interface which interacts with PHYLIP for phylogeny reconstruction and with codeml and baseml for molecular evolution analyses. IDEA's graphical input and visualization interfaces eliminate the need to edit and parse text input and output files, reducing the likelihood of errors and improving processing time. Further, its interactive output display gives the user immediate access to results. Finally, IDEA can process data in parallel on a local machine or computing grid, allowing genome-wide analyses to be completed quickly. CONCLUSION: IDEA provides a graphical user interface that allows the user to follow a codeml or baseml analysis from parameter input through to the exploration of results. Novel options streamline the analysis process, and post-analysis visualization of phylogenies, evolutionary rates and selective constraint along protein sequences simplifies the interpretation of results. The integration of these functions into a single tool eliminates the need for lengthy data handling and parsing, significantly expediting access to global patterns in the data.
Amy Egan, Anup Mahurkar, Jonathan Crabtree, Jonathan H. Badger, Jane M. Carlton, Joana C. Silva
BMC Bioinform.4
2003 A Collapsing Method for the Efficient Recovery of Optimal Edges in Phylogenetic Trees
abstract
As the amount of sequencing efforts and genomic data volume continue to increase at an accelerated rate, phylogenetic analysis provides an evolutionary context for understanding and interpreting this growing set of complex data. We introduce a novel quartet based method for inferring molecular based phylogeny called hypercleaning* (HC*). The HC* method is based on the hypercleaning (HC) technique, which possesses an interesting property of recovering edges (of a phylogenetic tree) that are best supported by the witness quartet set. HC* extends HC in two regards: i) whereas HC constrains the input quartet set to be unweighted (binary valued), HC* allows any positive valued quartet scores, enabling more informative quartets to be defined. ii) HC* employs a novel collapsing technique which significantly speeds up the inference stage, making it empirically on par with quartet puzzling in terms of speed, while still guaranteeing optimal edge recovery as in HC. This paper is primarily aimed at presenting the algorithmic construction of HC*. We also report some preliminary studies on an implementation of HC* as a potentially powerful approximation scheme for maximum likelihood based inference.
Michael Hu, Paul E. Kearney, Jonathan H. Badger
BIBE3
2001 An information-based sequence distance and its application to whole mitochondrial genome phylogeny
abstract
MOTIVATION: Traditional sequence distances require an alignment and therefore are not directly applicable to the problem of whole genome phylogeny where events such as rearrangements make full length alignments impossible. We present a sequence distance that works on unaligned sequences using the information theoretical concept of Kolmogorov complexity and a program to estimate this distance. RESULTS: We establish the mathematical foundations of our distance and illustrate its use by constructing a phylogeny of the Eutherian orders using complete unaligned mitochondrial genomes. This phylogeny is consistent with the commonly accepted one for the Eutherians. A second, larger mammalian dataset is also analyzed, yielding a phylogeny generally consistent with the commonly accepted one for the mammals. AVAILABILITY: The program to estimate our sequence distance, is available at http://www.cs.cityu.edu.hk/~cssamk/gencomp/GenCompress1.htm. The distance matrices used to generate our phylogenies are available at http://www.math.uwaterloo.ca/~mli/distance.html.
Ming Li 0001, Jonathan H. Badger, Sam Kwong, Paul E. Kearney, Haoyong Zhang
Bioinform.2