Paper Review Records
All Paper Review Records
14 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
217
days
Mutational signature refitting on sparse pan-cancer data
Authors
Gal Gilad; Teresa M. Przytycka; Roded SharanShow moreShow less
Affiliations
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, USAShow moreShow less
176
days
Estimation of substitution and indel rates via k -mer statistics
Authors
Mahmudur Rahman Hera; Paul Medvedev; David Koslicki; Antonio BlancaShow moreShow less
Affiliations
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, USAShow moreShow less
198
days
A k-mer-based estimator of the substitution rate between repetitive sequences
Authors
Haonan Wu; Antonio Blanca; Paul MedvedevShow moreShow less
Affiliations
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, USAShow moreShow less
161
days
Haplotype-aware long-read error correction
Authors
Parvesh Barak; Daniel Gibney; Chirag JainShow moreShow less
Affiliations
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, USAShow moreShow less
156
days
Extension of partial atom-to-atom maps: uniqueness and algorithms
Authors
Marcos E. González Laffitte; Tieu-Long Phan; Peter F. StadlerShow moreShow less
Affiliations
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, USAShow moreShow less
161
days
Lossless pangenome indexing using tag arrays
Authors
Parsa Eskandar; Benedict Paten; Jouni SirénShow moreShow less
Affiliations
1. UC Santa Cruz Genomics Institute, University of California, Santa Cruz, Santa Cruz, USAShow moreShow less
FAQ
How long does Algorithms for Molecular Biology take to review a manuscript?
As of 2026-11-18, CrushSCI has 14 complete review records for Algorithms for Molecular Biology. The fastest paper went from submission to acceptance in 156 days (Extension of partial atom-to-atom maps: uniqueness and algorithms, received 2025-11-29, accepted 2026-05-04); the slowest took 311 days. The average is 200.4 days and the median is 200 days.
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
