Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:19, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear time algorithms for finding and representing all the tandem repeats in a string |
scientific article |
Statements
Linear time algorithms for finding and representing all the tandem repeats in a string (English)
0 references
23 February 2005
0 references