On the readability of overlap digraphs

DOI10.1016/J.DAM.2015.12.009MaRDI QIDQ266924zbMATH OpenOpenAlexFDO

Authors Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova

Publication date 7 April 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.12.009

zbMATH Keywords

bioinformaticsgraph parameteroverlap graphreadabilitystringology

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On the Readability of Overlap Digraphs
• Bipartite graphs of small readability
• Bipartite graphs of small readability
• Recognition of overlap graphs
• Embedding on alphabet overlap digraphs

Cites work

• scientific article; zbMATH DE number 2086218 (Why is no real title available?)
• scientific article; zbMATH DE number 1953078 (Why is no real title available?)
• A greedy approximation algorithm for constructing shortest common superstrings
• Characterizations for some types of DNA graphs
• Embedding on alphabet overlap digraphs
• Graph theory
• On some properties of DNA graphs
• On the recognition of de Bruijn graphs and their induced subgraphs
• Recognition of overlap graphs
• Recognizing DNA graphs is difficult.
• \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring

Cited in

(6)

• Difference Map Readability for Dynamic Graphs
• Embedding on alphabet overlap digraphs
• On the Readability of Overlap Digraphs
• Classification of de Bruijn-based labeled digraphs
• Bipartite graphs of small readability
• Bipartite graphs of small readability

This page was built for publication: On the readability of overlap digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266924)