CrushSCI.com
200.4平均天数
200中位天数
156最短天数
311最长天数
222025发文量

Paper Review Records

全部论文审稿周期

14 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

217 天

Mutational signature refitting on sparse pan-cancer data

作者
Gal Gilad; Teresa M. Przytycka; Roded Sharan展开收起
作者单位
1. Blavatnik School of Computer Science and AI, Tel Aviv University, Tel Aviv, Israel; 2. National Library of Medicine (NLM), National Institutes of Health (NIH), Bethesda, USA展开收起
PDF源文件 DOI 网页
176 天

Estimation of substitution and indel rates via k -mer statistics

作者
Mahmudur Rahman Hera; Paul Medvedev; David Koslicki; Antonio Blanca展开收起
作者单位
1. Department of Computer Science and Engineering, Pennsylvania State University, University Park, USA; 2. Department of Biochemistry and Molecular Biology, Pennsylvania State University, University Park, USA; 3. Huck Institutes of the Life Sciences, Pennsylvania State University, University Park, USA; 4. Department of Biology, Pennsylvania State University, University Park, USA展开收起
PDF源文件 DOI 网页
198 天

A k-mer-based estimator of the substitution rate between repetitive sequences

作者
Haonan Wu; Antonio Blanca; Paul Medvedev展开收起
作者单位
1. Department of Computer Science and Engineering, The Pennsylvania State University, State College, USA; 2. Department of Biochemistry and Molecular Biology, The Pennsylvania State University, State College, USA; 3. Huck Institutes of the Life Sciences, The Pennsylvania State University, State College, USA展开收起
PDF源文件 DOI 网页
161 天

Haplotype-aware long-read error correction

作者
Parvesh Barak; Daniel Gibney; Chirag Jain展开收起
作者单位
1. Department of Computational and Data Sciences, Indian Institute of Science, Bangalore, India; 2. Department of Computer Science, The University of Texas at Dallas, Richardson, USA展开收起
PDF源文件 DOI 网页
156 天

Extension of partial atom-to-atom maps: uniqueness and algorithms

作者
Marcos E. González Laffitte; Tieu-Long Phan; Peter F. Stadler展开收起
作者单位
1. Center for Scalable Data Analytics and Artificial Intelligence Dresden-Leipzig (ScaDS.AI), Leipzig University, Leipzig, Germany; 2. Bioinformatics Group, Department of Computer Science and Interdisciplinary Center of Bioinformatics, Leipzig University, Leipzig, Germany; 3. Department of Mathematics and Computer Science, University of Southern Denmark, Funen, Odense, Denmark; 4. Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; 5. Institute for Theoretical Chemistry, University of Vienna, Vienna, Austria; 6. Facultad de Ciencias, Universidad National de Colombia, Bogotá, Colombia; 7. Santa Fe Institute, Santa Fe, USA展开收起
PDF源文件 DOI 网页
161 天

Lossless pangenome indexing using tag arrays

作者
Parsa Eskandar; Benedict Paten; Jouni Sirén展开收起
作者单位
1. UC Santa Cruz Genomics Institute, University of California, Santa Cruz, Santa Cruz, USA展开收起
PDF源文件 DOI 网页

FAQ

Algorithms for Molecular Biology审稿要多久?

截至2026-11-18,CrushSCI 收录了 Algorithms for Molecular Biology 的 14 篇完整审稿记录。最快一篇从收稿到录用用了 156 天(Extension of partial atom-to-atom maps: uniqueness and algorithms,2025-11-29 收稿,2026-05-04 录用),最慢一篇用了 311 天;平均 200.4 天,中位数 200 天。

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

我们会在半小时内回复。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿59.6 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

留下手机号或微信号,我们将与你确认学术润色、结构优化或一对一辅导咨询需求。

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

也可以直接发送邮件至 leader@crushsci.com

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。