Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael E. Baker
dblp:70/6292
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · unresolved
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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis
profile hidden markov model |
0.0 | 1 | 1997 | Meta-MEME: motif-based hidden Markov models of protein families · Comput. Appl. Biosci. 1997 |
Bioinformatics and computational biology › protein sequence analysis › protein family analysis
protein family modeling |
0.0 | 1 | 1997 | Meta-MEME: motif-based hidden Markov models of protein families · Comput. Appl. Biosci. 1997 |
Bioinformatics and computational biology › protein sequence analysis
protein homology detection |
0.0 | 1 | 1997 | Meta-MEME: motif-based hidden Markov models of protein families · Comput. Appl. Biosci. 1997 |
Methods — techniques the papers use, named apart from their topics
MEME · 0.0EM algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Meta-MEME: motif-based hidden Markov models of protein familiesabstractMOTIVATION: Modeling families of related biological sequences using Hidden Markov models (HMMs), although increasingly widespread, faces at least one major problem: because of the complexity of these mathematical models, they require a relatively large training set in order to accurately recognize a given family. For families in which there are few known sequences, a standard linear HMM contains too many parameters to be trained adequately. RESULTS: This work attempts to solve that problem by generating smaller HMMs which precisely model only the conserved regions of the family. These HMMs are constructed from motif models generated by the EM algorithm using the MEME software. Because motif-based HMMs have relatively few parameters, they can be trained using smaller data sets. Studies of short chain alcohol dehydrogenases and 4Fe-4S ferredoxins support the claim that motif-based HMMs exhibit increased sensitivity and selectivity in database searches, especially when training sets contain few sequences. William Stafford Noble, Timothy L. Bailey, Charles Elkan, Michael E. Baker |
Comput. Appl. Biosci. | 4 |