Sciweavers

276 search results - page 1 / 56
» Approximation of protein structure for fast similarity measu...
Sort
View
RECOMB
2003
Springer
14 years 7 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
14 years 25 days ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
BMCBI
2006
120views more  BMCBI 2006»
13 years 6 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
ALMOB
2008
82views more  ALMOB 2008»
13 years 6 months ago
Protein sequence and structure alignments within one framework
Background: Protein structure alignments are usually based on very different techniques to sequence alignments. We propose a method which treats sequence, structure and even combi...
Gundolf Schenk, Thomas Margraf, Andrew E. Torda
ISDA
2009
IEEE
14 years 1 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...