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

A. E. Hirsh

dblp:65/4642 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 1

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
evolutionary distance estimation
0.012003
Detecting putative orthologs · Bioinform. 2003
Bioinformatics and computational biology › comparative genomics › orthology analysis
ortholog identification
0.012003
Detecting putative orthologs · Bioinform. 2003
Bioinformatics and computational biology
phylogenetics
0.012003
Detecting putative orthologs · Bioinform. 2003

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

reciprocal best BLAST hits · 0.0maximum likelihood estimation · 0.0global sequence alignment · 0.0
YearPublicationVenuePosition
2003 Detecting putative orthologs
abstract
Abstract Summary: We developed an algorithm that improves upon the common procedure of taking reciprocal best blast hits (rbh) in the identification of orthologs. The method—reciprocal smallest distance algorithm (rsd)—relies on global sequence alignment and maximum likelihood estimation of evolutionary distances to detect orthologs between two genomes. rsd finds many putative orthologs missed by rbh because it is less likely than rbh to be misled by the presence of a close paralog. Availability: A Python program and ReadMe file are freely available from: http://charles.stanford.edu/~dennis/research.html
Dennis P. Wall, H. B. Fraser, A. E. Hirsh
Bioinform.3