Overlap Graph for Assembling and Scaffolding Algorithms: Paradigm Review and Implementation Proposals - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Overlap Graph for Assembling and Scaffolding Algorithms: Paradigm Review and Implementation Proposals

Graphe de Chevauchements pour les Algorithmes d'Assemblage et de Scaffolding : Etat de l'Art des Paradigmes et Propositions d'Implementations

Résumé

Assembling Deoxyribonucleic Acid (DNA) fragments based on their overlaps remains the main assembly paradigm with long DNA fragments sequencing technologies, independently of the aim to resolve only one or several haplotypes. Since an overlap can be seen as a succession relationship between two oriented fragments, the directed graph structure has emerged as the more appropriate data structure for handling overlaps. However, this graph paradigm did not appear to take benefit of the reverse symmetry of the orientated fragments and their overlaps, which is a result of blind DNA doublestrand sequencing. Thus, the bi-directed graph paradigm was introduced to be the one that reduces the graph size by handling the reverse symmetry, and since becomes the mainly used graph paradigm. Nevertheless, graph paradigms have never been contrasted before, and no implementations were described. Here we make a complete review on the existing overlap graph paradigms. Furthermore, we present different implementations that are theoretically compared in terms of memory, and their impact on the design and on the time of some basic graph algorithms. We also show that by adapting close logic implementations, a graph paradigm can be switched to another.

Mots clés

Fichier principal
Vignette du fichier
revsymg_main.pdf (1.06 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03815190 , version 1 (20-10-2022)
hal-03815190 , version 2 (22-10-2022)
hal-03815190 , version 3 (26-10-2022)

Identifiants

  • HAL Id : hal-03815190 , version 3

Citer

Victor Epain. Overlap Graph for Assembling and Scaffolding Algorithms: Paradigm Review and Implementation Proposals. 2022. ⟨hal-03815190v3⟩
65 Consultations
65 Téléchargements

Partager

Gmail Facebook X LinkedIn More