Linear time algorithms for finding and representing all the tandem repeats in a string
Under an Elsevier user license
open archive
Cited by (0)
- 1
Research partially supported by Grant DBI-9723346 from the National Science Foundation, and by Grant DE-FG03-90ER60999 from the Department of Energy.
- 2
Research supported by the German Academic Exchange Service (DAAD).
- 3
Present address: Universität Bielefeld, Technische Fakultät, 33594 Bielefeld, Germany.
Copyright © 2004 Elsevier Inc. All rights reserved.