From: bassam al-kindy Date: Fri, 6 Dec 2013 15:25:22 +0000 (+0100) Subject: finish section four X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/chloroplast13.git/commitdiff_plain/023abe68272c9371d78a52331610cfd4c3602c5c finish section four --- diff --git a/annotated.tex b/annotated.tex index fb04c9b..52ce278 100644 --- a/annotated.tex +++ b/annotated.tex @@ -325,87 +325,50 @@ to align these sequences with each others. \end{figure} \section{Implementation} -We implemented the three algorithms to extract maximum core genes from large amount of chloroplast genomes. Table \ref{Etime}, show the annotation, execution time, and the number of core genes for each method: +We implemented the three algorithms using dell laptop model latitude E6430 with 4 GB of memory and Intel core i5 processor of 2.6 Ghz and 3 MB of cash. We built the code using python version 2.7 under ubuntu 12.04 LTS. We also used python packages such as os, Biopython, memory\_profile, re, numpy, time, shutil, and xlsxwriter to extract core genes from large amount of chloroplast genomes. Table \ref{Etime}, show the annotation type, execution time, and the number of core genes for each method: \begin{center} \begin{tiny} \begin{table}[H] -\caption{Annotation, Execution Time, and core genes for each methodology. Annotation means the type of annotation algorithm used to annotate chloroplast genome, Features means the gene features which it is in two types: either gene name, gene sequence, or using the both. The execution time is represented in minute. The number of core genes in the super core is represented with NCBI and DOGMA. Bad genomes: are the number of genomes that can destroy core genes by low number of gene intersection}\label{Etime} -\begin{tabular}{ccccccccccc} +\caption{Type of Annotation, Execution Time, and core genes for each method}\label{Etime} +\begin{tabular}{p{2.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.5cm}p{0.2cm}} \hline\hline - & \multicolumn{2}{c}{Annotation} & \multicolumn{2}{c}{Features} & \multicolumn{2}{c}{Exec Time} & \multicolumn{2}{c}{Core genes} & \multicolumn{2}{c}{Bad genomes} \\ -~ & NCBI & DOGMA & Name & Seq & NCBI & DOGMA & NCBI & DOGMA & NCBI & \multicolumn{1}{c}{DOGMA} \\ + & \multicolumn{2}{c}{Annotation} & \multicolumn{2}{c}{Features} & \multicolumn{2}{c}{E. Time} & \multicolumn{2}{c}{C. genes} & \multicolumn{2}{c}{Bad Gen.} \\ +~ & N & D & Name & Seq & N & D & N & D & N & D \\ +\hline +Gene prediction & $\surd$ & - & - & $\surd$ & ? & - & ? & - & 0 & -\\[0.5ex] +Gene Features & $\surd$ & $\surd$ & $\surd$ & - & 4.98 & 1.52 & 28 & 10 & 1 & 0\\[0.5ex] +Gene Quality & $\surd$ & $\surd$ & $\surd$ & $\surd$ & \multicolumn{2}{c}{$\simeq$3 days + 1.29} & \multicolumn{2}{c}{4} & \multicolumn{2}{c}{1}\\[1ex] \hline -Gene prediction & $\surd$ & - & - & $\surd$ & ? & - & ? & - & 0 & -\\ -Gene Features & $\surd$ & $\surd$ & $\surd$ & - & 4.98 & 1.52 & 28 & 10 & 1 & 0\\ -Gene Quality & $\surd$ & $\surd$ & $\surd$ & $\surd$ & \multicolumn{2}{c}{1.29} & \multicolumn{2}{c}{4} & \multicolumn{2}{c}{1} - \end{tabular} \end{table} \end{tiny} \end{center} +In table \ref{Etime}, we show that all methods need low execution time to finish extracting core genes from large chloroplast genomes except in gene quality method where we need about 3-4 days for sequence comparisons to construct quality genomes then it takes just 1.29 minute to extract core genes. This low execution time give us a privilage to use these methods to extract core genes on a personal comuters rather than main frames or parallel computers. In the table, \textbf{N} means NCBI, \textbf{D} means DOGMA, and \textbf{Seq} means Sequence. Annotation is represent the type of algorithm used to annotate chloroplast genome. We can see that the two last methods used the same annotation sources. Features means the type of gene feature used to extract core genes, and this is done by extracting gene name, gene sequence, or both of them. The execution time is represented the whole time needed to extract core genes in minutes. We can see in the table that the second method specially with DOGMA annotation has the lowest execution time of 1.52 minute. In last method We needs approxemetly three days (this period is depend on the amount of genomes) to finish the operation of extracting quality genomes only, while the execution time will be 1.29 minute if we have quality genomes. The number of core genes is represents the amount of genes in the last core genome. The main goal is to find the maximum core genes that simulate biological background of chloroplasts. With NCBI we have 28 genes for 96 genomes instead of 10 genes with DOGMA for 97 genomes. But the biological distribution of genomes with NCBI in core tree did not reflect good biological perspective. While in the core tree with DOGMA, the distribution of genomes are biologically good. Bad genomes are the number of genomes that destroy core genes because of the low number of gene intersection. \textit{NC\_012568.1 Micromonas pusilla}, is the only genome that observed to destroy the core genome with NCBI based on the method of gene features and in the third method of gene quality. \\ The second important factor is the amount of memory usage in each methodology. Table \ref{mem} show the amounts of memory consumption by each method. \begin{center} \begin{tiny} \begin{table}[H] -\caption{Annotation, Execution Time, and core genes for each methodology. Annotation means the type of annotation algorithm used to annotate chloroplast genome, Features means the gene features which it is in two types: either gene name, gene sequence, or using the both. The execution time is represented in minute. The number of core genes in the super core is represented with NCBI and DOGMA. Bad genomes: are the number of genomes that can destroy core genes by low number of gene intersection}\label{Etime} -\begin{tabular}{cccccccc} +\caption{Memory usages in (MB) for each methodology}\label{mem} +\begin{tabular}{p{2.5cm}p{1.5cm}p{1cm}p{1cm}p{1cm}p{1cm}p{1cm}p{1cm}} \hline\hline -& & Load Genomes & T. genevision & Read genevision & ICM & Draw tree & Core Seq. \\ +Method& & Load Gen. & Conv. gV & Read gV & ICM & Gen. tree & Core Seq. \\ \hline Gene prediction & ~ & ~ & ~ & ~ & ~ & ~ & ~\\ \multirow{2}{*}{Gene Features} & NCBI & 15.4 & 18.9 & 17.5 & 18 & 18 & 28.1\\ & DOGMA& 15.3 & 15.3 & 16.8 & 17.8 & 17.9 & 31.2\\ -Gene Quality & ~ & 15.3 & >134 & 16.1 & 17 & 17.1 & 24.4 +Gene Quality & ~ & 15.3 & $\le$200 & 16.1 & 17 & 17.1 & 24.4\\ +\hline \end{tabular} \end{table} \end{tiny} \end{center} -one algorithm used to extract core genes based on NCBI annotation, and the others based on NCBI and DOGMA annotation tool. Evolutionary tree generated as a result from each method implementation. - -\subsection{Extract Core Genes based on Gene Contents} - -\subsubsection{Core Genes based on NCBI Annotation} -The first idea to construct the core genome is based on the extraction of Genes names (as gene presence or absence). For instant, in this stage neither sequence comparison nor new annotation were made, we just want to extract all genes with counts stored in each chloroplast genome, then find the intersection core genes based on gene names. \\ -The pipeline of extracting core genes can summarize in the following steps according to pre-processing method used:\\ - -\begin{enumerate} -\item We downloads already annotated chloroplast genomes in the form of fasta coding genes (\emph{i.e.} \textit{exons}). -\item Extract genes names and apply to solve gene duplication using first method. -\item Convert fasta file format to geneVision file format to generate ICM. -\item Calculate ICM matrix to find maximum core \textit{Score}. New core genes for two genomes will generate and a specific \textit{CoreId} will assign to it. This process continue until no elements remain in the matrix. -\item Evolutionary tree will take place by using all data generated from step 1 and 4. The tree will also display the amount of genes lost from each intersection iteration. A specific excel file will be generated that store all the data in local database. -\end{enumerate} - -There main drawback with this method is genes orthography (e.g two different genes sequences with same gene name). In this case, Gene lost is considered by solving gene duplication based on first method to solve gene duplication. - -\subsubsection{Core Genes based on Dogma Annotation} -The main goal is to get as much as possible the core genes of maximum coding genes names. According to NCBI annotation problem based on \cite{Bakke2009}, annotation method like dogma can give us more reliable coding genes than NCBI. This is because NCBI annotation can carry some annotation and gene identification errors. The general overview of whole process of extraction illustrated in figure \ref{wholesystem}. +We used a package from PyPI~(\textit{the Python Package Index}) where located at~ (https://pypi.python.org/pypi) named \textit{Memory\_profile} to extract all the values in table \ref{mem}. In this table, all the values are presented in mega bytes and \textit{gV} means genevision file format. We see that all memory levels in all methods are reletively low and can be available in any personal computer. All memory values shows that the method of gene features based on DOGMA annotation have the more resonable memory values to extract core genome from loading genomes until extracting core sequences. The third method, gives us the lowest values if we already have the quality genomes, but it will consume high memory locations if we do not have them. Also, the amount of memory locations in the third method vary according to the size of each genome.\\ -extracting core genes based on genes names and counts summarized in the following steps:\\ -\begin{enumerate} -\item We apply the genome annotation manually using Dogma annotation tool. -\item Analysing genomes to store lists of code genes names (\textit{i.e. exons}). solve gene fragments is done by using first method in solve gene fragments. The output from annotation process with dogma is genomes files in GenVision file format. Sets of genes were stored in the database. -\item Generate ICM matrix to calculate maximum core genes. -\item Draw the evolutionary tree by extracted all genes sequences from each core. Then applying multiple alignment process on the sequences to calculate the distance among cores to draw a phylogenetic tree. -\end{enumerate} - -The main drawback from the method of extracting core genes based on gene names and counts is that we can not depending only on genes names because of three causes: first, the genome may have not totally named (This can be found in early versions of NCBI genomes), so we will have some lost sequences. Second, we may have two genes sharing the same name, while their sequences are different. Third, we need to annotate all the genomes. -\subsection{Extract Core Genes based on Gene Quality Control} -The main idea from this method is to focus on genes quality to predict maximum core genes. By comparing only genes names from one annotation tool is not enough. The question here, does the predicted gene from NCBI is the same gene predicted by Dogma based on gene name and gene sequence?. If yes, then we can predict new quality genomes based on quality control test with a specific threshold. Predicted Genomes comes from merging two annotation techniques. While if no, we can not depending neither on NCBI nor Dogma because of annotation error. Core genes can by predicted by using one of the -\subsubsection{Core genes based on NCBI and Dogma Annotation} -This method summarized in the following steps:\\ -\begin{enumerate} -\item Retrieve the annotation of all genomes from NCBI and Dogma: in this step, we apply the annotation of all chloroplast genomes in the database using NCBI annotation and Dogma annotation tool. -\item Convert NCBI genomes to GeneVision file format, then apply the second method of gene defragmentation methods for NCBI and dogma genomes. -\item Predict quality genomes: the process is to pick a genome annotation from two sources, extracting all common genes based on genes names, then applying Needle-man wunch algorithm to align the two sequences based on a threshold equal to 65\%. If the alignment score pass the threshold, then this gene will removed from the competition and store it in quality genome by saving its name with the largest gene sequence with respect to start and end codons. All quality genomes will store in the form of GenVision file format. -\item Extract Core genes: from the above two steps, we will have new genomes with quality genes, ofcourse, we have some genes lost here, because dogma produced tRNA and rRNA genes while NCBI did not generate rRNA genes and vise-versa. Build ICM to extract core genes will be sufficient because we already check genes sequences. -\item Display tree: An evolution tree then will be display based on the intersections of quality genomes. -\end{enumerate} diff --git a/image1.png b/image1.png deleted file mode 100644 index 84e81ed..0000000 Binary files a/image1.png and /dev/null differ diff --git a/image2.png b/image2.png deleted file mode 100644 index b8b2429..0000000 Binary files a/image2.png and /dev/null differ