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.

PDF Download (144kB)

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:	Mr Adewole Adewumi
Date Deposited:	28 Dec 2012 18:48
Last Modified:	28 Dec 2012 18:48
URI:	http://eprints.covenantuniversity.edu.ng/id/eprint/1140

Actions (login required)

View Item