Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100): 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.1007/978-3-642-11266-9_25 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1773733719 / rank | |||
Normal rank | |||
Latest revision as of 19:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays |
scientific article |
Statements
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (English)
0 references
28 January 2010
0 references
longest previous reverse factor
0 references
longest previous non-overlapping factor
0 references
longest previous factor
0 references
palindrome
0 references
runs
0 references
suffix array
0 references
text compression
0 references
