 About 353,000 results  books.google.com The part of the tapes to the lefthand side of the head can be represented as a list
of ktuples— the first element of the list denotes the ktuple of symbols that are
just to the left of the head—and, similarly, the righthand side of the tapes can be
... 

 books.google.com A word length of k is used, so the last (k 1) elements of each row and column are
not filled. This is why the diagonal labels range from k  m to n  k. m \ \ km For
each different ktuple we need to know whether it occurs, and if so at which ... 

 books.google.com Franc Solina, Ales Leonardis  1999  650 pages Suppose that k primitives are necessary to estimate the parametervector φ for
the transformation T. Furthermore, let t ̄Di = {u1, ....,uk }⊂D denote the indexset
of the primitives forming one of the data ktuples. The set of available data ... 

 books.google.com Further assume that the Ktuples in (28.24) are independent. Then for every 1/ G {
1, . . . , k/K}, the Ntuple (T((rI1)N+1)7___,T(”N)) (28.25) forms a sufificient statistic
for guessing the Ktuple (D(r/I1)1<+1,    , Dl/K) (2826) or any function thereof. 

 books.google.com A direct approach to capture such dependencies is taken by ktuple frequency
analysis methods. Ktuple frequency analysis has many applications, such as
discrimination between coding and noncoding regions, determination of coding
frame ... 

 books.google.com Ajith Abraham, Jaime Lloret Mauri, John Buford  2011  710 pages The hash table is stored in memory as two data structures—a list of positions L
and an array of pointers A into L. The pointer A [w] point to an entry of L which
describes the position of the first occurrence of the ktuple in the database D. The
... 

 books.google.com Thomas Eiter, KlausDieter Schewe  2002  287 pages Types: Given a database I and a ktuple ̄ak over I, we would like to consider all
properties of ̄ak in the database I including the properties of every component of
the tuple and the properties of all different subtuples of ̄ak. Therefore, we use ... 

 books.google.com Clustering methods for gene family Combination Clustering Algorithm Similarity
Measure KM with DTI Kmeans DTI SL with ... While in ktuple distance and DMk,
the size of ktuple is set to 3 according reference [9] , then each sequence can be
... 

 books.google.com Gerald Quirchmayr, Erich Schweighofer, Trevor J.M. BenchCapon  1998  905 pages 4.1 Definitions, Notation Definition 5. k tuple : A ktuple is a tuple of tuples
denoted by (t\,t?, ..., tn), where n> 1 and <,• (i = 1, . . . , n) is a tuple. Note that a
single tuple t can be seen as the ktuple (t). A ktuple of the form (t) or of the form (
f, . . . , (,t ... 

 books.google.com To implement the first step, we pass through I once and create a table of the
positions i for each possible word of predetermined size k. Then we pass through
the search space J once, and for each ktuple starting at successive positions j, “
look ... 

 