<html><body bgcolor="#FFFFFF"><div>Hi Vineet,</div><div><br></div><div>From what I understand, you want find substrings rather than subsequences.</div><div><br></div><div>Currently, I am in vacancy and do not have access to TraMineR.</div><div>But I am quite sure you can find substrings by setting the max gap constraint to one. </div><div>Look at the seqeconstraint function.</div><div><br></div><div>Good luck.</div><div>Gilbert</div><div><br><div><br></div>WEnvoyé de mon iPad</div><div><br>Le Jul 12, 2012 à 23:22, Vineet Shukla <<a href="mailto:shuklvineet@gmail.com">shuklvineet@gmail.com</a>> a écrit :<br><br></div><div></div><blockquote type="cite"><div><pre><font size="4">I have independent event sequences for example as follows :
Independent event sequence 1 : A , B , C , D
Independent event sequence 2 : A, C , B
Independent event sequence 3 :D, A, B, X,Y, Z
Independent event sequence 4 :C,A,A,B
Independent event sequence 5 :B,A,D
I want to able to find that most common sequence patters as
{A, B } = > 3
from lines 1,3,5.
Pls note that A,C,B must not be considered because C comes in between
and line 5 also must not be considered because order of A,B is reversed.
In simple words I am looking for "most frequent independent event sequent" for any length.
I tried SPADE but it does not work for me because there event sequences are not independent.
Pls let me know which R algo/package I can use ?
Rgds,
Vineet</font></pre>
</div></blockquote><blockquote type="cite"><div><span>_______________________________________________</span><br><span>Traminer-users mailing list</span><br><span><a href="mailto:Traminer-users@lists.r-forge.r-project.org">Traminer-users@lists.r-forge.r-project.org</a></span><br><span><a href="https://lists.r-forge.r-project.org/cgi-bin/mailman/listinfo/traminer-users">https://lists.r-forge.r-project.org/cgi-bin/mailman/listinfo/traminer-users</a></span><br></div></blockquote></body></html>