* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Detailed Algorithm of the DBRF
Genetic engineering wikipedia , lookup
Copy-number variation wikipedia , lookup
Saethre–Chotzen syndrome wikipedia , lookup
Neuronal ceroid lipofuscinosis wikipedia , lookup
Vectors in gene therapy wikipedia , lookup
Essential gene wikipedia , lookup
Genome (book) wikipedia , lookup
Gene therapy of the human retina wikipedia , lookup
Gene therapy wikipedia , lookup
Nutriepigenomics wikipedia , lookup
Epigenetics of diabetes Type 2 wikipedia , lookup
Genome editing wikipedia , lookup
Helitron (biology) wikipedia , lookup
Genome evolution wikipedia , lookup
Minimal genome wikipedia , lookup
Gene nomenclature wikipedia , lookup
Gene expression profiling wikipedia , lookup
Therapeutic gene modulation wikipedia , lookup
Site-specific recombinase technology wikipedia , lookup
Gene desert wikipedia , lookup
Microevolution wikipedia , lookup
Gene expression programming wikipedia , lookup
Detailed Algorithm of the DBRF-MEGN method For each pair of gene i and gene j in the expression profiles, the existence of gene regulation between those genes is determined as described in Kyoda et al. (2000). A positive (negative) edge directing from gene i to gene j, denoted by eij, is deduced when the expression level of gene j in the deletant of gene i is significantly lower (higher) than in the wild type. The deduced edges are named “initially deduced edges”. All edges that are explained by two other initially deduced edges are removed from the set of initially deduced edges as follows: all existing triplets of initially deduced edges, eij, eik, and ekj, are deduced by modifying Warshall’s algorithm (Warshall 1962), and for each triplet, eij is removed from initially deduced edges when the number of negative edges in eij and in eik and ekj have the same parity. The resulting edges are named “essential edges” and the removed edges are “non-essential edges”. Whether essential edges explain initially deduced edges was determined as follows. All essential edges are copied to “explained edges”. Then a non-essential edge that is explained by two explained edges is moved to explained edges, and the process is repeated until no edge is moved to explained edges. If all non-essential edges are moved to explained edges, essential edges explain initially deduced edges, and the algorithm terminates. Otherwise, the remaining non-essential edges are named “unexplained edges”. All edges that explain no other unexplained edges are removed from unexplained edges, and the resulted edges are named “essential unexplained edges”. Essential unexplained edges are divided into “independent groups” as follows. An essential unexplained edge is moved to a new independent group. An essential unexplained edge that explains or is explained by edges in the independent group is moved to the independent group. The process is repeated until no edge is moved to the independent group. Then, the overall process is repeated until no new independent group is created. For each group, all sets of minimum numbers of edges that, with essential 1 edges, explain all edges in the group are deduced. All possible combinations of these sets among all independent groups are generated. Then the algorithm terminates. Software implementation of this algorithm can be obtained from the authors at http://www.so.bio.keio.ac.jp/dbrf-megn/. References Kyoda,K.M., Morohashi,M., Onami,S. and Kitano,H. (2000) A gene network inference method from continuous-value gene expression data of wild-type and mutants. Genome Inform. Ser. Workshop Genome Inform., 11, 196-204. Warshall,S. (1962) A theorem on Boolean matrices. J. Assoc. Comput. Mach., 9, 11-12. 2