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

R. Scott Winters

dblp:34/258 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2005
0000-0002-2763-2417ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2Artificial 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
3 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
biomedical text mining
0.122005
An entity tagger for recognizing acquired genomic variations in cancer literature · Bioinform. 2004
Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE · ACL 2005
Natural language and speech › Information extraction and text analysis › relation extraction
complex relation extraction
0.112005
Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE · ACL 2005
Natural language and speech › Information extraction and text analysis
relation extraction
0.112005
Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE · ACL 2005
Bioinformatics and computational biology
genomics
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis
in silico PCR
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology
sequence analysis
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology
cancer genomics
0.012004
An entity tagger for recognizing acquired genomic variations in cancer literature · Bioinform. 2004

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

maximal clique scoring · 0.1graph clustering · 0.1string matching · 0.1multithreading · 0.1conditional random field · 0.0
YearPublicationVenuePosition
2005 Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE
abstract
A complex relation is any n-ary relation in which some of the arguments may be be unspecified. We present here a simple two-stage method for extracting complex relations between named entities in text. The first stage creates a graph from pairs of entities that are likely to be related, and the second stage scores maximal cliques in that graph as potential complex relation instances. We evaluate the new method against a standard baseline for extracting genomic variation relations from biomedical text.
Ryan T. McDonald, Fernando Pereira 0003, Seth Kulick, R. Scott Winters, Peter S. White
ACL4
2004 An entity tagger for recognizing acquired genomic variations in cancer literature
abstract
Abstract Summary: VTag is an application for identifying the type, genomic location and genomic state-change of acquired genomic aberrations described in text. The application uses a machine learning technique called conditional random fields. VTag was tested with 345 training and 200 evaluation documents pertaining to cancer genetics. Our experiments resulted in 0.8541 precision, 0.7870 recall and 0.8192 F-measure on the evaluation set. Availability: The software is available at http://www.cis.upenn.edu/group/datamining/software_dist/biosfier/.
Ryan T. McDonald, R. Scott Winters, Mark A. Mandel, Peter S. White, Fernando Pereira 0003
Bioinform.2
2004 me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements
abstract
Abstract Summary: We have adapted the originally described electronic PCR (e-PCR) algorithm to perform string searches more accurately and much more rapidly than previously possible. Our implementation [multithreaded e-PCR (me-PCR)] runs sufficiently fast to allow even desktop machines to query quickly large genomes with very large genomic element sets. In addition, me-PCR is multithreaded, interprets all IUPAC nucleotide symbols, allows searches with elements specified by long sequences (such as SNPs), accepts ranges in the expected PCR size input field, requires substantially less memory for analysis of large sequences and corrects a number of minor flaws causing misreporting of hits in exceptional cases. Thus, me-PCR provides increased annotation capabilities for complex genomes to non-expert laboratories. Availability: me-PCR has been compiled for Linux, Solaris, AIX, Windows and Macintosh platforms. Both source and executable code are freely available to the research community at http://genome.chop.edu/mePCR/
Kevin Murphy 0005, Towfique Raj, R. Scott Winters, Peter S. White
Bioinform.3