The longest common extension problem revisited and applications to approximate string searching (Q616995): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2010.08.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2010.08.004 / rank | |||
Normal rank | |||
Revision as of 05:10, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest common extension problem revisited and applications to approximate string searching |
scientific article |
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
