University Links: Home Page | Site Map
Covenant University Repository

An efficient algorithm for finding short approximate non-tandem repeats

Adebiyi, E. F. and Jiang, T. and Kaufmann, M. (2001) An efficient algorithm for finding short approximate non-tandem repeats. Bioinformatics, 17. S5-S12.

[img] PDF
Download (133Kb)
Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Mrs Patricia Nwokealisi
Date Deposited: 02 May 2017 11:45
Last Modified: 02 May 2017 11:45
URI: http://eprints.covenantuniversity.edu.ng/id/eprint/8086

Actions (login required)

View Item View Item