Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
11
datasets available to search
ShareScore release 0.9.0
Dataset results
11 results for “661k”
Compressed COBS indexes (XZ) - HQ 661k - Part 1
<p><strong>Compressed COBS indexes (XZ) - HQ 661k - v1</strong> – <a href="https://doi.org/10.5281/zenodo.6845083">part1</a>, <a href="https://doi.org/10.5281/zenodo.6849657">part2</a></p> <p>Part 1 of the compressed COBS indexes built from the high-quality assemblies of the 661k dataset. More information can be found on <a href="https://brinda.eu/mof/">https://brinda.eu/mof/</a>.</p> <p><strong>Citation:</strong></p> <blockquote> <p>K. Břinda, L. Lima, S. Pignotti, N. Quinones-Olvera, K. Salikhov, R. Chikhi, G. Kucherov, Z. Iqbal, and M. Baym, <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>Efficient and robust search of microbial genomes via phylogenetic compression</strong></a>, <em>bioRxiv</em> 2023.04.15.536996, 2023. <strong><a href="https://doi.org/10.1101/2023.04.15.536996">https://doi.org/10.1101/2023.04.15.536996</a></strong></p> </blockquote>
Compressed COBS indexes (XZ) - HQ 661k - Part 2
<p><strong>Compressed COBS indexes (XZ) - HQ 661k - v1</strong> – <a href="https://doi.org/10.5281/zenodo.6845083">part1</a>, <a href="https://doi.org/10.5281/zenodo.6849657">part2</a></p> <p>Part 2 of the compressed COBS indexes built from the high-quality assemblies of the 661k dataset. More information can be found on <a href="https://brinda.eu/mof/">https://brinda.eu/mof/</a>.</p> <p><strong>Citation:</strong></p> <blockquote> <p>K. Břinda, L. Lima, S. Pignotti, N. Quinones-Olvera, K. Salikhov, R. Chikhi, G. Kucherov, Z. Iqbal, and M. Baym, <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>Efficient and robust search of microbial genomes via phylogenetic compression</strong></a>, <em>bioRxiv</em> 2023.04.15.536996, 2023. <strong><a href="https://doi.org/10.1101/2023.04.15.536996">https://doi.org/10.1101/2023.04.15.536996</a></strong></p> </blockquote>
Compressed COBS indexes (XZ) - Full 661k - Part 2
<p><strong>Compressed COBS indexes (XZ) - Full 661k - v0.0.2</strong> – <a href="https://doi.org/10.5281/zenodo.7313926">part1</a>, <a href="https://doi.org/10.5281/zenodo.7313942">part2</a>, <a href="https://doi.org/10.5281/zenodo.7315499">part3</a></p> <p>Part 2 of the compressed COBS indexes built from all assemblies of the 661k dataset. More information can be found on <a href="https://brinda.eu/mof/">https://brinda.eu/mof/</a>.</p> <p><strong>Citation:</strong></p> <blockquote> <p>K. Břinda, L. Lima, S. Pignotti, N. Quinones-Olvera, K. Salikhov, R. Chikhi, G. Kucherov, Z. Iqbal, and M. Baym, <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>Efficient and robust search of microbial genomes via phylogenetic compression</strong></a>, <em>bioRxiv</em> 2023.04.15.536996, 2023. <strong><a href="https://doi.org/10.1101/2023.04.15.536996">https://doi.org/10.1101/2023.04.15.536996</a></strong></p> </blockquote>
Compressed COBS indexes (XZ) - Full 661k - Part 1
<p><strong>Compressed COBS indexes (XZ) - Full 661k - v0.0.2</strong> – <a href="https://doi.org/10.5281/zenodo.7313926">part1</a>, <a href="https://doi.org/10.5281/zenodo.7313942">part2</a>, <a href="https://doi.org/10.5281/zenodo.7315499">part3</a></p> <p>Part 1 of the compressed COBS indexes built from all assemblies of the 661k dataset. More information can be found on <a href="https://brinda.eu/mof/">https://brinda.eu/mof/</a>.</p> <p><strong>Citation:</strong></p> <blockquote> <p>K. Břinda, L. Lima, S. Pignotti, N. Quinones-Olvera, K. Salikhov, R. Chikhi, G. Kucherov, Z. Iqbal, and M. Baym, <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>Efficient and robust search of microbial genomes via phylogenetic compression</strong></a>, <em>bioRxiv</em> 2023.04.15.536996, 2023. <strong><a href="https://doi.org/10.1101/2023.04.15.536996">https://doi.org/10.1101/2023.04.15.536996</a></strong></p> </blockquote>
Compressed COBS indexes (XZ) - Full 661k - Part 3
<p><strong>Compressed COBS indexes (XZ) - Full 661k - v0.0.2</strong> – <a href="https://doi.org/10.5281/zenodo.7313926">part1</a>, <a href="https://doi.org/10.5281/zenodo.7313942">part2</a>, <a href="https://doi.org/10.5281/zenodo.7315499">part3</a></p> <p>Part 3 of the compressed COBS indexes built from all assemblies of the 661k dataset. More information can be found on <a href="https://brinda.eu/mof/">https://brinda.eu/mof/</a>.</p> <p><strong>Citation:</strong></p> <blockquote> <p>K. Břinda, L. Lima, S. Pignotti, N. Quinones-Olvera, K. Salikhov, R. Chikhi, G. Kucherov, Z. Iqbal, and M. Baym, <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>Efficient and robust search of microbial genomes via phylogenetic compression</strong></a>, <em>bioRxiv</em> 2023.04.15.536996, 2023. <strong><a href="https://doi.org/10.1101/2023.04.15.536996">https://doi.org/10.1101/2023.04.15.536996</a></strong></p> </blockquote>
Phylogenetically compressed 661k collection (.mbgc)
<p>Phylogenetically compressed 661k collection with MBGC as a low-level compressor. More information can be found on <a href="https://brinda.eu/mof/">https://brinda.eu/mof/</a>.</p><p>(For a more compressed version of the same files (17.5 GB, obtained by a re-compression using MBGC v2.0), see https://doi.org/10.5281/zenodo.10229555)</p><p><strong>Citation:</strong></p><blockquote><p>K. Břinda, L. Lima, S. Pignotti, N. Quinones-Olvera, K. Salikhov, R. Chikhi, G. Kucherov, Z. Iqbal, and M. Baym, <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>Efficient and robust search of microbial genomes via phylogenetic compression</strong></a>, <i>bioRxiv</i> 2023.04.15.536996, 2023. <a href="https://doi.org/10.1101/2023.04.15.536996"><strong>https://doi.org/10.1101/2023.04.15.536996</strong></a></p></blockquote>
Phylogenetically compressed meta-Fulgor indexes - HQ 661k - Part 4
<p>Part 4 of the phylogenetically compressed meta-Fulgor indexes built from the HQ 661k dataset. </p>
Phylogenetically compressed meta-Fulgor indexes - HQ 661k - Part 3
<p>Part 3 of the phylogenetically compressed meta-Fulgor indexes built from the HQ 661k dataset. </p>
Phylogenetically compressed meta-Fulgor indexes - HQ 661k - Part 2
<p>Part 2 of the phylogenetically compressed meta-Fulgor indexes built from the HQ 661k dataset. </p>
Phylogenetically compressed meta-Fulgor indexes - HQ 661k - Part 1
<p>Part 1 of the phylogenetically compressed meta-Fulgor indexes built from the HQ 661k dataset. </p>
phylogenetically compressed 661k mbgc v2.
<p>Phylogenetically compressed 661k collection with MBGC v2.0 as a low-level compressor (resulting size: 17.5 GB = 16.30 GiB). More information can be found on <a href="https://brinda.eu/mof">https://brinda.eu/mof/</a>.</p>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.