Molecular mechanisms of low dose ionizing radiation-induced hormesis, adaptive responses, radioresistance, bystander effects, and genomic instability

International Journal of Radiation Biology

Volumn 91, Issue 1, 2015, Pages 13-27

  Tang, Feng Ru ^a   Loke, Weng Keong ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b DSO NATIONAL LABORATORIES   (Singapore)

Author keywords

Bioresponses; Human diseases; Low dose radiation; Molecular mechanism

Indexed keywords

ATM PROTEIN; BMI1 PROTEIN; CHECKPOINT KINASE 1; CYCLOOXYGENASE 2; DNA; GLYCOGEN SYNTHASE KINASE 3BETA; INTERLEUKIN 12; INTERLEUKIN 1BETA; JANUS KINASE; KU ANTIGEN; MITOGEN ACTIVATED PROTEIN KINASE; PHOSPHOLIPASE A2; PROSTAGLANDIN E2; PROTEIN C JUN; PROTEIN KINASE B; PROTEIN P53; REACTIVE OXYGEN METABOLITE; STRESS ACTIVATED PROTEIN KINASE; SURVIVIN; TUMOR NECROSIS FACTOR ALPHA;

BYSTANDER EFFECT; DNA METHYLATION; DOUBLE STRANDED DNA BREAK; GENOMIC INSTABILITY; HORMESIS; HUMAN; IONIZING RADIATION; LOW ENERGY RADIATION; NONHUMAN; PRIORITY JOURNAL; PROTEIN EXPRESSION; RADIATION DOSE; RADIATION EXPOSURE; RADIOSENSITIVITY; RECOMBINATION REPAIR; REVIEW; SIGNAL TRANSDUCTION; ADAPTIVE IMMUNITY; ANIMAL; RADIATION RESPONSE;

ADAPTIVE IMMUNITY; ANIMALS; BYSTANDER EFFECT; DOSE-RESPONSE RELATIONSHIP, RADIATION; GENOMIC INSTABILITY; HORMESIS; HUMANS; RADIATION TOLERANCE;

EID: 84923072117     PISSN: 09553002     EISSN: 13623095     Source Type: Journal    
DOI: 10.3109/09553002.2014.937510     Document Type: Review

References (45)

