Dataset Information

Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants.

ABSTRACT: This article proposes a benchmark instance generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. The generator is developed in C++ and does not uses external libraries, being understandable, easy-to-read, and easy-to-use. Furthermore, the generator employs five parameters that makes possible to generate personalized benchmark instances for these problems. We also describe 640 benchmark instances that were previously used in computational experiments in the literature. Lastly, we include raw results obtained from computational experiments with the described benchmark instances. We hope that the data introduced in this article can foster the development and the evaluation of new algorithms for solving constrained minimum spanning tree problems.

SUBMITTER: Carvalho IA

PROVIDER: S-EPMC10514421 | biostudies-literature | 2023 Oct

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants.

Carvalho Iago A IA Coco Amadeu A AA

Data in brief 20230907

This article proposes a benchmark instance generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. The generator is developed in C++ and does not uses external libraries, being understandable, easy-to-read, and easy-to-use. Furthermore, the generator employs five parameters that makes possible to generate personalized benchmark instances for these problems. We also describe 640 benchmark instances that ...[more]

PMID: 37743887

Similar Datasets

Project description:Identifying early and non-invasive biomarkers to detect individuals in the earliest stages of the Alzheimer's disease continuum is crucial. As a result, electrophysiology and plasma biomarkers are emerging as great candidates in this pursuit due to their low invasiveness. This is the first magnetoencephalography study to assess the relationship between minimum spanning tree parameters, an alternative to overcome the comparability and thresholding problem issues characteristic of conventional brain network analyses, and plasma phosphorylated tau231 levels in unimpaired individuals, with different risk levels of Alzheimer's disease. Seventy-six individuals with available magnetoencephalography recordings and phosphorylated tau231 plasma determination were included. The minimum spanning tree for the theta, alpha and beta bands for each subject was obtained, and the leaf fraction, tree hierarchy and diameter were calculated. To study the relationship between these topological parameters and phosphorylated tau231, we performed correlation analyses, for the whole sample and considering the two risk sub-groups separately. Increasing concentrations of phosphorylated tau231 were associated with greater leaf fraction and tree hierarchy values, along with lower diameter values, for the alpha and theta frequency bands. These results emerged for the whole sample and the higher risk group, but not for the lower risk group. Our results indicate that the network topology of cognitively unimpaired individuals with elevated plasma phosphorylated tau231 levels, a marker of Alzheimer's disease pathology and amyloid-β accumulation, is already altered, shifting towards a more integrated network increasing its vulnerability and hub-dependency, mostly in the alpha band. This is indicated by increases in leaf fraction and tree hierarchy, along with reductions in diameter. These results match the initial trajectory proposed by theoretical models of disease progression and network disruption and suggest that changes in brain function and organization begin early on.

Project description:B cell receptor (BCR) genes exposed to an antigen undergo somatic hypermutations and Darwinian antigen selection, generating a large BCR-antibody diversity. This process, known as B cell affinity maturation, increases antibody affinity, forming a specific B cell lineage that includes the unmutated ancestor and mutated variants. In a B cell lineage, cells with a higher antigen affinity will undergo clonal expansion, while those with a lower affinity will not proliferate and probably be eliminated. Therefore, cellular (genotype) abundance provides a valuable perspective on the ongoing evolutionary process. Phylogenetic tree inference is often used to reconstruct B cell lineage trees and represents the evolutionary dynamic of BCR affinity maturation. However, such methods should process B-cell population data derived from experimental sampling that might contain different cellular abundances. There are a few phylogenetic methods for tracing the evolutionary events occurring in B cell lineages; best-performing solutions are time-demanding and restricted to analysing a reduced number of sequences, while time-efficient methods do not consider cellular abundances. We propose ClonalTree, a low-complexity and accurate approach to construct B-cell lineage trees that incorporates genotype abundances into minimum spanning tree (MST) algorithms. Using both simulated and experimental data, we demonstrate that ClonalTree outperforms MST-based algorithms and achieves a comparable performance to a method that explores tree-generating space exhaustively. Furthermore, ClonalTree has a lower running time, being more convenient for building B-cell lineage trees from high-throughput BCR sequencing data, mainly in biomedical applications, where a lower computational time is appreciable. It is hundreds to thousands of times faster than exhaustive approaches, enabling the analysis of a large set of sequences within minutes or seconds and without loss of accuracy. The source code is freely available at github.com/julibinho/ClonalTree.

Dataset Information

Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants.

Publications

Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets