1160 search results - page 40 / 232 » Revisiting the Sequence Constraint |
128
click to vote
BMCBI
2004
15 years 1 months ago
2004
Background: A number of completely sequenced eukaryotic genome data are available in the public domain. Eukaryotic genes are either 'intron containing' or 'intronle...
IJCAI
2007
15 years 3 months ago
2007
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoot...
134
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
120
click to vote
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
CP
2006
Springer
15 years 5 months ago
2006
Springer
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...