跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+806新增论文
+644其中 AI 相关
+92已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 11:06 — 2026-11-21 11:06(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.21859

Diversity Preservation Recovers Transcription Factor Motifs Across Challenging Confounder Landscapes

Alejandro Medina, Mary Lauren Benton

原文摘要

Motif discovery is a process where DNA sequences are searched for the short patterns, called motifs, that transcription factor (TF) proteins bind. However, the motif lengths are often unknown and motif attribution often competes with a near-identical motif of a related protein. In this work, we pair a motif genotype whose length emerges from an evolvable gate with MAP-Elites archives organized by three descriptor pairs, and validate every motif against the full HOCOMOCO database. On five liver ChIP-seq datasets spanning distinct confounder landscapes, a $(μ + λ)$ baseline differing only in survivor selection collapses onto a single motif and never ranks the target first across three datasets, while every MAP-Elites archive does so in at least 13 of 30 seeds on every dataset. Against the motif discovery tool MEME, run on the same sequences and validated identically, the archives recover the target signal as reliably on four datasets and more robustly when motif width is constrained. Neither method ranks the target above its closest relatives on HNF4A and JUND over the full width range, but narrow archive motifs rank HNF4A first in up to 43% of seeds, where MEME misses the motif in all settings. Diversity preservation improves our ability to recover consistent motif signal, although motif annotation remains a challenging problem for all methods we tested.

cs.NE · q-bio.GN