An Algorithm for Reconstructing Protein and RNA Sequences

Authors:
Marvin B. Shapiro
Affiliations:
Division of Computer Research and Technology, National Institutes of Health, Bethesda, Maryland
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 0
Cited 3

Why Greed Works for Shortest Common Superstring Problem

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Why greed works for shortest common superstring problem

Theoretical Computer Science
A bibliography on computational molecular biology and genetics

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

An algorithm for deriving the primary sequence of a protein or RNA is presented. The data is in the form of short sequences of letters which must be fitted together to form the unknown complete sequence. A computer program for carrying out the steps is described, with an example. It is shown that the algorithm cannot make an error and empirical results are given which illustrate the successful use of the algorithm in reconstructing complete sequences known to be solvable.