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.

Michael K. Chan

dblp:40/2875 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0002-9758-3243ORCID · reported

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence alignment › heuristic alignment
PSI-BLAST
0.112008
Simple is beautiful: a straightforward approach to improve the delineation of true and false positives in PSI-BLAST searches · Bioinform. 2008
Bioinformatics and computational biology
sequence alignment
0.112008
Simple is beautiful: a straightforward approach to improve the delineation of true and false positives in PSI-BLAST searches · Bioinform. 2008
Bioinformatics and computational biology › sequence analysis › homology detection
remote homology detection
0.012008
Simple is beautiful: a straightforward approach to improve the delineation of true and false positives in PSI-BLAST searches · Bioinform. 2008

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

profile position specific score matrix · 0.1e-value ranking · 0.1
YearPublicationVenuePosition
2008 Simple is beautiful: a straightforward approach to improve the delineation of true and false positives in PSI-BLAST searches
abstract
MOTIVATION: The deluge of biological information from different genomic initiatives and the rapid advancement in biotechnologies have made bioinformatics tools an integral part of modern biology. Among the widely used sequence alignment tools, BLAST and PSI-BLAST are arguably the most popular. PSI-BLAST, which uses an iterative profile position specific score matrix (PSSM)-based search strategy, is more sensitive than BLAST in detecting weak homologies, thus making it suitable for remote homolog detection. Many refinements have been made to improve PSI-BLAST, and its computational efficiency and high specificity have been much touted. Nevertheless, corruption of its profile via the incorporation of false positive sequences remains a major challenge. RESULTS: We have developed a simple and elegant approach to resolve the problem of model corruption in PSI-BLAST searches. We hypothesized that combining results from the first (least-corrupted) profile with results from later (most sensitive) iterations of PSI-BLAST provides a better discriminator for true and false hits. Accordingly, we have derived a formula that utilizes the E-values from these two PSI-BLAST iterations to obtain a figure of merit for rank-ordering the hits. Our verification results based on a 'gold-standard' test set indicate that this figure of merit does indeed delineate true positives from false positives better than PSI-BLAST E-values. Perhaps what is most notable about this strategy is that it is simple and straightforward to implement.
Marianne M. Lee, Michael K. Chan, Ralf Bundschuh
Bioinform.2