102 search results - page 9 / 21 » An Improved Zero-One Law for Algorithmically Random Sequence... |
GCB
1997
Springer
15 years 1 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
CATS
2008
14 years 11 months ago
2008
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
BMCBI
2010
14 years 9 months ago
2010
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
BMCBI
2007
14 years 9 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
81
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...