Skip Navigation

This Article
Right arrow Print PDF (720K)
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 Similar articles in PubMed
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
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Bains, W.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bains, W.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1986, Vol. 14, No. 1 159-177
© 1986

Articles

MULTAN: a program to align multiple DNA sequences

William Bains

MEDIGEN Project, Department of Medicine, Stanford Medical School, and Veterans Administration Medical Center 151M 3801 Miranda Ave., Stanford, CA 94305, USA

Received August 5, 1985. I describe a computer program which can align a large number of nucleic add sequences with one another. The program uses an heuristic, iterative algorithm which has been tested extensively, and is found to produce useful alignments of a variety of sequence families. The algorithm is fast enough to be practical for the analysis of large numbers of sequences, and is implemented in a program which contains a variety of other functions to facilitate the analysis of the aligned result.


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


This article has been cited by other articles:


Home page
 ScienceHome page
C. Lawrence, S. Altschul, M. Boguski, J. Liu, A. Neuwald, and J. Wootton
Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment
Science, October 8, 1993; 262(5131): 208 - 214.
[Abstract] [PDF]


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.