22 search results - page 4 / 5 » A Study of Accessible Motifs and RNA Folding Complexity |
BMCBI
2007
13 years 5 months ago
2007
Background: Since many of the new protein structures delivered by high-throughput processes do not have any known function, there is a need for structure-based prediction of prote...
BMCBI
2004
13 years 5 months ago
2004
Background: The Split ends (Spen) family are large proteins characterised by N-terminal RNA recognition motifs (RRMs) and a conserved SPOC (Spen paralog and ortholog C-terminal) d...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
APPML
2007
13 years 5 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
BMCBI
2004
13 years 5 months ago
2004
Background: Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true ...