mlsanityData to 7 Oct 2026

Learning to Untangle Genome Assembly with Graph Convolutional Networks

arXiv 2206.00668 ↗First posted 1 Jun 2022q-bio.GN cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

A quest to determine the complete sequence of a human DNA from telomere to telomere started three decades ago and was finally completed in 2021. This accomplishment was a result of a tremendous effort of numerous experts who engineered various tools and performed laborious manual inspection to achieve the first gapless genome sequence. However, such method can hardly be used as a general approach to assemble different genomes, especially when the assembly speed is critical given the large amount of data. In this work, we explore a different approach to the central part of the genome assembly task that consists of untangling a large assembly graph from which a genomic sequence needs to be reconstructed. Our main motivation is to reduce human-engineered heuristics and use deep learning to develop more generalizable reconstruction techniques. Precisely, we introduce a new learning framework to train a graph convolutional network to resolve assembly graphs by finding a correct path through them. The training is supervised with a dataset generated from the resolved CHM13 human sequence and tested on assembly graphs built using real human PacBio HiFi reads. Experimental results show that a model, trained on simulated graphs generated solely from a single chromosome, is able to remarkably resolve all other chromosomes. Moreover, the model outperforms hand-crafted heuristics from a state-of-the-art textitde novo assembler on the same graphs. Reconstructed chromosomes with graph networks are more accurate on nucleotide level, report lower number of contigs, higher genome reconstructed fraction and NG50/NGA50 assessment metrics.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 14 of its 38 references that are in the map. First posted on arXiv 1 Jun 2022.

Builds on

14 of 38 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Benchmarking Graph Neural Networkscited by 672
  3. 2020A Generalization of Transformer Networks to Graphscited by 653
  4. 2017Residual Gated Graph ConvNetscited by 341
  5. 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 326
  6. 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 265
  7. 2020Can Graph Neural Networks Count Substructures?cited by 235
  8. 2019What graph neural networks cannot learn: depth vs widthcited by 195
  9. 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 176
  10. 2019Relational Pooling for Graph Representationscited by 150
  11. 2021The Transformer Network for the Traveling Salesman Problemcited by 59
  12. 2019A Two-Step Graph Convolutional Decoder for Molecule Generationcited by 25
2 more
  1. 2019On Learning Paradigms for the Travelling Salesman Problemcited by 24
  2. 2020A step towards neural genome assemblycited by 4

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.