On some properties of DNA graphs (Q1961230): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57387847, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Monge and feasibility sequences in general flow problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Revision as of 11:09, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some properties of DNA graphs |
scientific article |
Statements
On some properties of DNA graphs (English)
0 references
29 June 2000
0 references
The authors study properties of DNA graphs, i.e. graphs where each vertex has a label of length \(k\) written with an alphabet of size \(\alpha\), where \(k\) and \(\alpha\) are parameters.
0 references
DNA
0 references
protein structure and functions
0 references
recognition algorithms
0 references
