A faster algorithm computing string edit distances (Q1140994): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55891303, #quickstatements; #temporary_batch_1712286835472 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5616735 / 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: An Extension of the String-to-String Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for the String Editing Problem / rank | |||
Normal rank | |||
Latest revision as of 05:18, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm computing string edit distances |
scientific article |
Statements
A faster algorithm computing string edit distances (English)
0 references
1980
0 references
edit distance
0 references
character strings
0 references
longest common subsequence
0 references
