A near-tight lower bound on the density of forward sampling schemes

Authors

Institutions

Publication Details

Journal
Bioinformatics
Published
2024-12-12
DOI
https://doi.org/10.1093/bioinformatics/btae736
Citations
3
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
1.04

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A near-tight lower bound on the density of forward sampling schemes

Todd J. Treangen, Bryce Kille, Ragnar Groot Koerkamp, Drake McAdams et al.
3 citations
Bioinformatics
Algorithms and Data Compression
1.04
article

A near-tight lower bound on the density of forward sampling schemes

Todd J. Treangen, Bryce Kille, Ragnar Groot Koerkamp, Drake McAdams, Alan Liu
article en
3 citations

Abstract

No abstract available for this paper.
BioinformaticsVol. 41(1)
ETH Zurich (CH), Kennedy Center (DK), Rice University (US)
National Science Foundation, National Institute of Allergy and Infectious Diseases, U.S. National Library of Medicine
Industry, innovation and infrastructure
Openalex Percentile: Top 18%
Algorithms and Data Compression
1.04
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A near-tight lower bound on the density of forward sampling schemes — Todd J. Treangen, Bryce Kille, et al. · Bioinformatics (2024) | TGRS Research Map | TGRS