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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Kevin L. Howe

dblp:38/4857 · also Kevin Lee Howe · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2002
0000-0002-1751-9226ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
neighbor-joining		 0.012002
QuickTree: building huge Neighbour-Joining trees of protein sequences · Bioinform. 2002
Bioinformatics and computational biology
phylogenetics		 0.012002
QuickTree: building huge Neighbour-Joining trees of protein sequences · Bioinform. 2002
Bioinformatics and computational biology › phylogenetics
phylogenetic inference		 0.012002
QuickTree: building huge Neighbour-Joining trees of protein sequences · Bioinform. 2002

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

neighbor-joining algorithm · 0.0
YearPublicationVenuePosition
2002 QuickTree: building huge Neighbour-Joining trees of protein sequences
abstract
Abstract Summary: We have written a fast implementation of the popular Neighbor-Joining tree building algorithm. QuickTree allows the reconstruction of phylogenies for very large protein families (including the largest Pfam alignment containing 27000 HIV GP120 glycoprotein sequences) that would be infeasible using other popular methods. Availability: The source-code for QuickTree, written in ANSI~C, is freely available via the world wide web at http://www.sanger.ac.uk/Software/analysis/quicktree Contact: [email protected] * To whom correspondence should be addressed.
Kevin L. Howe, Alex Bateman, Richard Durbin
 Bioinform.1