Sciweavers

280 search results - page 56 / 56
» see 2010
Sort
View
DLT
2010
13 years 6 months ago
Around Dot Depth Two
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah
BMCBI
2010
123views more  BMCBI 2010»
13 years 5 months ago
eGIFT: Mining Gene Information from the Literature
Background: With the biomedical literature continually expanding, searching PubMed for information about specific genes becomes increasingly difficult. Not only can thousands of r...
Catalina O. Tudor, Carl J. Schmidt, K. Vijay-Shank...
BMCBI
2010
101views more  BMCBI 2010»
13 years 5 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
ECCC
1998
118views more  ECCC 1998»
13 years 4 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan
JSYML
2010
114views more  JSYML 2010»
13 years 3 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons