1057 search results - page 32 / 212 » Theoretical and Experimental DNA Computation |
77
Voted
WOB
2003
14 years 11 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
IJFCS
2006
14 years 9 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
72
Voted
WABI
2007
Springer
15 years 3 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
ITICSE
2004
ACM
15 years 3 months ago
2004
ACM
This paper describes an “experiential” learning approach to teaching a foundational course on Computer Networking. In additional to the traditional laboratory sessions and ana...