A review of algorithms for molecular sequence comparison
Computers have recently become an essential component of research in molecular biology. Most computer analyses of nucleic acid and protein sequences depend on comparisons between sequences. These comparisons, depending on their purpose, may differ not only in the kinds of comparisons that are done,...
Gespeichert in:
Veröffentlicht in: | Computers and biomedical research 1991-02, Vol.24 (1), p.72-96 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Computers have recently become an essential component of research in molecular biology. Most computer analyses of nucleic acid and protein sequences depend on comparisons between sequences. These comparisons, depending on their purpose, may differ not only in the kinds of comparisons that are done, but also in the way the results of the comparison are used by molecular biologists or by other computer programs. This paper reviews algorithms currently in use to solve comparison problems in molecular biology. Each algorithm is explained in detail and discussed in terms of the molecular biology problems it is most suited to solve. |
---|---|
ISSN: | 0010-4809 1090-2368 |
DOI: | 10.1016/0010-4809(91)90014-N |