Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Theory and algorithms for plan merging / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4858904 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / 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: More on the complexity of common superstring and supersequence problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank | |||
Normal rank | |||
Latest revision as of 12:07, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved heuristics and a genetic algorithm for finding short supersequences |
scientific article |
Statements
Improved heuristics and a genetic algorithm for finding short supersequences (English)
0 references
13 April 1998
0 references
heuristics
0 references
genetic algorithm
0 references
shortest common supersequence
0 references
majority merge
0 references
