On the space complexity of some algorithms for sequence comparison (Q1184980): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127877777, #quickstatements; #temporary_batch_1722546880474 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / cites work | |||
| Property / cites work: Speeding up dynamic programming with applications to molecular biology / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear space algorithm for computing maximal common subsequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequence comparison with concave weighting functions / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90266-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011450903 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127877777 / rank | |||
Normal rank | |||
Latest revision as of 22:16, 1 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the space complexity of some algorithms for sequence comparison |
scientific article |
Statements
On the space complexity of some algorithms for sequence comparison (English)
0 references
28 June 1992
0 references
sequence comparison
0 references
modified edit distance
0 references
