scientific article; zbMATH DE number 1953078
From MaRDI portal
Publication:4414481
Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorics on words (68R15)
Recommendations
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Complexity of DNA sequencing by hybridization.
- scientific article; zbMATH DE number 2239908
- Computational complexity of isothermic DNA sequencing by hybridization
- Applications of graph theory in DNA sequencing by hybridization
Cited in
(15)- scientific article; zbMATH DE number 2044948 (Why is no real title available?)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- On the readability of overlap digraphs
- scientific article; zbMATH DE number 6282157 (Why is no real title available?)
- Euler circuits and DNA sequencing by hybridization
- DNA sequence assembly involving an acyclic graph model
- Recognizing DNA graphs is difficult.
- scientific article; zbMATH DE number 2239908 (Why is no real title available?)
- Complexity of DNA sequencing by hybridization.
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
- On the Readability of Overlap Digraphs
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Applications of graph theory in DNA sequencing by hybridization
- Bipartite graphs of small readability
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414481)
