The longest common extension problem revisited and applications to approximate string searching (Q616995): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2010.08.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002246332 / rank | |||
Normal rank | |||
Revision as of 23:56, 19 March 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
