On the Readability of Overlap Digraphs
From MaRDI portal
Publication:2942251
DOI10.1007/978-3-319-19929-0_11zbMath1435.05090arXiv1504.04616OpenAlexW2569135138MaRDI QIDQ2942251
Martin Milanič, Paul Medvedev, Sofya Raskhodnikova, Rayan Chikhi
Publication date: 20 August 2015
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04616
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognition of overlap graphs
- A greedy approximation algorithm for constructing shortest common superstrings
- On the recognition of de Bruijn graphs and their induced subgraphs
- Recognizing DNA graphs is difficult.
- On some properties of DNA graphs
- Embedding on alphabet overlap digraphs
- Characterizations for some types of DNA graphs
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring