Graph algorithms for DNA sequencing -- origins, current models and the future
type: Item
instance of: scholarly article
title: Graph algorithms for DNA sequencing -- origins, current models and the future
zbMATH Open document ID: 1375.92041
author: Marta Kasprzak
author: Michal Kierzynka
author: Wojciech Frohmberg
author: Aleksandra Swiercz
author: Piotr Zurkowski
author: Jacek Blazewicz
author: Paweł T. Wojciechowski
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 92D20
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6811960
zbMATH Keywords: DNA de novo assembly
zbMATH Keywords: graph algorithms
zbMATH Keywords: whole genome sequencing
Wikidata QID: Q57387679
describes a project that uses: Bowtie 2
describes a project that uses: ALLPATHS
describes a project that uses: GAGE
describes a project that uses: Velvet
describes a project that uses: SOAPdenovo
describes a project that uses: CUDASW++
describes a project that uses: G-DNA
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.06.043
OpenAlex ID: W2469251889
cites work: A characterization of partial directed line graphs
cites work: Q3941433
cites work: A hyper-heuristic approach to sequencing by hybridization of DNA sequences
cites work: On the recognition of de Bruijn graphs and their induced subgraphs
cites work: Sequencing by hybridization with isothermic oligonucleotide libraries
cites work: DNA sequence assembly involving an acyclic graph model
cites work: On some properties of DNA graphs
cites work: Complexity of DNA sequencing by hybridization.
cites work: Computational complexity of isothermic DNA sequencing by hybridization
cites work: Complexity issues in computational biology
cites work: Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem
cites work: Finding Hamiltonian circuits in quasi-adjoint graphs
cites work: DNA Sequencing by Hybridization via Genetic Search
cites work: Mathematical programming strategies for solving the minimum common string partition problem
cites work: Q5834367
cites work: Q4198056
cites work: The adjoints of DNA graphs
cites work: Characterizations for some types of DNA graphs
cites work: Embedding on alphabet overlap digraphs
cites work: Recognizing DNA graphs is difficult.
cites work: An Eulerian path approach to DNA fragment assembly
DOI: 10.1016/J.EJOR.2016.06.043
description: scientific article; zbMATH DE number 6811960