Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_119 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1585123441 / rank | |||
Normal rank | |||
Latest revision as of 03:47, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model |
scientific article |
Statements
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (English)
0 references
17 December 2009
0 references
consistent superstring
0 references
Aho-Corasick algorithm
0 references
string inclusion
0 references
string non-inclusion
0 references
