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 Day, W. H.E.
Right arrow Articles by McMorris, F.R.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Day, W. H.E.
Right arrow Articles by McMorris, F.R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

A consensus program for molecular sequences

William H.E. Day and F.R. McMorris 1

Department of Computer Science, Memorial University of Newfoundland St John's, NF AlC 5S7, Canada
1Department of Mathemancs, University of Louisville Louisville, KY 40292, USA

Although molecular biologists often calculate consensus sequences from aligned DNA or protein sequences, relatively little is known about the properties of many of the consensus methods being used. Consequently, we wrote a program, CONSENSUS, to analyze and compare methods of calculating a consensus result (a base, an ambiguity code or a subset of codes) at a position in an aligned set of molecular sequences. The program supports alphabets of up to four symbols (e.g. (R, Y) or A, C, G, T). The program's output makes it suitable for exploratory data analysis or for selecting values of thresholds or confidence levels in consensus methods having such parameters.


Received on December 1, 1992; accepted on June 1, 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.