Complexity of DNA sequencing by hybridization. (Q1401172): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57387805, #quickstatements; #temporary_batch_1709751086066 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4246781 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the recognition of de Bruijn graphs and their induced subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tabu search for DNA sequencing with false negatives and false positives / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some properties of DNA graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finding minimal length superstrings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4139697 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398382 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4315008 / rank | |||
Normal rank |
Revision as of 08:46, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of DNA sequencing by hybridization. |
scientific article |
Statements
Complexity of DNA sequencing by hybridization. (English)
0 references
17 August 2003
0 references
DNA sequencing
0 references
Computational complexity
0 references
Computational biology
0 references