To understand why GraTools matters, it helps to understand what a pangenome variation graph actually is. Traditional genomics has relied on a single reference genome, against which the genomes of individuals or varieties are compared. That approach works well enough when the population is closely related to the reference, but it systematically distorts our view of species that carry large amounts of variation. Sequences absent from the reference simply vanish from the analysis, and alignments involving insertions, inversions and other structural changes become cumbersome. A pangenome variation graph, or PVG, sidesteps this problem by representing the genomes of many individuals simultaneously as a graph, in which shared sequences form common paths and variable regions branch into alternative paths. The result is a single data structure that captures the full spectrum of genomic diversity within a species, from the core genome shared by everyone to the dispensable genome present in only some individuals.

The catch has always been usability. Building such graphs has become increasingly tractable thanks to graph construction pipelines, but once the graph exists, working with it is another matter. Existing tools for querying and manipulating PVGs tend to be scattered across different software packages, each with its own input formats, and researchers frequently find themselves converting files back and forth between formats before any analysis can proceed. These conversions are not merely annoying; they consume time, introduce opportunities for error, and often prove computationally expensive when graphs grow to represent dozens or hundreds of genomes. The authors of GraTools identified this lack of integration and efficiency as the central bottleneck hindering the wider adoption of graph-based pangenomics, and they designed their tool specifically to eliminate it.

GraTools takes a deliberately pragmatic approach. Its input is the GFA file, the standard Graphical Fragment Assembly format in which pangenome variation graphs are typically produced, and it works directly on that original file rather than requiring researchers to transform it into intermediate representations. The workflow begins with a one-time graph import, during which GraTools converts the graph data into standard formats, namely BAM and BED, that are already supported by a mature ecosystem of highly optimised bioinformatics tools. This design decision is central to the tool’s philosophy: rather than reinventing indexing and querying infrastructure, GraTools leverages what already works best, storing the graph-derived data in formats that allow efficient storage and rapid querying of even large and complex graph structures.

Once the import is complete, the tool opens up a range of downstream operations that can be executed rapidly and repeatedly. Users can extract subgraphs corresponding to regions of interest, retrieve the underlying DNA sequences in FASTA format, and run comprehensive analyses such as calculating the ratio between the core and dispensable genome, a fundamental statistic in pangenomics that describes how much of the species’ genetic repertoire is universal versus optional. GraTools can also identify group-specific segments, meaning stretches of sequence found exclusively in particular subsets of individuals, which is exactly the kind of signal breeders and population geneticists look for when hunting for markers associated with subspecies identity, adaptation or agronomic traits. Crucially, all of this is done through an intuitive command-line interface that provides real-time execution feedback and a detailed logging system, so users always know what the tool is doing and can audit their analyses afterwards.

Scalability was a clear engineering priority. Pangenome graphs are among the largest data structures in modern genomics, and a tool that grinds to a halt on realistic datasets would be of little use. GraTools therefore employs a modular architecture that supports parallel processing and asynchronous input-output operations, allowing it to take full advantage of modern multi-core computing environments. The authors acknowledge the ISO 9001 certified IRD i-Trop HPC facility in Montpellier and the Core Cluster of the Institut Français de Bioinformatique as the computing resources on which the work was performed, a hint that the tool was developed and tested in a genuine high-performance setting rather than only on toy examples.

Another technically significant feature is GraTools’ handling of coordinate systems. In a pangenome graph, positions can be defined relative to the primary reference genome or relative to alternative genomes embedded within the graph, and switching between these perspectives has traditionally required additional processing. GraTools supports coordinates defined on both the primary reference and the alternative genomes within the graph without requiring the user to re-import the data, which means researchers can move fluidly between reference-based and graph-based views of their regions of interest. The tool’s outputs, meanwhile, are deliberately designed to be compatible with external software, so that results can be visualised or further manipulated using the visualisation and analysis tools researchers already have in their pipelines.

The demonstration case study will resonate with anyone working in crop genomics. The team applied GraTools to an Asian rice pangenome graph comprising 13 accessions, a dataset representative of the scale at which many research groups currently operate. Using this graph, they showed that GraTools could easily extract subgraphs, compute depth statistics across the graph structure, and identify segments specific to rice subspecies. Rice is one of the world’s most important staple crops and a model species for pangenome research, with indica and japonica subspecies carrying substantial differentiated sequence content, so the ability to pull out subspecies-specific segments directly from a graph, without elaborate format juggling, illustrates the practical value of the tool for real biological questions in breeding and diversity studies.

