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.

Suzanne B. Sandmeyer

dblp:18/6883 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

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
2 papers
Bioinformatics and computational biology · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › motif discovery
regulatory motif discovery
0.012000
Combinatorial motif analysis and hypothesis generation on a genomic scale · Bioinform. 2000
Data mining › structured data mining › graph mining
motif discovery
0.011999
Detecting Motifs from Sequences · ICML 1999
Data mining
pattern mining
0.011999
Detecting Motifs from Sequences · ICML 1999
Bioinformatics and computational biology
gene expression analysis
0.012000
Combinatorial motif analysis and hypothesis generation on a genomic scale · Bioinform. 2000
Parallel and multicore computing
parallel computing
0.012000
Analysis of Yeast's ORF Upstream Regions by Parallel Processing, Microarrays, and Computational Methods · ISMB 2000
Algorithms and data structures › computational biology
sequence analysis
0.011999
Detecting Motifs from Sequences · ICML 1999

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

computational methods · 0.1stochastic iterative sampling · 0.0microarrays · 0.0microarray · 0.0inductive learning · 0.0constructive induction · 0.0
YearPublicationVenuePosition
2000 Analysis of Yeast's ORF Upstream Regions by Parallel Processing, Microarrays, and Computational Methods
Steven E. Hampson, Pierre Baldi, Dennis F. Kibler, Suzanne B. Sandmeyer
ISMB4
2000 Combinatorial motif analysis and hypothesis generation on a genomic scale
abstract
MOTIVATION: Computer-assisted methods are essential for the analysis of biosequences. Gene activity is regulated in part by the binding of regulatory molecules (transcription factors) to combinations of short motifs. The goal of our analysis is the development of algorithms to identify regulatory motifs and to predict the activity of combinations of those motifs. APPROACH: Our research begins with a new motif-finding method, using multiple objective functions and an improved stochastic iterative sampling strategy. Combinatorial motif analysis is accomplished by constructive induction that analyzes potential motif combinations. The hypothesis is generated by applying standard inductive learning algorithms. RESULTS: Tests using 10 previously identified regulons from budding yeast and 14 artificial families of sequences demonstrated the effectiveness of the new motif-finding method. Motif combination and classification approaches were used in the analysis of a sample DNA array data set derived from genome-wide gene expression analysis. AVAILABILITY: Programs will be available as executable files upon request. CONTACT: [email protected] [email protected]
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Calvin McLaughlin, Dennis F. Kibler
Bioinform.2
1999 Detecting Motifs from Sequences
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
ICML2