Sciweavers

13603 search results - page 195 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
DEDS
2002
106views more  DEDS 2002»
15 years 6 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
BMCBI
2011
15 years 1 months ago
PhyloSim - Monte Carlo simulation of sequence evolution in the R statistical computing environment
Background: The Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progr...
Botond Sipos, Tim Massingham, Gregory E. Jordan, N...
175
Voted
BMCBI
2010
156views more  BMCBI 2010»
15 years 6 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...
BMCBI
2007
124views more  BMCBI 2007»
15 years 6 months ago
A high-accuracy consensus map of yeast protein complexes reveals modular nature of gene essentiality
Background: Identifying all protein complexes in an organism is a major goal of systems biology. In the past 18 months, the results of two genome-scale tandem affinity purificatio...
G. Traver Hart, Insuk Lee, Edward M. Marcotte
BMCBI
2008
93views more  BMCBI 2008»
15 years 6 months ago
Homology modelling of protein-protein complexes: a simple method and its possibilities and limitations
Background: Structure-based computational methods are needed to help identify and characterize protein-protein complexes and their function. For individual proteins, the most succ...
Guillaume Launay, Thomas Simonson