Find the Most Gap-Linear Subsequence.

Description

Find the most gap-linear length k+1 subsequence of the input sequence. The subsequence found by this function has the same end points as the original sequence. This function is not intended to be used by an end user directly. Users should use test.gaplin.t, test.gaplin.p or test.gaplin instead.

Usage

1
  most.gaplin.sub(x, k, T);

Arguments

x

The input sequence, a vector of numbers.

k

The length of the subsequences for which we want to test gap-linearity.

T

A threshold value. A subsequence will only be examined when its gap-linearity test statistic can be bigger than this t.

Value

improved

TRUE if we found a subsequence with a gap-linearity test statistic more extreme than the input t.

t

The gap-linearity test statistic corresponding to the most gap-linear subsequence.

sub

The most gap-linear subsequence.

sigma

The indices corresponding to the most gap-linear subsequence.

Author(s)

Yanming Di

References

Di and Perlman (2007)

See Also

test.gaplin, test.gaplin.t, test.gaplin.p.