Sciweavers

4103 search results - page 793 / 821
» Some results on the Collatz problem
Sort
View
BMCBI
2006
152views more  BMCBI 2006»
13 years 8 months ago
Predicting deleterious nsSNPs: an analysis of sequence and structural attributes
Background: There has been an explosion in the number of single nucleotide polymorphisms (SNPs) within public databases. In this study we focused on non-synonymous protein coding ...
Richard J. B. Dobson, Patricia B. Munroe, Mark J. ...
BMCBI
2006
130views more  BMCBI 2006»
13 years 8 months ago
MicroTar: predicting microRNA targets from RNA duplexes
Background: The accurate prediction of a comprehensive set of messenger RNAs (targets) regulated by animal microRNAs (miRNAs) remains an open problem. In particular, the predictio...
Rahul Thadani, Martti T. Tammi
BMCBI
2006
130views more  BMCBI 2006»
13 years 8 months ago
4SALE - A tool for synchronous RNA sequence and secondary structure alignment and editing
Background: In sequence analysis the multiple alignment builds the fundament of all proceeding analyses. Errors in an alignment could strongly influence all succeeding analyses an...
Philipp N. Seibel, Tobias Müller, Thomas Dand...
BMCBI
2007
167views more  BMCBI 2007»
13 years 8 months ago
MindSeer: a portable and extensible tool for visualization of structural and functional neuroimaging data
Background: Three-dimensional (3-D) visualization of multimodality neuroimaging data provides a powerful technique for viewing the relationship between structure and function. A n...
Eider B. Moore, Andrew V. Poliakov, Peter Lincoln,...
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 8 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma