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...
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Background: DNA melting curve analysis using double-stranded DNA-specific dyes such as SYTO9 produce complex and reproducible melting profiles, resulting in the detection of multi...
John P. Rasmussen, Christopher P. Saint, Paul T. M...
Background: The integration of many aspects of protein/DNA structure analysis is an important requirement for software products in general area of structural bioinformatics. In fa...
Roberto H. Higa, Roberto C. Togawa, Arnaldo J. Mon...