# cplot: Plot single nodes of a probabilistic suffix tree In PST: Probabilistic Suffix Trees and Variable Length Markov Chains

## Description

Plot the next symbol probability distribution associated with a particular node in a PST

## Usage

 ```1 2``` ``` ## S4 method for signature 'PSTf' cplot(object, context, state, main=NULL, all=FALSE, x.by=1, y.by=0.2, by.state=FALSE, ...) ```

## Arguments

 `object` A probabilistic suffix tree, i.e., an object of class `"PSTf"` as returned by the `pstree`, `prune` or `tune` function. `context` character. Label of the node to plot, provided as a string where states are separated by '-', see examples. `state` logical. Under development. `main` character. Main title for the plot. By default, the title is the node label. `all` logical. `x.by` numeric. Interval for the ticks on the x axis (segments). `y.by` numeric. Interval for the ticks on the y axis (probability). `by.state` logical. If `TRUE`, the representation of the probability distribution is done separately for each state of the alphabet. `...` arguments to be passed to the plot function or other graphical parameters.

## Details

The `cplot()` function displays a single node labelled with `context` of the tree where one or mode barplots (if `object` is a segmented PST) represent the probability distribution(s) stored in the node. For more details, see Gabadinho 2016.

## References

Gabadinho, A. & Ritschard, G. (2016). Analyzing State Sequences with Probabilistic Suffix Trees: The PST R Package. Journal of Statistical Software, 72(3), pp. 1-39.

`ppplot`

## Examples

 ```1 2 3 4 5``` ```data(s1) s1 <- seqdef(s1) S1 <- pstree(s1, L=3) cplot(S1, "a-b") ```

### Example output

```Loading required package: TraMineR

TraMineR stable version 2.0-11.1 (Built: 2019-05-12)
Website: http://traminer.unige.ch
Please type 'citation("TraMineR")' for citation information.

PST version 0.94 (Built: "Sun,)
Website: http://r-forge.r-project.org/projects/pst
[>] 2 distinct states appear in the data:
1 = a
2 = b
[>] state coding:
[alphabet]  [label]  [long label]
1  a           a        a
2  b           b        b
[>] 1 sequences in the data set
[>] min/max sequence length: 27/27
[>] 1 sequence(s) - min/max length: 27/27
[>] max. depth L=3, nmin=1
[L]  [nodes]
0        1
1        2
2        4
3        8
[>] computing sequence(s) likelihood ... (0.018 secs)
[>] total time: 0.157 secs
[>] retrieving from node: a-b
```

PST documentation built on May 2, 2019, 5:14 p.m.