Comparison of Execution Time for Variant Calling Algorithms

Dong-Jun Lee published a dataset comparing the execution time of variant calling algorithms. The dataset is stored in an XLS file with a size of 5.5 KB and was last updated on June 1, 2026. It is shared under a CC-BY-4.0 license on the figshare platform.

Use Cases

• Benchmarking computational efficiency based on execution time comparisons.
• Selecting appropriate variant calling tools for time-sensitive projects based on performance data.
• Designing computational workflows by considering the runtime trade-offs of different algorithms.

Strengths

• Dataset has a specific, well-defined focus on comparing algorithm execution times.
• The 5.5 KB file size indicates a compact, focused dataset that is quick to download and inspect.
• It is published under a permissive CC-BY-4.0 license, allowing for broad reuse.

Limitations

• Description metadata is limited; actual data quality requires manual inspection after download.
• Row count is unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.

Provenance

Source

Dong-Jun Lee via figshare

Freshness

Last updated 2026-06-01 17:58:35; freshness should be verified.