On the use of decision diagrams for finding repetition-free longest common subsequences (Q2679779): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (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.1007/978-3-030-62867-3_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3096862630 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the use of decision diagrams for finding repetition-free longest common subsequences |
scientific article |
Statements
On the use of decision diagrams for finding repetition-free longest common subsequences (English)
0 references
25 January 2023
0 references
repetition-free longest common subsequence
0 references
decision diagram
0 references
maximum independent set
0 references
