On the space complexity of some algorithms for sequence comparison (Q1184980): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 16:15, 15 May 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
