Sciweavers

255 search results - page 12 / 51
» Approximate matching of secondary structures
Sort
View
APPML
2011
13 years 4 months ago
On Taylor/Eddy solutions of approximate deconvolution models of turbulence
This article shows that, so called, general Green-Taylor solutions, also called Taylor solutions or eddy solutions of the 2d Navier Stokes equations are also exact solutions to app...
William J. Layton
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 6 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
BC
2002
193views more  BC 2002»
13 years 9 months ago
Resonant spatiotemporal learning in large random recurrent networks
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...
Emmanuel Daucé, Mathias Quoy, Bernard Doyon
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 8 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ISMB
2003
13 years 10 months ago
PSI: indexing protein structures for fast similarity search
We consider the problem of finding similarities in protein structure databases. Our techniques extract feature vectors on triplets of SSEs (Secondary Structure Elements). Later, ...
Orhan Çamoglu, Tamer Kahveci, Ambuj K. Sing...