1. M. Helft. (2011, May). Bing taps facebook data for fight with google. [Online]. Available: http://bits.blogs.nytimes.com/2011/05/16/
2. D. Kempe, J. M. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in Proc. 9th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2003, pp. 137-146.
3. M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. C. Reis, and B. A. Ribeiro-Neto, "Efficient search ranking in social networks," in Proc. 16th ACM Conf. Inform. Knowl. Manage., 2007, pp. 563-572.
4. P. Yin, W.-C. Lee, and K. C. K. Lee, "On top-k social web search,"in Proc. 19th ACM Int. Conf. Inform. Knowl. Manage., 2010, pp. 1313-1316.
5. D. Papadias, M. L. Yiu, N. Mamoulis, and Y. Tao, "Nearest neighbor queries in network databases," in Encyclopedia GIS, New York, NY, USA: Springer, 2008, pp. 772-776.
6. M. Richardson and P. Domingos, "Mining knowledge-sharing sites for viral marketing," in Proc. 8th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2002, pp. 61-70.
7. K. Saito, R. Nakano, and M. Kimura, "Prediction of information diffusion probabilities for independent cascade model," in Proc. 12th Int. Conf. Knowl.-Based Intell. Inform. Eng. Syst., 2008, pp. 67-75.
8. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan, "Learning influence probabilities in social networks," in Proc. 3rd ACM Int. Conf. Web Search Data Mining, 2010, pp. 241-250.
9. A. Goyal, F. Bonchi, and L. Lakshmanan, "A data-based approach to social influence maximization," Proc. VLDB Endowment, vol. 5, no. 1, pp. 73-84, 2011.
10. M. E. J. Newman, "Clustering and preferential attachment in growing networks," in Phys. Rev. Lett. E, vol. 64, p. 025102, 2001.
11. D. Liben-Nowell and J. M. Kleinberg, "The link-prediction problem for social networks," J. Amer. Soc. Inform. Sci. Technol., vol. 58, no. 7, pp. 1019-1031, 2007.
12. I. D. Felipe, V. Hristidis, and N. Rishe, "Keyword search on spatial databases," in Proc. IEEE 24th Int. Conf. Data Eng., 2008, pp. 1483-1484.
13. G. Cong, C. S. Jensen, and D. Wu, "Efficient retrieval of the top-k most relevant spatial web objects," Proc. VLDB Endowment, vol. 2, no. 1, pp. 337-348, 2009.
14. X. Cao, G. Cong, C. S. Jensen, and B. C. Ooi, "Collective spatial keyword querying," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2011, pp. 373-384.
15. J. Lu, Y. Lu, and G. Cong, "Reverse spatial and textual k nearest neighbor search," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2011, pp. 349-360.
16. S. Scellato, A. Noulas, and C. Mascolo, "Exploiting place features in link prediction on location-based social networks," in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 1046-1054.
17. M. Ye, P. Yin, W.-C. Lee, and D. L. Lee, "Exploiting geographical influence for collaborative point-of-interest recommendation," in Proc. 34th Int. ACM SIGIR Conf. Res. Develop. Inform. Retrieval, 2011, pp. 325-334.
18. N. Armenatzoglou, S. Papadopoulos, and D. Papadias, "A general framework for geo-social query processing," Proc. VLDB Endowment, vol. 6, no. 10, pp. 913-924, 2013.
19. E. Cho, S. A. Myers, and J. Leskovec, "Friendship and mobility: User movement in location-based social networks," in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 1082-1090.
20. A. Amir, A. Efrat, J. Myllymaki, L. Palaniappan, and K. Wampler, "Buddy tracking-efficient proximity detection among mobile friends," Pervasive Mobile Comput., vol. 3, no. 5, pp. 489-511, 2007.
21. G. Treu, T. Wilder, and A. Kupper, "Efficient proximity detection among mobile targets with dead reckoning," in Proc. 4th ACM Int. Workshop Mobility Manage. Wireless Access, 2006, pp. 75-83.
22. M. L. Yiu, L. H. U, S. Saltenis, and K. Tzoumas, "Efficient proximity detection among mobile users via self-tuning policies," Proc. VLDB Endowment, vol. 3, no. 1, pp. 985-996, 2010.
23. Z. Xu and H.-A. Jacobsen, "Adaptive location constraint processing,"in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2007, pp. 581-592.
24. J. Bao, M. F. Mokbel, and C.-Y. Chow, "Geofeed: A location aware news feed system," in Proc. IEEE Int. Conf. Data Eng., 2012, pp. 54-65.
25. A. V. Goldberg and C. Harrelson, "Computing the shortest path: A∗search meets graph theory," in Proc. 16th Annu. ACM-SIAM Symp. Discr. Algorithms, 2005, pp. 156-165.
26. H.-P. Kriegel, P. Kröger, M. Renz, and T. Schmidt, "Hierarchical graph embedding for efficient query processing in very large traffic networks," in Proc. 20th Int. Conf. Sci. Statist. Database Manage., 2008, pp. 150-167.
27. J. Matousek, "On the distortion required for embedding finite metric spaces into normed spaces," Israel J. Math., vol. 93, no. 1, pp. 333-344, 1996.
28. M. Thorup and U. Zwick, "Approximate distance oracles,"J. ACM, vol. 52, no. 1, pp. 1-24, 2005.
29. A. D. Sarma, S. Gollapudi, M. Najork, and R. Panigrahy, "A sketch-based distance oracle for web-scale graphs," in Proc. 3rd ACM Int. Conf. Web Search Data Mining, 2010, pp. 401-410.
30. J. Cheng and J. X. Yu, "On-line exact shortest distance query processing,"in Proc. 12th Int. Conf. Extending Database Technol.: Adv. Database Technol., 2009, pp. 481-492.
31. I. F. Ilyas, G. Beskales, and M. A. Soliman, "A survey of top-k query processing techniques in relational database systems,"ACM Comput. Surv., vol. 40, no. 4, article 11, 2008.
32. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," J. Comput. Syst. Sci., vol. 66, no. 4, pp. 614-656, 2003.
33. N. Bruno, L. Gravano, and A. Marian, "Evaluating top-k queries over web-accessible databases," in Proc. 18th Int. Conf. Data Eng., 2002, pp. 369-380.
34. X. Cao, G. Cong, and C. S. Jensen, "Retrieving top-k prestige-based relevant spatial web objects," Proc. VLDB Endowment, vol. 3, no. 1, pp. 373-384, 2010.
35. K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, "Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2005, pp. 634-645.
36. D. V. Kalashnikov, S. Prabhakar, and S. E. Hambrusch, "Main memory evaluation of monitoring queries over moving objects,"Distrib. Parallel Databases, vol. 15, no. 2, pp. 117-135, 2004.
37. M. F. Mokbel, X. Xiong, and W. G. Aref, "SINA: Scalable incremental processing of continuous queries in spatio-temporal databases,"in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 623-634.
38. P. Narváez, K.-Y. Siu, and H.-Y. Tzeng, "New dynamic algorithms for shortest path tree computation," IEEE/ACM Trans. Netw., vol. 8, no. 6, pp. 734-746, Dec. 2000.
39. E. P. F. Chan and Y. Yang, "Shortest path tree computation in dynamic graphs," IEEE Trans. Comput., vol. 58, no. 4, pp. 541-557, Apr. 2009.
40. M. Sarwat, J. Bao, A. Eldawy, J. J. Levandoski, A. Magdy, and M. F. Mokbel, "Sindbad: A location-based social networking system," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2012, pp. 649-652.
41. J. J. Levandoski, M. Sarwat, A. Eldawy, and M. F. Mokbel, "LARS: A location-aware recommender system," in Proc. IEEE 28th Int. Conf. Data Eng., 2012, pp. 450-461.
42. W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks,"in Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2010, pp. 1029-1038.
43. M. Levandowsky and D. Winter, "Distance between sets," Nature, vol. 234, pp. 34-35, 1971.
44. L. Wu, X. Xiao, D. Deng, G. Cong, A. D. Zhu, and S. Zhou, "Shortest path and distance queries on road networks: An experimental evaluation," Proc. VLDB Endowment, vol. 5, no. 5, pp. 406-417, 2012.
45. J. Leskovec and C. Faloutsos, "Sampling from large graphs," in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2006, pp. 631-636.