시퀀스는 왼쪽에서 오른쪽으로 읽어야합니다. 또한 플롯 나무가 아래에서 위로 읽어야 것을 알 수
library(PST)
data.seq <- seqdef("A-B-C-D-E-F")
S1.test <- pstree(data.seq, ymin = 0.001, lik = FALSE, with.missing = FALSE)
print(S1.test)
--(e)-[ p=(0.2,0.2,0.2,0.2,0.2,0.2) - n=6 ]
`--(A)-[ p=(0.001,0.995,0.001,0.001,0.001,0.001) - n=1 ]--|
`--(B)-[ p=(0.001,0.001,0.995,0.001,0.001,0.001) - n=1 ]
`--(A-B)-[ p=(0.001,0.001,0.995,0.001,0.001,0.001) - n=1 ]--|
`--(C)-[ p=(0.001,0.001,0.001,0.995,0.001,0.001) - n=1 ]
`--(B-C)-[ p=(0.001,0.001,0.001,0.995,0.001,0.001) - n=1 ]
`--(A-B-C)-[ p=(0.001,0.001,0.001,0.995,0.001,0.001) - n=1 ]--|
`--(D)-[ p=(0.001,0.001,0.001,0.001,0.995,0.001) - n=1 ]
`--(C-D)-[ p=(0.001,0.001,0.001,0.001,0.995,0.001) - n=1 ]
`--(B-C-D)-[ p=(0.001,0.001,0.001,0.001,0.995,0.001) - n=1 ]
`--(A-B-C-D)-[ p=(0.001,0.001,0.001,0.001,0.995,0.001) - n=1 ]--|
`--(E)-[ p=(0.001,0.001,0.001,0.001,0.001,0.995) - n=1 ]
`--(D-E)-[ p=(0.001,0.001,0.001,0.001,0.001,0.995) - n=1 ]
`--(C-D-E)-[ p=(0.001,0.001,0.001,0.001,0.001,0.995) - n=1 ]
`--(B-C-D-E)-[ p=(0.001,0.001,0.001,0.001,0.001,0.995) - n=1 ]
`--(A-B-C-D-E)-[ p=(0.001,0.001,0.001,0.001,0.001,0.995) - n=1 ]--|
plot(S1.test)

: 다음 코드는이 검증을 제공합니다.