The potential applications extend well beyond rice. Because pangenome variation graphs are now being built for humans, livestock, pathogens and countless plant species, a general-purpose manipulation tool has relevance across population genetics, breeding and even genomic medicine, where graph-based representations are increasingly used to capture human diversity more faithfully than a single reference can. The authors position GraTools as suitable for both biologists and bioinformaticians, and its combination of an accessible command-line interface, transparent logging and standard-format outputs lowers the barrier for experimental groups that lack dedicated graph-genomics specialists. The fact that the software is open source under GNU GPLv3, with documentation hosted at gratools.readthedocs.io, should further encourage adoption and community contributions.

GraTools arrives at a moment when pangenomics is shifting from a specialist pursuit to a mainstream expectation. Major pangenome projects across multiple species have demonstrated that single references underrepresent true diversity, and funders and journals increasingly expect analyses that account for it. What has been missing is the connective tissue between graph construction and graph interpretation, and this is precisely the gap GraTools fills. By unifying subgraph extraction, sequence retrieval, core and dispensable genome statistics and group-specific segment detection behind a single, fast interface built on standard file formats, the tool offers what the authors describe as an interesting alternative to existing approaches for manipulating PVGs, facilitating rapid, efficient and flexible downstream analyses. For a field whose growth has been throttled less by ideas than by plumbing, that plumbing fix may prove to be the most consequential contribution of all.

Subject of Research: A software tool for exploring and manipulating pangenome variation graphs

Article Title: GraTools, a user-friendly tool for exploring and manipulating pangenome variation graphs

Article References: Ravel, S., Marthe, N., Carrette, C., Mohamed, M., Sabot, F., & Tranchant-Dubreuil, C. (2026). GraTools, a user-friendly tool for exploring and manipulating pangenome variation graphs. BMC Bioinformatics. https://doi.org/10.1186/s12859-026-06657-z

Image Credits: AI Generated

DOI: 10.1186/s12859-026-06657-z

Keywords: pangenome, variation graph, bioinformatics, GFA format, core genome, dispensable genome, subgraph extraction, rice pangenome, genomic diversity, open-source software, population genetics, plant breeding

A team of researchers from the University of Alicante and the Universidad Politécnica de Cartagena in Spain has now proposed a way out of this trap. In an open-access paper published in Complex & Intelligent Systems, Carla Piñol, Manuel Curado, Jose F. Vicent, Leandro Tortosa and Antonio J. Banegas-Luna introduce return random walk kinship, or RRWK, a density-aware framework for extracting subgraphs that remains robust precisely where existing methods degrade. The work does not merely offer another heuristic; the authors also derive structural and computational bounds for their method, giving the field a principled account of how the extraction behaves as networks grow denser and larger. The result is a technique that, according to their experiments on both synthetic and real-world datasets, preserves the structural properties of the original graph more faithfully than state-of-the-art baselines while keeping computational costs competitive.

To appreciate why density is such a problem, it helps to look at how subgraph extraction is currently done. The most widespread strategy is the enclosing subgraph: given a target node, the algorithm collects its immediate neighbors, then the neighbors of those neighbors, and so on, up to some fixed number of hops. In a sparse network this works beautifully, because each expansion adds only a handful of new nodes. In a dense network, however, the first hop alone can sweep in an enormous crowd. A node with thousands of direct connections drags all of them into the subgraph, and by the second hop the extracted region may encompass most of the network. The computational burden explodes, and worse, the resulting structure is so diluted that the local organization of the graph, the fine-grained pattern of relationships that machine learning models need in order to reason about the target node, is effectively washed out.

A more recent line of work reformulated the problem as a local clustering procedure based on personalized PageRank, the famous algorithm behind web search that measures the importance of nodes by simulating random surfers who occasionally teleport back to a starting point. Applied to subgraph extraction, personalized PageRank assigns each node a probability of being reached by a walker that starts at the target and keeps stumbling through the network, and the highest-probability nodes are gathered into the subgraph. This approach produced better results than naive hop-based expansion, because it weighs nodes by their actual reachability rather than their raw distance. Yet the Spanish team identified a critical limitation: the quality of personalized PageRank extraction is itself sensitive to density. In highly connected networks, the walker’s probability mass spreads so widely that the extracted subgraph again loses cohesion, confining the method’s usefulness to networks of medium to low density.

