Demo Data from EDBT 2026 / reviewers in the wild / expert
Matthew D. Pearson
dblp:75/1902
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 › genome annotation › gene prediction
comparative gene finding |
0.1 | 1 | 2006 | Comparative Gene Prediction using Conditional Random Fields · NIPS 2006 |
Bioinformatics and computational biology › genome annotation
gene prediction |
0.1 | 1 | 2006 | Comparative Gene Prediction using Conditional Random Fields · NIPS 2006 |
Bioinformatics and computational biology › sequence analysis › sequence modeling
sequence labeling |
0.1 | 1 | 2006 | Comparative Gene Prediction using Conditional Random Fields · NIPS 2006 |
Methods — techniques the papers use, named apart from their topics
phylogenetic generalized hidden markov model · 0.1discriminative training · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Comparative Gene Prediction using Conditional Random FieldsabstractComputational gene prediction using generative models has reached a plateau, with several groups converging to a generalized hidden Markov model (GHMM) incorporating phylogenetic models of nucleotide sequence evolution. Further improvements in gene calling accuracy are likely to come through new methods that incorporate additional data, both comparative and species specific. Conditional Random Fields (CRFs), which directly model the conditional probability P (y |x) of a vector of hidden states conditioned on a set of observations, provide a unified framework for combining probabilistic and non-probabilistic information and have been shown to outperform HMMs on sequence labeling tasks in natural language processing. We describe the use of CRFs for comparative gene prediction. We implement a model that encapsulates both a phylogenetic-GHMM (our baseline comparative model) and additional non-probabilistic features. We tested our model on the genome sequence of the fungal human pathogen Cryptococcus neoformans. Our baseline comparative model displays accuracy comparable to the the best available gene prediction tool for this organism. Moreover, we show that discriminative training and the incorporation of non-probabilistic evidence significantly improve performance. Our software implementation, Conrad, is freely available with an open source license at http://www.broad.mit.edu/annotation/conrad/. Jade P. Vinson, Dave DeCaprio, Matthew D. Pearson, Stacey Luoma, James E. Galagan |
NIPS | 3 |