Sciweavers

104 search results - page 10 / 21
» Rigid substructure search
Sort
View
RECOMB
2007
Springer
15 years 11 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
NAR
2006
120views more  NAR 2006»
14 years 10 months ago
SuperNatural: a searchable database of available natural compounds
Although tremendous effort has been put into synthetic libraries, most drugs on the market are still 10 natural compounds or derivatives thereof. There are encyclopaedias of natur...
Mathias Dunkel, Melanie Füllbeck, Stefanie Ne...
BMCBI
2010
163views more  BMCBI 2010»
14 years 10 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
ESWS
2009
Springer
15 years 5 months ago
Reducing Ambiguity in Tagging Systems with Folksonomy Search Expansion
Abstract. Search facilities are vital for folksonomy (or social tagging mechanism) based systems. Although these systems allow great malleability and adaptability, they also surfer...
Jeff Z. Pan, Stuart Taylor, Edward Thomas
CP
1995
Springer
15 years 2 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo