scientific article; zbMATH DE number 2044948
From MaRDI portal
Publication:4448768
zbMath1042.68643MaRDI QIDQ4448768
Rudi A. Pendavingh, Gerhard J. Woeginger, Petra Schuurman
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040296.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitygraph theoryDNA computingNP-hardnessrecognition algorithmDNA graphsDe Bruijn graph
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication:
