Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295)
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 finding and representing all the tandem repeats in a string |
scientific article; zbMATH DE number 2137320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithms for finding and representing all the tandem repeats in a string |
scientific article; zbMATH DE number 2137320 |
Statements
Linear time algorithms for finding and representing all the tandem repeats in a string (English)
0 references
23 February 2005
0 references
0.8371729254722595
0 references
0.7949635982513428
0 references
