Package | Description |
---|---|
de.jstacs.clustering.distances | |
de.jstacs.data |
Provides classes for the representation of data.
The base classes to represent data are Alphabet and AlphabetContainer for representing alphabets,
Sequence and its sub-classes to represent continuous and discrete sequences, and
DataSet to represent data sets comprising a set of sequences. |
de.jstacs.data.sequences |
Provides classes for representing sequences.
The implementations of sequences currently include DiscreteSequence s prepared for alphabets of different sizes, and ArbitrarySequence s that may
contain continuous values as well.As sub-package provides the facilities to annotate Sequence s. |
Modifier and Type | Field and Description |
---|---|
protected CyclicSequenceAdaptor[] |
SequenceScoreDistance.seqs
The De Bruijn sequences
|
Modifier and Type | Method and Description |
---|---|
static CyclicSequenceAdaptor[] |
RandomSequenceScoreDistance.createSequences(DiscreteAlphabet alphabet,
int n)
Creates a new random sequence of the given length and alphabet.
|
Modifier and Type | Method and Description |
---|---|
static double[][] |
DeBruijnMotifComparison.getProfilesForMotif(CyclicSequenceAdaptor[] ad,
StatisticalModel model,
boolean revcom,
boolean exp)
Returns the score profile on a De Bruin sequence for a De Bruijn sequence.
|
Constructor and Description |
---|
SequenceScoreDistance(CyclicSequenceAdaptor[] seqs,
boolean exp)
Creates a new distance for a given set of sequences.
|
Modifier and Type | Method and Description |
---|---|
static CyclicSequenceAdaptor[] |
DeBruijnSequenceGenerator.generate(DiscreteAlphabet alphabet,
int n)
Generates a De Bruijn sequence of length
![]() |
static CyclicSequenceAdaptor[] |
DeBruijnGraphSequenceGenerator.generate(DiscreteAlphabet alphabet,
int n)
Generates a De Bruijn sequence of length
![]() |
static CyclicSequenceAdaptor |
DeBruijnSequenceGenerator.generate(DiscreteAlphabet alphabet,
int n,
int alphabetShift)
Generates a De Bruijn sequence using the supplied alphabet and the given alphabet shift, i.e., for a cyclic shift of the symbols
of the alphabet.
|
static CyclicSequenceAdaptor |
DeBruijnGraphSequenceGenerator.generate(DiscreteAlphabet alphabet,
int n,
int alphabetShift)
Generates a De Bruijn sequence using the supplied alphabet and the given alphabet shift, i.e., for a cyclic shift of the symbols
of the alphabet.
|
Modifier and Type | Method and Description |
---|---|
CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.complement() |
CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.complement(int start,
int end) |
protected CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.flatCloneWithoutAnnotation() |
CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.getSuperSequence(int length)
Returns a new cyclic sequence using the internal sequence of this
CyclicSequenceAdaptor but with
the supplied virtual length |
CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.reverse(int start,
int end) |
CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.reverseComplement() |
CyclicSequenceAdaptor<T> |
CyclicSequenceAdaptor.reverseComplement(int start,
int end) |