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.
9
datasets available to search
ShareScore release 0.9.0
Dataset results
9 results for “heuristic search”
Experimental data of the paper "Trial-based Heuristic Tree Search for MDPs with Factored Action Spaces"
<p>This data set contains the code of our planner and of the planner that was used as baseline, the benchmark set that was used to perform experiments as well as the parsed values and basic reports that are reported in the paper. More information can be found in the README that is also included.</p>
Data to accompany the paper "Improved fragment-based protein structure prediction by redesign of search heuristics"
<p>This repository contains the older and newer input fragment sets and other data used for the analyses in our paper. The filenames for each tarball contain the PDB identifier of each protein along with a chain ID if applicable, followed by 'old' or 'new' for old and new fragments, respectively. Each tarball contains: a .fasta file of the input sequence, a matching PDB structure file, the relevant PSIPRED secondary structure prediction file, and the 9mer and 3mer fragment files. <br> <br> An additional tarball, ScoreRMSDplots_3protocols.tgz, contains extended versions of Figure 3 which show score and RMSD distributions clearly. Additionally, the same data is shown for equivalent experiments using the older fragment set.</p>
FIGURE 3. Maximum parsimony phylogenetic relationships with the taxon Pituna poranga removed. Heuristic search with 50 in Description of a new annual rivulid killifish genus from Venezuela
FIGURE 3. Maximum parsimony phylogenetic relationships with the taxon Pituna poranga removed. Heuristic search with 50 random additions and TBR branch swapping resulted in a single most parsimonious topology of 5706 steps. Numbers above nodes are bootstrap values based on 2000 pseudoreplicates (25 random additions each); only values over 50 are reported. Numbers below branches are Bremer support indices which are equivalent to unreversed synapomorphies.
FIGURE 2. Maximum parsimony phylogenetic hypothesis. Heuristic search with 50 in Description of a new annual rivulid killifish genus from Venezuela
FIGURE 2. Maximum parsimony phylogenetic hypothesis. Heuristic search with 50 random additions and TBR branch swapping resulted in a single most parsimonious topology of 6206 steps. Numbers above nodes are bootstrap values based on 2000 pseudoreplicates (25 random additions each); only values over 50 are reported. Numbers below branches are Bremer support indices which are equivalent to unreversed synapomorphies.
Instances and results of the paper "Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance"
Open the record for dataset details and reuse information.
Modeling System Behaviour from Log Analysis Using Meta-Heuristic Search
<p>Dataset used to perform the experiments in our paper on <em>Modeling System Behaviour from Log Analysis Using Meta-Heuristic Search </em>(BSc. thesis, 2021).</p>
FIGURE 1. Topology showing the most parsimonious tree obtained from a heuristic search with 1,000 in A new species of Microthyrium from Yunnan, China
FIGURE 1. Topology showing the most parsimonious tree obtained from a heuristic search with 1,000 random taxon additions of the combined dataset of SSU and LSU sequences alignment using PAUP v. 4.0b10. The scale bar shows 10 changes. Bootstrap support values for maximum parsimony (MP) and maximum likelihood (ML) greater than 50% above the nodes. The values below the nodes are Bayesian posterior probabilities above 0.95. Hyphen ("-") indicates a value lower than 50% (BS) or 0.90 (PP). The original isolate numbers are noted after the species names. The tree is rooted to Schismatomma decolorans.
FIGURE 1. The most parsimonious trees obtained from a heuristic search with 1000 in Phyllosticta species from banana (Musa sp.) in Chongqing and Guizhou Provinces, China
FIGURE 1. The most parsimonious trees obtained from a heuristic search with 1000 random taxon additions of the LSU sequences using PAUP v. 4.0b10. The scale bar shows 5 changes. Bootstrap support values for maximum parsimony (MP) and Bayesian posterior probabilities above 0.90are shown. A hyphens (–) indicates the value lower than 50% (BS) or 0.90 (PP). The tree is rooted to Botryosphaeria dothidea. Ex-type/ex-epitype isolates are marked by an asterisk *. Novel sequences are in boldface.
Data from: Search as a simple take-the-best heuristic
Open the record for dataset details and reuse information.
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.