String matching with inversions and translocations in linear average time (most of the time) (Q1944938): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Simple and efficient string matching with k mismatches / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New and faster filters for multiple approximate string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms on Strings, Trees and Sequences / rank | |||
Normal rank | |||
Revision as of 07:27, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | String matching with inversions and translocations in linear average time (most of the time) |
scientific article |
Statements
String matching with inversions and translocations in linear average time (most of the time) (English)
0 references
28 March 2013
0 references
approximate string matching
0 references
algorithms
0 references
bioinformatics
0 references
