A fast algorithm for the all-pairs suffix-prefix problem (Q1676303): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2017.07.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2017.07.013 / rank | |||
Normal rank | |||
Latest revision as of 02:43, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the all-pairs suffix-prefix problem |
scientific article |
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
