Evidence map›Paper›PMID 35997560›Full record

ArticleBioinformatics (Oxford, England)2022

NetTIME: a multitask and base-pair resolution framework for improved transcription factor binding site prediction.

Ren Yi, Kyunghyun Cho, Richard Bonneau

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Ren YiDepartment of Computer Science, New York University, New York, NY 10011, USA.ORCID 0000-0002-0238-3573
Kyunghyun ChoDepartment of Computer Science, New York University, New York, NY 10011, USA.
Richard BonneauDepartment of Computer Science, New York University, New York, NY 10011, USA.

Funding

Nuclear organization and its role in gene regulationR35GM122515 · NIGMS · NEW YORK UNIVERSITY SCHOOL OF MEDICINE · PI Jane Amanda Skok · 2017 to 2026
$7.1M
Spatially Resolved Dynamics of Molecular Pathology and Intercellular Interactions in Amytrophic Lateral SclerosisR01NS116350 · NINDS · NEW YORK GENOME CENTER · PI Hemali Phatnani · 2020 to 2026
$3.6M
Modeling Gene Regulatory Networks for Early Cardiopharyngeal DevelopmentR01HD096770 · NICHD · NEW YORK UNIVERSITY · PI BONNEAU, RICHARD A, CHRISTIAEN, LIONEL · 2018 to 2022
$3.0M
NICHD NIH HHS R01 HD096770NIGMS NIH HHS R35 GM122515NIH HHS R35GM122515NINDS NIH HHS R01 NS116350
6 · The paper itself

Abstract

motivationMachine learning models for predicting cell-type-specific transcription factor (TF) binding sites have become increasingly more accurate thanks to the increased availability of next-generation sequencing data and more standardized model evaluation criteria. However, knowledge transfer from data-rich to data-limited TFs and cell types remains crucial for improving TF binding prediction models because available binding labels are highly skewed towards a small collection of TFs and cell types. Transfer prediction of TF binding sites can potentially benefit from a multitask learning approach; however, existing methods typically use shallow single-task models to generate low-resolution predictions. Here, we propose NetTIME, a multitask learning framework for predicting cell-type-specific TF binding sites with base-pair resolution.

resultsWe show that the multitask learning strategy for TF binding prediction is more efficient than the single-task approach due to the increased data availability. NetTIME trains high-dimensional embedding vectors to distinguish TF and cell-type identities. We show that this approach is critical for the success of the multitask learning strategy and allows our model to make accurate transfer predictions within and beyond the training panels of TFs and cell types. We additionally train a linear-chain conditional random field (CRF) to classify binding predictions and show that this CRF eliminates the need for setting a probability threshold and reduces classification noise. We compare our method's predictive performance with two state-of-the-art methods, Catchitt and Leopard, and show that our method outperforms previous methods under both supervised and transfer learning settings. AVAILABILITY AND IMPLEMENTATION: NetTIME is freely available at https://github.com/ryi06/NetTIME and the code is also archived at https://doi.org/10.5281/zenodo.6994897. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

High-Throughput Nucleotide SequencingTranscription FactorsBase PairingBinding SitesProtein BindingTranscription Factors

Identifiers

PMID35997560
PMCPMC9563695

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.