On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions.
In designing an algorithm to find pairs of points that are within Euclidean distance d it is effective to use a screening procedure to reject most pairs of points that are far apart. A procedure based on multiple, overlapping lattices can efficiently identify close points and exclude distant ones.
Sangar
Vineet
V
Department of Biochemistry and Molecular Biology, and the Huck Institute for Genomics, Proteomics and Bioinformatics, The Pennsylvania State University, University Park, PA 16802, USA.
Lesk
Victor I
VI
Lesk
Arthur M
AM
D000465:Algorithms; D002918:Chymotrypsin / Q000737:chemistry; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D006860:Hydrogen Bonding; D007135:Immunoglobulin Variable Region / Q000737:chemistry
D007135:Immunoglobulin Variable Region; D002918:Chymotrypsin