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

Lena Nekludova

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

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

Applied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 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%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
motif discovery
0.112006
A hypothesis-based approach for identifying the binding specificity of regulatory proteins from chromatin immunoprecipitation data · Bioinform. 2006
Bioinformatics and computational biology › gene regulation
regulatory genomics
0.112006
A hypothesis-based approach for identifying the binding specificity of regulatory proteins from chromatin immunoprecipitation data · Bioinform. 2006
Bioinformatics and computational biology › gene regulation
transcription factor binding site prediction
0.112006
A hypothesis-based approach for identifying the binding specificity of regulatory proteins from chromatin immunoprecipitation data · Bioinform. 2006
Bioinformatics and computational biology › gene regulation
transcriptional regulation analysis
0.112005
TAMO: a flexible, object-oriented framework for analyzing transcriptional regulation using DNA-sequence motifs · Bioinform. 2005
Bioinformatics and computational biology › epigenomics
ChIP-chip analysis
0.012006
A hypothesis-based approach for identifying the binding specificity of regulatory proteins from chromatin immunoprecipitation data · Bioinform. 2006

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

cross-validation · 0.1constrained local optimization · 0.1object-oriented framework · 0.1
YearPublicationVenuePosition
2006 A hypothesis-based approach for identifying the binding specificity of regulatory proteins from chromatin immunoprecipitation data
abstract
MOTIVATION: Genome-wide chromatin-immunoprecipitation (ChIP-chip) detects binding of transcriptional regulators to DNA in vivo at low resolution. Motif discovery algorithms can be used to discover sequence patterns in the bound regions that may be recognized by the immunoprecipitated protein. However, the discovered motifs often do not agree with the binding specificity of the protein, when it is known. RESULTS: We present a powerful approach to analyzing ChIP-chip data, called THEME, that tests hypotheses concerning the sequence specificity of a protein. Hypotheses are refined using constrained local optimization. Cross-validation provides a principled standard for selecting the optimal weighting of the hypothesis and the ChIP-chip data and for choosing the best refined hypothesis. We demonstrate how to derive hypotheses for proteins from 36 domain families. Using THEME together with these hypotheses, we analyze ChIP-chip datasets for 14 human and mouse proteins. In all the cases the identified motifs are consistent with the published data with regard to the binding specificity of the proteins.
Kenzie D. MacIsaac, D. Benjamin Gordon, Lena Nekludova, Duncan T. Odom, Joerg Schreiber, David K. Gifford, Richard A. Young, Ernest Fraenkel
Bioinform.3
2005 TAMO: a flexible, object-oriented framework for analyzing transcriptional regulation using DNA-sequence motifs
D. Benjamin Gordon, Lena Nekludova, Scott McCallum, Ernest Fraenkel
Bioinform.2
1987 A Parallel O(log N) Algorithm for Finding Connected Components In Planar Images
Ajit Agrawal, Lena Nekludova, Willie Lim
ICPP2