2994 search results - page 373 / 599 » Time sequences |
112
Voted
IEICET
2008
15 years 3 months ago
2008
Abstract-In this paper, we improve the idea of the near-optimal alignments. Though the near optimal alignments increase the possibility to find the correct alignment, too many of t...
90
Voted
ENDM
2006
15 years 3 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
135
Voted
ENTCS
2006
15 years 3 months ago
2006
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...
133
Voted
IJDMB
2008
15 years 3 months ago
2008
: Recently lots of studies aim at modeling and inferring gene networks. Modeling tools propose graphical models having almost nothing about time description of events and regards t...
125
Voted
IJDMB
2006
15 years 3 months ago
2006
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...