On the readability of overlap digraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2016

On the readability of overlap digraphs

(1, 2, 3, 4) , (4) , (5) , (4)
1
2
3
4
5

Résumé

We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique string to each vertex such that there is an arc from x to y if and only if x properly overlaps y. The readability of D is the minimum string length for which an injective overlap labeling exists. In applications that utilize overlap digraphs (e.g., in bioinformatics), readability reflects the length of the strings from which the overlap digraph is constructed. We study the asymptotic behavior of readability by casting it in purely graph theoretic terms (without any reference to strings). We prove upper and lower bounds on readability for certain graph families and general graphs.
Fichier principal
Vignette du fichier
journal (1).pdf (305.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01729749 , version 1 (14-03-2018)

Identifiants

Citer

Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova. On the readability of overlap digraphs. Discrete Applied Mathematics, 2016, 205, pp.35-44. ⟨10.1016/j.dam.2015.12.009⟩. ⟨hal-01729749⟩
98 Consultations
105 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More