๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast algorithms for approximately counting mismatches

โœ Scribed by Howard Karloff

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
640 KB
Volume
48
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast, approximate algorithm for detectio
Fast, approximate algorithm for detection of solvent-inaccessible atoms
โœ Weiser, J๏ฟฝrg; Shenkin, Peter S.; Still, W. Clark ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 207 KB

Up to about half of the atoms in biopolymers are inaccessible to solvents. If such atoms can be rapidly identified, time can be saved in the subsequent computation of atomic surface areas. A quick, approximate method, ลฝ . termed buried atom elimination BAE , was developed for the detection of such a

Fast Algorithms for Area Morphology
Fast Algorithms for Area Morphology
โœ Scott T. Acton ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 534 KB

Efficient algorithms are developed for area morphology. As opposed to traditional morphological operations that alter grayscale images via a concatenation of order statistic filters, the area morphological operators manipulate connected components within the image level sets. Essentially, the area m