MULTAN: a program to align multiple DNA sequences
Nucleic Acids ResearchPublished 1 January 1986Open access
William Bains
Citations51
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A computer program which can align a large number of nucleic acid sequences with one another using an heuristic, iterative algorithm which has been tested extensively, and is found to produce useful alignments of a variety of sequence families.
Abstract
I describe a computer program which can align a large number of nucleic acid 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 number of sequences, and is implemented in a program which contains a variety of other functions to facilitate the analysis of the aligned result.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
Methods in enzymology on CD-ROM/Methods in enzymology[57] Sequencing end-labeled DNA with base-specific chemical cleavages
14,691 Citations1980Allan M. Maxam, Walter Gilbert
Proceedings of the National Academy of SciencesRapid similarity searches of nucleic acid and protein data banks.
1,577 Citations1983W. John Wilbur, David J. Lipman
An algorithm for the global comparison of sequences based on matching k-tuples of sequence elements for a fixed k results in substantial reduction in the time required to search a data bank when compared with prior techniques of similarity analysis, with minimal loss in sensitivity.
Nucleic Acids ResearchAutomation of the computer handling of gel reading data produced by the shotgun method of DNA sequencing
738 Citations1982Roger Staden
This paper describes a computer method for handling gel reading data produced by the shotgun method of DNA sequencing that greatly reduces the time the sequencer needs to spend checking and editing his data and yet it produces a consensus sequence for which the accuracy of determination of every base can be clearly shown.
Journal of Molecular EvolutionNonrandomness of point mutation as reflected in nucleotide substitutions in pseudogenes and its evolutionary implications
372 Citations1984Wen‐Hsiung Li, Chung‐I Wu +1 more
A revised estimate of the pattern of point mutation is obtained by considering more pseudogene sequences and indicates that mutation occurs nonrandomly among the four nucleotides, with a high proportion of transitional mutations.
Journal of Molecular EvolutionComparative biosequence metrics
255 Citations1981Temple F. Smith, Michael S. Waterman +1 more
The sequence alignment algorithms of Needleman and Wunsch (1970) and Sellers (1974) are compared and the two procedures are proven to be equivalent.
Nucleic Acids ResearchSEQ: a nucleotide sequence analysis and recombination system
177 Citations1982Douglas L. Brutlag, Joshua S. Clayton +2 more
SEQ is an interactive, self-documenting computer program that contains procedures for the analysis of nucleotide sequences and the manipulation of such sequences to allow the simulation and prediction of the results of recombinant DNA experiments.
Bulletin of Mathematical BiologyPattern recognition in several sequences: Consensus and alignment
158 Citations1984Michael S. Waterman, Richard Arratia +1 more
A new and practical solution for finding unknown patterns that occur imperfectly above a preset frequency is given as well as estimates of statistical significance.
Proceedings of the National Academy of SciencesSimultaneous comparison of three protein sequences.
143 Citations1985Mikio MURATA, Jane S. Richardson +1 more
The algorithm is an extension of the method developed by S. Needleman and C. Wunsch, but it decreases the almost prohibitively long computing time required by a direct naive extension to a practical level: it takes time proportional to the cube of the mean sequence length, in comparison to the fifth power time taken by the direct extension.
Nucleic Acids ResearchA computer aided oligonucleotide analysis provides a model sequence for RNA polymerase-promoter recognition in E.coli
87 Citations1978Günther E.F. Scherer, Malcolm D. Walkinshaw +1 more
A novel computer procedure has been used to search for homology among 17 known procaryotic promoter sequences and suggests that RNA polymerase could recognize the DNA double helix firstly in the B conformation then in the A.
Nucleic Acids ResearchGEL, a DNA sequencing project management system
28 Citations1982Jan Clayton, Larry Kedes
An automated system for management of DNA sequencing projects that can handle data from both random sequences and from fragments whose relative positions are known, and which reduces the problem of combinatoric data overload as sequencing projects grow large.