About the design of oligo-chips (Q1766743): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.06.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2110086970 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The longest common subsequence problem revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for finding approximate shortest common superstrings / rank | |||
Normal rank | |||
Latest revision as of 18:30, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | About the design of oligo-chips |
scientific article |
Statements
About the design of oligo-chips (English)
0 references
8 March 2005
0 references
Oligo-chip
0 references
Supersequence
0 references
Dynamical programming
0 references
