The longest common extension problem revisited and applications to approximate string searching (Q616995)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The longest common extension problem revisited and applications to approximate string searching |
scientific article; zbMATH DE number 5839385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The longest common extension problem revisited and applications to approximate string searching |
scientific article; zbMATH DE number 5839385 |
Statements
The longest common extension problem revisited and applications to approximate string searching (English)
0 references
20 January 2011
0 references
longest common extension
0 references
approximate string search
0 references
Landau-Vishkin algorithm
0 references
Ukkonen's cutoff algorithm
0 references
0 references
0.8834824562072754
0 references
0.8620545268058777
0 references
0.857780933380127
0 references
0.8552297353744507
0 references
0.8347865343093872
0 references
