Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Marcin Kubica / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Wojciech Rytter / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Tomasz Walen / rank | |||
Normal rank |
Revision as of 09:02, 13 February 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