Linear time algorithms for generalizations of the longest common substring problem (Q547294)
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: Linear time algorithms for generalizations of the longest common substring problem |
scientific article; zbMATH DE number 5916745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithms for generalizations of the longest common substring problem |
scientific article; zbMATH DE number 5916745 |
Statements
Linear time algorithms for generalizations of the longest common substring problem (English)
0 references
1 July 2011
0 references
suffix arrays
0 references
longest common substring
0 references
longest common repeat
0 references
string mining
0 references
repeat analysis
0 references
0.8939633965492249
0 references
0.8933194279670715
0 references
0.8676635026931763
0 references
0.8485661745071411
0 references
