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 Torelli, A.
Right arrow Articles by Robotti, C. A.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Torelli, A.
Right arrow Articles by Robotti, C. A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

ADVANCE and ADAM: two algorithms for the analysis of global similarity between homologous informational sequences

Alberto Torelli and Carlo A. Robotti

Department of Genetics, Biology, and Medical Chemistry, University of Turin via Santena 5 bis, 10126 Torino, Italy

Two algorithms for the analysis of global similarity between sequences of informational polymeric molecules (nucleic acids and proteins) are proposed: one (ADVANCE) merely gives a quantification of the global similarity between two sequences, and is very fast, the other (ADAM) also provides an alignment of the sequences. Both are new algorithms, implement Sellers' theorem, do not require parameters, are able to analyze two sequences of 32 000 elements each, and are fast; nevertheless, they differ deeply in the algorithm, in the programming language type, and in their planning, and will thus have to be treated separately. In fact, the different nature of the required output in each program causes the common aim (to obtain power and speed) to be reached only through very different ways and methods.

Received on December 12, 1992; accepted on March 16, 1993

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.