X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/ancetre.git/blobdiff_plain/eac3a247705e37bd82afe3300e3482c34468b917..HEAD:/closedgenomes.tex?ds=sidebyside

diff --git a/closedgenomes.tex b/closedgenomes.tex
index ed2ad82..4b7ecd4 100644
--- a/closedgenomes.tex
+++ b/closedgenomes.tex
@@ -2,7 +2,7 @@ The approach is further based on the ability to decide how far is each
 genome from each others. To achieve this, we combine XXX metrics which are 
 detailed in this part.
 
-\subsection{Core SNP based metric} 
+\subsection{Core SNP based Metric} 
 Due to the definition of the core genome, for each element $\dot{x}$ 
 in this set, there is a gene $x \in \dot{x}$ in each genome. 
 Let us consider a class 
@@ -33,7 +33,7 @@ without considering the number of SNP it contains.
 
 % plus il y a de diff, plus le nombre est élevé
 
-\subsection{Symmetric Difference based metric}
+\subsection{Symmetric Difference based Metric}
 The third metric consider the symmetric difference $\Delta$ 
 between the two sets $G_1$ and $G_2$ of genes recalled hereafter
 $$
@@ -50,9 +50,37 @@ one.
 This metric is equal to the Hamming distance between the two corresponding  
 vectors of Boolean values.
 
-\subsection{Adjacency based metric}
-23424133
+% plus il y a de diff, plus le nombre est élevé
+
+
+
 % 4/ Using EPFL method
-% 5/ On size of the biggest syntheny bloc
-% 6/ On average size of syntheny blocs
-% 7/ On number of syntheny blocs.
+\subsection{Adjacency based metric}
+Following~\cite{23424133}, a sequence 
+of all the adjacencies, which is present in 
+a genomes at least is computed. This sequence
+is augmented with the pan genome content.
+Then, each genome is compared 
+with such a sequence and a boolean vector is produced with the following rule. 
+%If the element $i$ in the sequence of adjacencies or content is present 
+%in the genome, the 
+
+
+
+
+
+
+\subsection{Shared Synteny based Metric}
+Given two genomes abstracted as sequences of classes, it is classical
+to computes all the maximum shared synteny chains. 
+
+% Attention ici, moins il y a de diff, plus le nombre est élevé
+There are then three issues with such a set of shared synteny chains:
+\begin{itemize}
+\item let $m_{Y}$ be the metric, which returns the 
+length of the largest chains;
+\item let $m_{\overline{Y}}$ be the metric, which returns the 
+average length of synteny chains;
+\item finally, let $m_{|Y|}$ be the metric, which returns the 
+number of synteny chains.
+\end{itemize}