title: Using inverted indices for accelerating LINGO calculations.
abstract: The ever growing size of chemical databases calls for the development of novel methods for representing and comparing molecules. One such method called LINGO is based on fragmenting the SMILES string representation of molecules. Comparison of molecules can then be performed by calculating the Tanimoto coefficient, which is called LINGOsim when used on LINGO multisets. This paper introduces a verbose representation for storing LINGO multisets, which makes it possible to transform them into sparse fingerprints such that fingerprint data structures and algorithms can be used to accelerate queries. The previous best method for rapidly calculating the LINGOsim similarity matrix required specialized hardware to yield a significant speedup over existing methods. By representing LINGO multisets in the verbose representation and using inverted indices, it is possible to calculate LINGOsim similarity matrices roughly 2.6 times faster than existing methods without relying on specialized hardware.
authors.affiliation: Bioinformatics Research Centre, Aarhus University, Aarhus C, Denmark. tgk@birc.au.dk
authors.forename: Thomas G
authors.initials: TG
authors.lastname: Kristensen
authors.forename: Jesper
authors.initials: J
authors.lastname: Nielsen
authors.forename: Christian N S
authors.initials: CN
authors.lastname: Pedersen
mesh_terms: D000465:Algorithms; D019295:Computational Biology; D062126:Databases, Chemical