Computing the longest common substring with one mismatch (Q764249): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Maxim A. Babenko / rank | |||
| Property / author | |||
| Property / author: Tatiana Starikovskaya / rank | |||
| Property / author | |||
| Property / author: Maxim A. Babenko / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Tatiana Starikovskaya / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line construction of suffix trees / rank | |||
Normal rank | |||
Latest revision as of 00:25, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the longest common substring with one mismatch |
scientific article |
Statements
Computing the longest common substring with one mismatch (English)
0 references
13 March 2012
0 references
longest common substring
0 references
stringology
0 references
mismatch
0 references
