From 5fb762e73f29365904cd44be870185be2088e02b Mon Sep 17 00:00:00 2001 From: Samuel Ortion Date: Fri, 15 Mar 2024 09:34:02 +0100 Subject: [PATCH] Add motif search algorithm --- figures/part1/motif_search_automaton_bis.pdf | 4 ++-- figures/part1/motif_search_automaton_bis.tex | 16 +--------------- 2 files changed, 3 insertions(+), 17 deletions(-) diff --git a/figures/part1/motif_search_automaton_bis.pdf b/figures/part1/motif_search_automaton_bis.pdf index 599abdc..ff4827d 100644 --- a/figures/part1/motif_search_automaton_bis.pdf +++ b/figures/part1/motif_search_automaton_bis.pdf @@ -1,3 +1,3 @@ version https://git-lfs.github.com/spec/v1 -oid sha256:05eb655ddded590285eb6415ddff7aa500fc6407ff93e9b2c0321349d1c2350b -size 21431 +oid sha256:fe99513d4dbeb6f9570f35abe0ae04eb270a4c361cb5d594d6a1950890572cd7 +size 21426 diff --git a/figures/part1/motif_search_automaton_bis.tex b/figures/part1/motif_search_automaton_bis.tex index e17a508..1eac7ba 100644 --- a/figures/part1/motif_search_automaton_bis.tex +++ b/figures/part1/motif_search_automaton_bis.tex @@ -29,20 +29,6 @@ (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_1) edge [bend right=40] node {A, T} (q_0); \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 {C} (q_1); \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_6) edge [bend left=40] node[above] {A} (q_0); \path[->] (q_6) edge [bend right=40] node {C} (q_1);