An efficient algorithm for comparing two protein sequences: Implementation for microcomputers
β Scribed by Mitsuo Murata
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 416 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0097-8485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho
## Abstract Most of the methods that have been developed for computational protein design involve the selection of sideβchain conformations in the context of a single, fixed mainβchain structure. In contrast, multistate design (MSD) methods allow sequence selection to be driven by the energetic con
Arithmetic units based on a Residue Number System (RNS) are fast and simple, and therefore attractive for use in digital signal processing and symbolic computation applications. However, RNS suffers from overheads of converting numbers to and from residue system. We present a new simple and uniform