A fast algorithm for the all-pairs suffix-prefix problem (Q1676303)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6803095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for the all-pairs suffix-prefix problem |
scientific article; zbMATH DE number 6803095 |
Statements
A fast algorithm for the all-pairs suffix-prefix problem (English)
0 references
6 November 2017
0 references
all-pairs suffix-prefix problem
0 references
algorithm engineering
0 references
DNA sequence assembly
0 references
0 references
0 references
0.95520306
0 references
0.9200613
0 references
0.9127429
0 references
0.90888256
0 references
0 references
0.86899614
0 references
