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.
15
datasets available to search
ShareScore release 0.9.0
Dataset results
15 results for “Local Search”
CG:Shop 2022 Results: SAT-Based Local Search for Plane Subgraph Partitions
<p>The results for the CG:SHOP 2022 challenge achieved by team tuwien.</p>
AI-SPRINT SPACE4AI-R Local Search
<p>This repository includes the source code and the evaluation data and results for the Local Search algorithm implemented for the SPACE4AI-R Optimizer framework. An extended discussion is reported in the AI-SPRINT project deliverable "D3.3 - Second release and evaluation of the runtime environment".</p>
The search for sexually antagonistic genes: practical insights from studies of local adaptation and statistical genomics
<p>Sexually antagonistic (SA) genetic variation—in which alleles favored in one sex are disfavored in the other—is predicted to be common and has been documented in several animal and plant populations, yet we currently know little about its pervasiveness among species or its population genetic basis. Recent applications of genomics in studies of SA genetic variation have highlighted considerable methodological challenges to the identification and characterization of SA genes, raising questions about the feasibility of genomic approaches for inferring SA selection. The related fields of local adaptation and statistical genomics have previously dealt with similar challenges, and lessons from these disciplines can therefore help overcome current difficulties in applying genomics to study SA genetic variation. Here, we integrate theoretical and analytical concepts from local adaptation and statistical genomics research—including <em>F</em><sub>ST</sub> and <em>F</em><sub>IS</sub> statistics, genome‐wide association studies, pedigree analyses, reciprocal transplant studies, and evolve‐and‐resequence experiments—to evaluate methods for identifying SA genes and genome‐wide signals of SA genetic variation. We begin by developing theoretical models for between‐sex <em>F</em><sub>ST</sub> and <em>F</em><sub>IS</sub>, including explicit null distributions for each statistic, and using them to critically evaluate putative multilocus signals of sex‐specific selection in previously published datasets. We then highlight new statistics that address some of the limitations of <em>F</em><sub>ST</sub>and <em>F</em><sub>IS</sub>, along with applications of more direct approaches for characterizing SA genetic variation, which incorporate explicit fitness measurements. We finish by presenting practical guidelines for the validation and evolutionary analysis of candidate SA genes and discussing promising empirical systems for future work.</p>
Data from: A genome‐wide search for local adaptation in a terrestrial‐breeding frog reveals vulnerability to climate change
Terrestrial‐breeding amphibians are likely to be vulnerable to warming and drying climates, as their embryos require consistent moisture for successful development. Adaptation to environmental change will depend on sufficient genetic variation existing within or between connected populations. Here, we use Single Nucleotide Polymorphism (SNP) data to investigate genome‐wide patterns in genetic diversity, gene flow and local adaptation in a terrestrial‐breeding frog (Pseudophryne guentheri) subject to a rapidly drying climate and recent habitat fragmentation. The species was sampled across 12 central and range‐edge populations (192 samples), and strong genetic structure was apparent, as were high inbreeding coefficients. Populations showed differences in genetic diversity, and one population lost significant genetic diversity in a decade. More than 500 SNP loci were putatively under directional selection, and 413 of these loci were correlated with environmental variables such as temperature, rainfall, evaporation and soil moisture. One locus showed homology to a gene involved in the activation of maturation in Xenopus oocytes, which may facilitate rapid development of embryos in drier climates. The low genetic diversity, strong population structuring and presence of local adaptation revealed in this study shows why management strategies such as targeted gene flow may be necessary to assist isolated populations to adapt to future climates.
Implementation and Results of a Randomized Local Search on the 2D Rectangular Bin Packing Problem with Item Rotation using Different Objective Functions
<p><strong><em>1. Introduction</em></strong></p> <p>In this archive, we provide the implementation and experimental results of a Randomized Local Search (RLS) applied to the two-dimensional bin packing problem without orientation (where items can be rotated by 90 degrees). As benchmark dataset, we use the <code>beng</code>, <code>A</code>, and <code>class</code> instances from <a href="https://site.unibo.it/operations-research/en/research/2dpacklib">2DPackLib</a> as well as the four non-trivial Almost Squares in Almost Squares (<a href="https://math.vu.nl/~sbhulai/publications/data_analytics2016b.pdf"><code>Asqas</code></a>) instances</p> <p>These are the data used in the paper below, which contains the exact specification of all algorithms, objective functions, and the encoding we applied.</p> <p>Rui Zhao, Tianyu Liang, Zhize Wu, Daan van den Berg, Matthias Thürer, and Thomas Weise. 2024. Randomized Local Search on the 2D Rectangular Bin Packing Problem with Item Rotation. In <em>Genetic and Evolutionary Computation Conference (GECCO'24 Companion),</em> July 14–18, 2024, Melbourne, VIC, Australia. ACM, New York, NY, USA, 4 pages. doi:<a href="https://doi.org/10.1145/3638530.3654139">10.1145/3638530.3654139</a>.</p> <p>To run the experiments, you need <a href="https://thomasweise.github.io/moptipyapps">moptipyapps</a> version 0.8.34 and <a href="https://thomasweise.github.io/moptipy">moptipy</a> version 0.9.98, which contain the actual algorithm implementations. Both packages are available on GitHub and on PyPI. However, we include several versions of them in the folder <code>source/packages</code>, just in case.</p> <p><strong><em>2. Directory Structure</em></strong></p> <p>This archive contains the following directories:</p> <ul> <li><code>source</code> contains the Python source codes needed to run the experiment.</li> <li><code>source/packages</code> contains the source codes of the Python packages with the actual algorithm implementations.</li> <li><code>data</code> is the directory with the results and their evaluation.</li> <li><code>data/results</code> is the directory with the log files generated by the experiment. In this folder, there are two sub-folders, <code>ibf1</code> and <code>ibf2</code>. We tested two different encodings, but found that the second one (<code>ibf2</code>) is too slow to do meaningful experiments. Thus, the experiments with it were abandoned and only one objective function was tested. We include <code>ibf2</code> for the sake of completeness, whereas <code>ibf1</code> was used in our paper. Either way, both <code>ibfX</code> folders contain one directory for each objective function applied to them. In each such directory, there is one folder (for the single algorithm applied) and this folder, in return, contains one folder per benchmark instance. The benchmark instance folders contain the three log files of the three runs that we applied to each instance/algorithm/objective combination.<br>Each log file contains information of one run, i.e., one execution of one algorithm on one problem instance. All improving moves of a run as well as the final solution are stored in the log file.</li> <li><code>data/evaluator</code> is the folder containing Python scripts that were used to evaluate these results. Two scripts are provided: <code>evaluator_short.py</code> was used for generating the tables used in the final paper version. <code>evaluator_full.py</code> provides larger tables, which could not be included in the final paper due to space reasons.</li> <li>Folder <code>evaluation_full</code> was generated using <code>evaluator_full.py</code> and contains tables and figures and a result summary in CSV format.</li> <li>Folder <code>evaluation_short</code> was generated using <code>evaluator_short.py</code> and contains both the tables used in the paper as well as a result summary in CSV format.</li> </ul> <p><strong><em>3. License</em></strong></p> <p>The files in this repository are under the <a href="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</a>, with the exception of the files of <a href="https://site.unibo.it/operations-research/en/research/2dpacklib">2DPackLib</a> and other benchmark datasets included, which are under copyright of their respective owner (we believe that they are in the public domain, as they are provided by many sources, included in many software packages under various open source licenses, and on many websites). The license is contained as file <code>LICENSE.txt</code> in this archive.</p> <p><strong><em>4. Contact</em></strong></p> <p>If you have any questions or suggestions, please contact</p> <p>Mr. Rui ZHAO (赵睿) of the Institute of Applied Optimization (应用优化研究所, <a href="http://iao.hfuu.edu.cn">IAO</a>) of the School of Artificial Intelligence and Big Data (<a href="http://www.hfuu.edu.cn/aibd/">人工智能与大数据学院</a>) at <a href="http://www.hfuu.edu.cn/english/">Hefei University</a> (<a href="http://www.hfuu.edu.cn/">合肥大学</a>) in Hefei, Anhui, China (中国安徽省合肥市) via email to <a href="mailto:zr1329142665@163.com">zr1329142665@163.com</a>.</p>
Instances and results of the paper "Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance"
Open the record for dataset details and reuse information.
Implementation and Results of a "Randomized Local Search for Two-Dimensional Bin Packing and a Negative Result for Frequency Fitness Assignment"
<p><strong><em>1. Introduction</em></strong></p> <p>In this archive, we provide the implementation and experimental results of a Randomized Local Search (RLS) applied to the two-dimensional bin packing problem with and without orientation. As benchmark dataset, we use the <code>beng</code>, <code>A</code>, and <code>class</code> instances from <a href="https://site.unibo.it/operations-research/en/research/2dpacklib">2DPackLib</a> as well as the four non-trivial Almost Squares in Almost Squares (<a href="https://math.vu.nl/~sbhulai/publications/data_analytics2016b.pdf"><code>Asqas</code></a>) instances</p> <p>These are the data used in the paper below, which contains the exact specification of all algorithms, objective functions, and the encoding we applied.</p> <p>Rui Zhao, Zhize Wu, Daan van den Berg, Matthias Thürer, Tianyu Liang, Ming Tan, and Thomas Weise. Randomized Local Search for Two-Dimensional Bin Packing and a Negative Result for Frequency Fitness Assignment. In <em>16th International Conference on Evolutionary Computation Theory and Applications (ECTA'24), part of the 16th International Joint Conference on Computational Intelligence (IJCCI'24)</em>. November 20-24, 2024. Porto, Portugal. Setúbal, Portugal: SciTePress.</p> <p>To run the experiments, you need <a href="https://thomasweise.github.io/moptipyapps">moptipyapps</a> and <a href="https://thomasweise.github.io/moptipy">moptipy</a>, which contain the actual algorithm implementations. Both packages are available on GitHub and on PyPI. However, we include several versions of them in the folder <code>source/packages</code>, just in case.</p> <p><strong><em>2. Directory Structure</em></strong></p> <p>This archive contains the following directories:</p> <ul> <li><code>source</code> contains the Python source codes needed to run the experiment.</li> <li><code>source/packages</code> contains the source codes of the Python packages with the actual algorithm implementations.</li> <li><code>source/experiment_execution_scripts</code> contains the scripts to run the experiments.</li> <li><code>results</code> is the directory with the results, i.e., with the log files generated by the experiment.</li> <li><code>evaluator</code> is the folder containing Python scripts that were used to evaluate these results.</li> <li><code>evaluation</code> was generated using the evaluation scripts and contains tables and figures and a result summary in CSV format.</li> </ul> <p><strong><em>3. License</em></strong></p> <p>The files in this repository are under the <a href="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</a>, with the exception of the files of <a href="https://site.unibo.it/operations-research/en/research/2dpacklib">2DPackLib</a> and other benchmark datasets included, which are under copyright of their respective owner (we believe that they are in the public domain, as they are provided by many sources, included in many software packages under various open source licenses, and on many websites). The license is contained as file <code>LICENSE.txt</code> in this archive.</p> <p><strong><em>4. Contact</em></strong></p> <p>If you have any questions or suggestions, please contact</p> <p>Mr. Rui ZHAO (赵睿) of the Institute of Applied Optimization (应用优化研究所, <a href="http://iao.hfuu.edu.cn">IAO</a>) of the School of Artificial Intelligence and Big Data (<a href="http://www.hfuu.edu.cn/aibd/">人工智能与大数据学院</a>) at <a href="http://www.hfuu.edu.cn/english/">Hefei University</a> (<a href="http://www.hfuu.edu.cn/">合肥大学</a>) in Hefei, Anhui, China (中国安徽省合肥市) via email to <a href="mailto:zr1329142665@163.com">zr1329142665@163.com</a>.</p>
Implementation and Results of a "Frequency Fitness Assignment: Optimization without Bias for Good Solution outperforms Randomized Local Search on the Quadratic Assignment Problem"
<p><strong><em>1. Introduction</em></strong></p> <p>In this archive, we provide the implementation and experimental results of a Randomized Local Search (RLS) with and without FFA applied to the Quadratic Assignment Problem. These are the data used in the paper below, which contains the exact specification of all algorithms, objective functions, and the encoding we applied.</p> <p>Jiayang Chen, Zhize Wu, Sarah L. Thomson, and Thomas Weise. Frequency Fitness Assignment: Optimization without Bias for Good Solution outperforms Randomized Local Search on the Quadratic Assignment Problem. In <em>16th International Conference on Evolutionary Computation Theory and Applications (ECTA'24), part of the 16th International Joint Conference on Computational Intelligence (IJCCI'24)</em>. November 20-24, 2024. Porto, Portugal. Setúbal, Portugal: SciTePress.</p> <p>To run the experiments, you need <a href="https://thomasweise.github.io/moptipyapps">moptipyapps</a> and <a href="https://thomasweise.github.io/moptipy">moptipy</a>, which contain the actual algorithm implementations. Both packages are available on GitHub and on PyPI. However, we include several versions of them in the folder <code>source/packages</code>, just in case.</p> <p><strong><em>2. Directory Structure</em></strong></p> <p>This archive contains the following directories:</p> <ul> <li><code>source</code> contains the Python source codes needed to run the experiment.</li> <li><code>source/packages</code> contains the source codes of the Python packages with the actual algorithm implementations.</li> <li><code>source/experiment_execution_scripts</code> contains the scripts to run the experiments.</li> <li><code>results</code> is the directory with the results, i.e., with the log files generated by the experiment.</li> <li><code>evaluator</code> is the folder containing Python scripts that were used to evaluate these results.</li> <li><code>evaluation</code> was generated using the evaluation scripts and contains tables and figures and a result summary in CSV format.</li> </ul> <p><strong><em>3. License</em></strong></p> <p>The files in this repository are under the <a href="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</a>, with the exception of the benchmark datasets included, which are under copyright of their respective owner (we believe that they are in the public domain, as they are provided by many sources, included in many software packages under various open source licenses, and on many websites). The license is contained as file <code>LICENSE.txt</code> in this archive.</p> <p><strong><em>4. Contact</em></strong></p> <p>If you have any questions or suggestions, please contact</p> <p>Mr. Jiayang CHEN (陈嘉阳) of the Institute of Applied Optimization (应用优化研究所, <a href="http://iao.hfuu.edu.cn">IAO</a>) of the School of Artificial Intelligence and Big Data (<a href="http://www.hfuu.edu.cn/aibd/">人工智能与大数据学院</a>) at <a href="http://www.hfuu.edu.cn/english/">Hefei University</a> (<a href="http://www.hfuu.edu.cn/">合肥大学</a>) in Hefei, Anhui, China (中国安徽省合肥市) via email to <a href="mailto:cjy65820607@163.com">cjy65820607@163.com</a>.</p>
Implementation and Results of a "Randomized Local Search vs. NSGA-II vs. Frequency Fitness Assignment on The Traveling Tournament Problem"
<p><strong><em>1. Introduction</em></strong></p> <p>In this archive, we provide the implementation and experimental results of a Randomized Local Search (RLS) with and without FFA as well as NSGA-II applied to the Traveling Tournament Problem. These are the data used in the paper below, which contains the exact specification of all algorithms, objective functions, and the encoding we applied.</p> <p>Cao Xiang, Zhize Wu, Daan van den Berg, and Thomas Weise. Randomized Local Search vs. NSGA-II vs. Frequency Fitness Assignment on The Traveling Tournament Problem. In <em>16th International Conference on Evolutionary Computation Theory and Applications (ECTA'24), part of the 16th International Joint Conference on Computational Intelligence (IJCCI'24)</em>. November 20-24, 2024. Porto, Portugal. Setúbal, Portugal: SciTePress.</p> <p>To run the experiments, you need <a href="https://thomasweise.github.io/moptipyapps">moptipyapps</a> and <a href="https://thomasweise.github.io/moptipy">moptipy</a>, which contain the actual algorithm implementations. Both packages are available on GitHub and on PyPI. However, we include several versions of them in the folder <code>source/packages</code>, just in case.</p> <p><strong><em>2. Directory Structure</em></strong></p> <p>This archive contains the following directories:</p> <ul> <li><code>source</code> contains the Python source codes needed to run the experiment.</li> <li><code>source/packages</code> contains the source codes of the Python packages with the actual algorithm implementations.</li> <li><code>source/experiment_execution_scripts</code> contains the scripts to run the experiments.</li> <li><code>results</code> is the directory with the results, i.e., with the log files generated by the experiment.</li> <li><code>evaluator</code> is the folder containing Python scripts that were used to evaluate these results.</li> <li><code>evaluation</code> was generated using the evaluation scripts and contains tables and figures and a result summary in CSV format.</li> </ul> <p><strong><em>3. License</em></strong></p> <p>The files in this repository are under the <a href="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</a>, with the exception of the benchmark datasets included, which are under copyright of their respective owner (we believe that they are in the public domain, as they are provided by many sources, included in many software packages under various open source licenses, and on many websites). The license is contained as file <code>LICENSE.txt</code> in this archive.</p> <p><strong><em>4. Contact</em></strong></p> <p>If you have any questions or suggestions, please contact</p> <p>Mr. Xiang CAO (曹翔) of the Institute of Applied Optimization (应用优化研究所, <a href="http://iao.hfuu.edu.cn">IAO</a>) of the School of Artificial Intelligence and Big Data (<a href="http://www.hfuu.edu.cn/aibd/">人工智能与大数据学院</a>) at <a href="http://www.hfuu.edu.cn/english/">Hefei University</a> (<a href="http://www.hfuu.edu.cn/">合肥大学</a>) in Hefei, Anhui, China (中国安徽省合肥市) via email to <a href="mailto:452015026@qq.com">452015026@qq.com</a>.</p>
A Search for Helicobacter Pylori in Localized Vulvodynia
ClinicalTrials.gov study NCT00501774. IPD Sharing: Not stated. Countries: 1. Publications: 2.
The search for sexually antagonistic genes: practical insights from studies of local adaptation and statistical genomics
Open the record for dataset details and reuse information.
Data from: A genome‐wide search for local adaptation in a terrestrial‐breeding frog reveals vulnerability to climate change
Open the record for dataset details and reuse information.
Data from: Landscape genomics in Atlantic salmon (Salmo salar): searching for gene-environment interactions driving local adaptation
A growing number of studies are examining the factors driving historical and contemporary evolution in wild populations. By combining surveys of genomic variation with a comprehensive assessment of environmental parameters, such studies can increase our understanding of the genomic and geographical extent of local adaptation in wild populations. We utilized a large-scale landscape genomics approach to examine adaptive and neutral differentiation across 54 North American populations of Atlantic salmon representing seven previously defined genetically distinct regional groups. Over 5500 genome-wide SNPs were genotyped in 641 individuals and 28 bulk assays of 25 pooled individuals each. Genome scans, linkage map and 49 environmental variables were combined to conduct an innovative landscape genomic analysis. Our results provide valuable insight into the links between environmental variation and both neutral and potentially adaptive genetic divergence. In particular, we identified markers potentially under divergent selection, as well as associated selective environmental factors and biological functions with the observed adaptive divergence. Multivariate landscape genetic analysis revealed strong associations of both genetic and environmental structures. We found an enrichment of growth related functions among outlier markers. Climate (temperature-precipitation) and geological characteristics were significantly associated with both potentially adaptive and neutral genetic divergence and should be considered as candidate loci involved in adaptation at the regional scale in Atlantic salmon. Hence, this study significantly contributes to the improvement of tools used in modern conservation and management schemes of Atlantic salmon wild populations.
Data from: Landscape genomics in Atlantic salmon (Salmo salar): searching for gene-environment interactions driving local adaptation
Open the record for dataset details and reuse information.
Search for a gene-expression signature of breast cancer local recurrence in young women
GEO Series GSE30682. Homo sapiens. 343 samples. Type: Expression profiling by array.
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.