On some properties of DNA graphs
From MaRDI portal
Publication:1961230
DOI10.1016/S0166-218X(99)00109-2zbMath0939.05078DBLPjournals/dam/BlazewiczHKW99WikidataQ57387847 ScholiaQ57387847MaRDI QIDQ1961230
Daniel Kobler, Alain Hertz, Dominique de Werra, Jacek Błażewicz
Publication date: 29 June 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (27)
On the readability of overlap digraphs ⋮ Some indices of alphabet overlap graph ⋮ Characterizations for some types of DNA graphs ⋮ On the circumference of 3-connected cubic triangle-free plane graphs ⋮ On the Readability of Overlap Digraphs ⋮ Dealing with repetitions in sequencing by hybridization ⋮ Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Classification of de Bruijn-based labeled digraphs ⋮ Complexity of DNA sequencing by hybridization. ⋮ On a generalized model of labeled graphs ⋮ DNA labelled graphs with DNA computing ⋮ A characterization of partial directed line graphs ⋮ On directed covering and domination problems ⋮ A method for constructing artificial DNA libraries based on generalized de Bruijn sequences ⋮ A polynomial time equivalence between DNA sequencing and the exact perfect matching problem ⋮ Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats ⋮ Finding Hamiltonian circuits in quasi-adjoint graphs ⋮ On the complexity of recognizing directed path families ⋮ The adjoints of DNA graphs ⋮ Computational complexity of isothermic DNA sequencing by hybridization ⋮ Sequencing by hybridization with isothermic oligonucleotide libraries ⋮ Selected combinatorial problems of computational biology ⋮ Embedding on alphabet overlap digraphs ⋮ Bipartite graphs of small readability ⋮ On a graph-theoretical model for cyclic register allocation ⋮ On Directed Covering and Domination Problems ⋮ Recognizing DNA graphs is difficult.
Cites Work
This page was built for publication: On some properties of DNA graphs
