PMC:4331679 / 20086-21419
Annnotations
{"target":"https://pubannotation.org/docs/sourcedb/PMC/sourceid/4331679","sourcedb":"PMC","sourceid":"4331679","source_url":"https://www.ncbi.nlm.nih.gov/pmc/4331679","text":"Table 1 Genetic Algorithm for finding mutation in apoptotic network.\nINPUT: Objective function, Network Topology(NT) in the form of Adjacency vector of size n × n, reaction rate constants vector of size n × n, maximum number of generations Max num gen for the algorithm, biological data measurements\nOUTPUT: A vector consisting topology of best uncovered network, score vector S, for such uncovered networks\n1. NT0 ⇐ topology\n2. RC0 ⇐ rate constants\n3. Max_num_itr ⇐ total number of iteration allowed\n4. S0 ⇐ 0\n5. Derive Population P (randomly generated networks)\n6. For max_ num_gen times do:\n7. Derive rate equations for each network in P\n8. Solve each of the Rate equations\n9. Derive numerical solutions (time series data)\n10. Compare the simulation results with Yaffe's data using DTW Objective function and calculate the Score\n11. Select 50 best score\n12. Perform crossover among best selected networks to formulate next generation, total of 100 networks again. The crossover points are selected based on random numbers. The networks to be crossed over are selected randomly.\n13. Perform mutation for each bit with the probability of 0.01, for each of the hundred networks.\n14. Set new population P = mutated network from step 13\n15. Check for the convergence.\n16. If network not converged, go to step 5\n7. Output solution set.","divisions":[{"label":"label","span":{"begin":0,"end":7}},{"label":"caption","span":{"begin":9,"end":69}},{"label":"p","span":{"begin":9,"end":69}},{"label":"tr","span":{"begin":70,"end":300}},{"label":"td","span":{"begin":70,"end":300}},{"label":"tr","span":{"begin":301,"end":408}},{"label":"td","span":{"begin":301,"end":408}},{"label":"tr","span":{"begin":409,"end":426}},{"label":"td","span":{"begin":409,"end":426}},{"label":"tr","span":{"begin":427,"end":450}},{"label":"td","span":{"begin":427,"end":450}},{"label":"tr","span":{"begin":451,"end":501}},{"label":"td","span":{"begin":451,"end":501}},{"label":"tr","span":{"begin":502,"end":511}},{"label":"td","span":{"begin":502,"end":511}},{"label":"tr","span":{"begin":512,"end":564}},{"label":"td","span":{"begin":512,"end":564}},{"label":"tr","span":{"begin":565,"end":594}},{"label":"td","span":{"begin":565,"end":594}},{"label":"tr","span":{"begin":595,"end":641}},{"label":"td","span":{"begin":595,"end":641}},{"label":"tr","span":{"begin":642,"end":677}},{"label":"td","span":{"begin":642,"end":677}},{"label":"tr","span":{"begin":678,"end":726}},{"label":"td","span":{"begin":678,"end":726}},{"label":"tr","span":{"begin":727,"end":832}},{"label":"td","span":{"begin":727,"end":832}},{"label":"tr","span":{"begin":833,"end":857}},{"label":"td","span":{"begin":833,"end":857}},{"label":"tr","span":{"begin":858,"end":1081}},{"label":"td","span":{"begin":858,"end":1081}},{"label":"tr","span":{"begin":1082,"end":1179}},{"label":"td","span":{"begin":1082,"end":1179}},{"label":"tr","span":{"begin":1180,"end":1235}},{"label":"td","span":{"begin":1180,"end":1235}},{"label":"tr","span":{"begin":1236,"end":1266}},{"label":"td","span":{"begin":1236,"end":1266}},{"label":"tr","span":{"begin":1267,"end":1309}},{"label":"td","span":{"begin":1267,"end":1309}}],"tracks":[]}