New method to reconstruct individual genomes from a pangenome graph
Researchers developed ways to decompose weighted adjacency graphs into collections of linear genomes.
Scientists introduced the pangenome peeling problem. This problem seeks to decompose a weighted adjacency graph into a collection of linear genomes.
The goal is to reconstruct constituent linear genomes that underlie a pangenome. This is useful when considering ancestral pangenomes where the underlying genomes are not known.
A pangenome is represented as a set of weighted adjacencies. A weighted adjacency graph is a structure used to represent these connections.
Two reconstruction methods were presented. One method is based on the sequential addition of edges. The second method is based on extracting maximum-spanning-tree structures.
The maximum-spanning-tree approach was superior. It produced sets of constituent genomes close to the simulations. The sequential addition of edges approach yielded genomes that were increasingly divergent as genome sizes increased.
The researchers used a maximum-weight matching framework to evaluate the recovered sets. This framework used the double-cut-and-join distance with indels.
Key facts
- The pangenome peeling problem seeks to decompose a weighted adjacency graph into linear genomes.
- The maximum-spanning-tree approach produces genomes close to simulations.
- The sequential addition of edges approach produces genomes that diverge as genome sizes increase.