On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions

Vineet Sangar; Victor I. Lesk; Arthur M. Lesk

doi:10.1016/j.compbiolchem.2008.02.002

On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions

Vineet Sangar, Victor I. Lesk, Arthur M. Lesk

Biochemistry & Molecular Biology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	212-214
Number of pages	3
Journal	Computational Biology and Chemistry
Volume	32
Issue number	3
DOIs	https://doi.org/10.1016/j.compbiolchem.2008.02.002
State	Published - Jun 2008

All Science Journal Classification (ASJC) codes

Structural Biology
Biochemistry
Organic Chemistry
Computational Mathematics

Access to Document

10.1016/j.compbiolchem.2008.02.002

Cite this

@article{81b07513f5c04a3a9a5b0266b9338934,

title = "On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions",

abstract = "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.",

author = "Vineet Sangar and Lesk, {Victor I.} and Lesk, {Arthur M.}",

year = "2008",

month = jun,

doi = "10.1016/j.compbiolchem.2008.02.002",

language = "English (US)",

volume = "32",

pages = "212--214",

journal = "Computational Biology and Chemistry",

issn = "1476-9271",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions

AU - Sangar, Vineet

AU - Lesk, Victor I.

AU - Lesk, Arthur M.

PY - 2008/6

Y1 - 2008/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=43249089747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43249089747&partnerID=8YFLogxK

U2 - 10.1016/j.compbiolchem.2008.02.002

DO - 10.1016/j.compbiolchem.2008.02.002

M3 - Article

C2 - 18358782

AN - SCOPUS:43249089747

SN - 1476-9271

VL - 32

SP - 212

EP - 214

JO - Computational Biology and Chemistry

JF - Computational Biology and Chemistry

IS - 3

ER -

On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this