A simple algorithm for the constrained sequence problems (Q2390246): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2103.02919 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the Longest Common Subsequence Problem / 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: A faster algorithm computing string edit distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The constrained longest common subsequence problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank | |||
Latest revision as of 20:01, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm for the constrained sequence problems |
scientific article |
Statements
A simple algorithm for the constrained sequence problems (English)
0 references
21 July 2009
0 references
constrained longest common subsequence
0 references
sequence alignment
0 references