RRWK attacks the problem from a different angle, built on a deceptively simple observation: what makes a node structurally kin to a target is not just that a random walk can reach it, but that the walk can come back. The framework is based on bounded outbound and return random-walk connectivity. Starting from a target node, the method sends out random walks of bounded length, but instead of scoring nodes solely by how often they are visited on the way out, it evaluates the connectivity of return paths, the alternative routes by which a walker can find its way back to the starting region. Nodes that participate in many return paths are, in a well-defined sense, woven into the same fabric as the target. They are not merely reachable; they are mutually reinforcing parts of a cohesive structure.

This return-path perspective is what gives RRWK its density resistance. In a dense network, the sheer number of alternative routes between two nodes is exactly what causes other methods to fail, because the neighborhood expansion becomes unmanageable. But for a return-walk-based measure, those alternative routes are signal rather than noise: they are the evidence that two nodes belong to the same structurally cohesive region. By exploiting alternative return paths, RRWK jointly captures local and global organizational properties of the graph. The local property is the tight clustering of immediate neighbors; the global property is the way those clusters are anchored in the wider topology through redundant connectivity. Conventional enclosing-subgraph and personalized PageRank strategies, the authors argue, cannot hold both of these at once as density rises, whereas RRWK is specifically designed to maintain structural robustness in that regime.

A distinguishing feature of the paper is that it does not stop at an empirical demonstration. The researchers carry out a formal study of the structural and computational bounds of the proposed method, characterizing how the size and fidelity of the extracted subgraphs scale with the parameters of the random walks and with the density of the host graph. This kind of analysis matters for practitioners, because subgraph extraction sits at the base of the machine learning pipeline: if the extraction step is unpredictable, everything built on top of it inherits that unpredictability. By establishing bounds, the authors provide guarantees about the tractability of RRWK, showing that the method maintains competitive computational performance even in dense graph scenarios where competing approaches become computationally intractable or structurally meaningless.

The experimental evaluation spans both synthetic and real-world datasets, a combination that lets the authors isolate the effect of density in controlled settings while also demonstrating practical relevance. On synthetic networks, where the ground-truth community structure is known by construction, the team could measure precisely how well each method’s extracted subgraphs preserved the structural properties of the original graph as density was dialed up. On real-world datasets, the same fidelity question was asked in messier, more realistic conditions. Across both regimes, the reported outcome is consistent: RRWK preserves the structural properties of the original graph more accurately than state-of-the-art subgraph extraction baselines, with the advantage growing precisely in the dense regimes where the baselines falter, while its runtime remains competitive.

The implications reach well beyond graph theory. Link prediction, the task of guessing which connections will appear next in an evolving network, underlies friend recommendations, drug target discovery and knowledge graph completion, and it typically relies on subgraph extraction around candidate node pairs. If the extraction collapses in dense networks, the predictions built on it degrade silently. A method that stays structurally faithful under density could therefore sharpen a wide range of downstream applications, from analyzing densely connected biological interaction networks to studying financial systems where connectivity is high by design. The authors’ framing of subgraph extraction as a density-sensitive operation, rather than a solved preprocessing step, is itself a contribution that may redirect attention across the field.

The paper, which was received in April 2025, accepted in July 2026 and published in September 2026 under open access terms, was supported by Grant PID2025-175296OB-I00 funded by MICIU/AEI. Its authors span two Spanish institutions, with the core team at the Department of Computer Science and Artificial Intelligence in Alicante and a collaborator at the Centro Universitario de la Defensa in San Javier. As dense graphs become the norm rather than the exception, with ever-larger portions of science and commerce encoded as highly connected relational data, tools like RRWK address a bottleneck that will only tighten. By grounding a practical extraction algorithm in the mathematics of return random walks and backing it with explicit structural and computational bounds, the researchers have offered the graph machine learning community something rarer than a new benchmark win: a clearer understanding of when and why subgraph extraction works at all.

Subject of Research: Density-aware subgraph extraction from dense graphs using bounded outbound and return random-walk connectivity

Article Title: RRWK: structural and computational bounds for dense graph subgraph extraction

Article References: Piñol, C., Curado, M., Vicent, J. F., Tortosa, L., & Banegas-Luna, A. J. (2026). RRWK: structural and computational bounds for dense graph subgraph extraction. Complex & Intelligent Systems. https://doi.org/10.1007/s40747-026-02453-7

Image Credits: AI Generated

DOI: 10.1007/s40747-026-02453-7

Keywords: subgraph extraction, dense graphs, random walks, graph representation learning, personalized PageRank, link prediction, structural preservation, complex networks, graph theory, machine learning, computational bounds, RRWK