Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 Burnett, L.
Right arrow Articles by Hensley, W. J.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Burnett, L.
Right arrow Articles by Hensley, W. J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© IRL Press Limited

An exhaustive tree-searching algorithm for high-resolution computer-assisted nucleotide sequence analysis

Leslie Burnett *, Antony Basten 1 and William J. Hensley

Department of Clinical Biochemistry Missenden Road, Camperdown, NSW 2050, Australia
1Department of Clinical Immunology Research Centre, Royal Prince Alfred Hospital Missenden Road, Camperdown, NSW 2050, Australia

*To whom reprint requests should be sent

A new computer search strategy has been devised for high-resolution nucleotide sequence analysis. The strategy differs from those used by earlier sequence analysing programs in that it is exhaustive and capable of detecting all possible homologies and other types of relationships between or within sequences irrespective of the pattern of matches and mismatches encountered. The implementation of this strategy into a working algorithm is described.

Received on March 1, 1985; accepted on April 24, 1985

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.