Constraint-Based Strategy for Pairwise RNA Secondary Structure Prediction
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Approximation algorithms for speeding up dynamic programming and denoising aCGH data
Journal of Experimental Algorithmics (JEA)
Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A high-throughput approach for associating microRNAs with their activity conditions
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Online dynamic programming speedups
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A study of accessible motifs and RNA folding complexity
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...