Abstract
Multiple sequence alignment is one of the most challenging lems in biocomputing. Sequence comparison, averaging, and so ticated editing are required to make the computer do wha researcher wants to do. However, frequently complaints are that an alignment is “bad” or “insufficient” if calculated auto cally. This is because of the fact that the computer does only pair alignments and comparisons, and compiles these results in a se step to produce the multiple sequence alignment. Further, the resea implies automatically which regions are to be “conserved” (i.e. to be interrupted by gaps or misaligned) and which sequence ments are less essential. Computationally, only match and mism scores are known at the beginning of an alignment, and feature conserved regions are established only during the program run.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Devereux, J., Haeberli, P, and Smithies, O. (1984) A comprehensive set of sequence analysis programs for the VAX. Nucl. Acids Res. 12, 387–395
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Humana Press Inc., Totowa, NJ
About this protocol
Cite this protocol
Dölz, R. (1994). GCG: Production of Multiple Sequence Alignment. In: Griffin, A.M., Griffin, H.G. (eds) Computer Analysis of Sequence Data. Methods in Molecular Biology, vol 24. Humana Press. https://doi.org/10.1385/0-89603-246-9:83
Download citation
DOI: https://doi.org/10.1385/0-89603-246-9:83
Publisher Name: Humana Press
Print ISBN: 978-0-89603-246-0
Online ISBN: 978-1-59259-511-2
eBook Packages: Springer Protocols