Recognizing DNA graphs is difficult. (Q1868714): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On some properties of DNA graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5834367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526964 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the hardness of approximating the chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI / rank | |||
Normal rank |
Latest revision as of 15:27, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recognizing DNA graphs is difficult. |
scientific article |
Statements
Recognizing DNA graphs is difficult. (English)
0 references
28 April 2003
0 references
DNA chain sequencing
0 references
Hybridization
0 references
Recognition algorithm
0 references
Computational complexity
0 references
NP-hardness
0 references
De Bruijn graph
0 references
DNA graphs
0 references
DNA computing
0 references