A linear-time algorithm for the 1-mismatch problem (Q5096932): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-63307-3_53 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1559357409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Data structures and algorithms for approximate string matching / rank | |||
Normal rank | |||
Latest revision as of 22:47, 29 July 2024
scientific article; zbMATH DE number 7573281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for the 1-mismatch problem |
scientific article; zbMATH DE number 7573281 |
Statements
A linear-time algorithm for the 1-mismatch problem (English)
0 references
19 August 2022
0 references
center character
0 references
center sequence
0 references
procedure center
0 references
locus control region
0 references
extra space
0 references
