GENIOMHE
/
sequence-algorithms
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add motif search algorithm

This commit is contained in:
Samuel Ortion 2024-03-15 09:34:02 +01:00
parent b830fded27
commit 5fb762e73f
2 changed files with 3 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
figures/part1/motif_search_automaton_bis.pdf (Stored with Git LFS)
View File

Binary file not shown.

16
figures/part1/motif_search_automaton_bis.tex
View File

@ -29,20 +29,6 @@
(q_6) edge node {T} (q_7) (q_6) edge node {T} (q_7)
; ;
% % Make it complete so that it recognize all motif in the sequence
% \path[->] (q_0) edge[loop above] node {C, T} (q_1);
% \path[->] (q_1) edge[loop above] node {A} (q_1);
% \path[->] (q_1) edge[bend left=30] node {T} (q_0);
% \path[->] (q_2) edge[bend left=30] node {C, T} (q_0);
% \path[->] (q_3) edge[bend right=40] node[above] {A} (q_1);
% \path[->] (q_3) edge[bend left=40] node {T} (q_0);
% \path[->] (q_4) edge[bend right=50] node[above] {A} (q_3);
% \path[->] (q_4) edge[bend left=40] node {C} (q_0);
% \path[->] (q_5) edge[bend right=40] node[above] {A} (q_1);
% \path[->] (q_5) edge[bend left=50] node {C,T} (q_0);
\path[->] (q_0) edge [loop above] node {A,T} (q_0); \path[->] (q_0) edge [loop above] node {A,T} (q_0);
\path[->] (q_1) edge [bend right=40] node {A, T} (q_0); \path[->] (q_1) edge [bend right=40] node {A, T} (q_0);
\path[->] (q_2) edge [bend right=40] node {C} (q_1); \path[->] (q_2) edge [bend right=40] node {C} (q_1);
@ -50,7 +36,7 @@
\path[->] (q_3) edge [bend right=40] node {A} (q_0); \path[->] (q_3) edge [bend right=40] node {A} (q_0);
\path[->] (q_3) edge [bend right=40] node {C} (q_1); \path[->] (q_3) edge [bend right=40] node {C} (q_1);
\path[->] (q_4) edge [bend right=40] node {A, T} (q_0); \path[->] (q_4) edge [bend right=40] node {A, T} (q_0);
\path[->] (q_5) edge [bend left=40] node[above] {C} (q_1); \path[->] (q_5) edge [bend left=40] node[above] {C} (q_2);
\path[->] (q_5) edge [bend left=40] node[above] {T} (q_0); \path[->] (q_5) edge [bend left=40] node[above] {T} (q_0);
\path[->] (q_6) edge [bend left=40] node[above] {A} (q_0); \path[->] (q_6) edge [bend left=40] node[above] {A} (q_0);
\path[->] (q_6) edge [bend right=40] node {C} (q_1); \path[->] (q_6) edge [bend right=40] node {C} (q_1);