Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Strelets, V.B.
Right arrow Articles by Lim, H.A.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Strelets, V.B.
Right arrow Articles by Lim, H.A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Data bank homology search algorithm with linear computation complexity

V.B. Strelets , A.A. Ptitsyn 1, L. Milanesi 2 and H.A. Lim 3

Supercomputer Computations Research Institute, Florida State University B-186, Tallahassee, FL 32306-4052, USA
1Institute of Cytology and Genetics, Russian Academy of Science pr. akad. Lavrentyeva 10, Novosibirsk, 630090, Russia
2Institute dt Technologie Biomediche Avanzate, Consiglio Nazionale Delle Ricerche, via Ampere 56 21031 Milano MI, Italy

3To whom reprint requests should be Sent

A new algorithm for data bank homology search is proposed. The principal advantages of the new algorithm are: (i) linear computation complexity; (ii) low memory requirements; and (iii) high sensitivity to the presence of local region homology. The algorithm first calculates indicative matrices of k-tuple ‘realization’ in the query sequence and then searches for an appropriate number of matching k-tuples within a narrow range in database sequences. It does not require k-tuple coordinates tabulation and in-memory placement for database sequences. The algorithm is implemented in a program for execution on PC-compatible computers and tested on PIR and GenBank databases with good results. A few modifications designed to improve the selectivity are also discussed. As an application example, the search for homology of the mouse homeotic protein HOX 3.1 is given.


; accepted on January 20, 1994

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.