About the design of oligo-chips (Q1766743): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 19: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
