Sciweavers

96 search results - page 4 / 20
» Optimal neighborhood indexing for protein similarity search
Sort
View
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
BMCBI
2010
163views more  BMCBI 2010»
13 years 7 months ago
Reduced representation of protein structure: implications on efficiency and scope of detection of structural similarity
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
Zong Hong Zhang, Hwee Kuan Lee, Ivana Mihalek
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 7 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
DEXA
2010
Springer
187views Database» more  DEXA 2010»
13 years 5 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
DATESO
2010
169views Database» more  DATESO 2010»
13 years 5 months ago
Parametrised Hausdorff Distance as a Non-Metric Similarity Model for Tandem Mass Spectrometry
Abstract. Tandem mass spectrometry is a widely used method for protein and peptide sequences identification. Since the mass spectra contain up to 80% of noise and many other inaccu...
Jiri Novák, David Hoksza