Review on Computational Biology and Computational Chemistry Applications
Abstract
Full Text:
PDFReferences
Carvajal-Rodríguez A (2012). "Simulation of Genes and Genomes Forward in Time". Current Genomics. Bentham Science Publishers Ltd. 11 (1): 58–61. doi:10.2174/138920210790218007. PMC 2851118. PMID 20808525.
Carter, N. P.; Fiegler, H.; Piper, J. (2002). "Comparative analysis of comparative genomic hybridization microarray technologies: Report of a workshop sponsored by the Wellcome trust". Cytometry, Part A. 49 (2): 43–8. doi:10.1002/cyto.10153.
Aston KI (2014). "Genetic susceptibility to male infertility: News from genome-wide association studies". Andrology. 2 (3): 315–21. doi:10.1111/j.2047-2927.2014.00188.x. PMID 24574159.
Chemistry is quantum computing’s killer app | October 30, 2017 Issue–Vol. 95 Issue 43 | Chemical & Engineering News [Internet]. [cited 2018 Oct 19]. Available from: https://cen.acs.org/articles/95/i43/Chemistry-quantum-computings-killer-app.html
Nawfel Muhammed Baqer Muhsin, Mohammed Hamed Alhamdo (2020). Study Experiential And Numerical for Investigation The Efficiency Inside Building Structure. European Journal of Molecular & Clinical Medicine, 07 (06), 1917-1936, Available at: https://www.researchgate.net/publication/347520844_Study_Experiential_And_Numerical_for_Investigation_The_Efficiency_Inside_Building_Structure .
Atkins P, De Paula J, Friedman R. Quanta, matter, and change: a molecular approach to physical change. New York: W.H. Freeman & Company; 2009.
Read “Mathematical Challenges from Theoretical/Computational Chemistry” at NAP.edu [Internet]. [cited 2018 Oct 17]. Available from: https://www.nap.edu/read/4886/chapter/4
The Nobel Prize in Chemistry 1998 [Internet]. NobelPrize.org. [cited 2018 Oct 19]. a. Available from: https://www.nobelprize.org/prizes/chemistry/1998/summary/
Alhamdo, M. H., & Muhsin, N. M. B. (2020). Study Experiential and Numerical for SInvestigation The Efficiency Inside Building Structure. European Journal of Molecular & Clinical Medicine, 7(6), 1917-1936, Available at https://ejmcm.com/article_4002.html
Nagham Mahmood Aljamali, Ahmed Abdul Hussein Jabbar. Review on Modern Mathematics in the Analysis of Artificial Intelligence Data and Innovative Devices, Journal of Instrumentation and Innovation Sciences, Volume-6, Issue-3 (September-December, 2021), P: 10–19
The Nobel Prize in Chemistry 2013 [Internet]. NobelPrize.org. [cited 2018 Oct 19]. Available from: https://www.nobelprize.org/prizes/chemistry/2013/press-release/
Nagham Mahmood Aljamali, Jihan Razzaq Moslim. (2021). Review on Engineering Designs for Laboratory Chemical Devices and Displays., Journal of Control and Instrumentation Engineering, 7, 2, p: 38-46.
Nagham Mahmood Aljamali, Ahmed Abdulhussein Jabbar. (2021). Review on Applications of Algorithms in the Types of Scientific Programs and the Humanitarian Fields, Journal of Analog and Digital Devices , Volume-6, Issue-3 (September-December, 2021), P: 14–21, Available at http://matjournals.in/index.php/JoADD/article/view/7342.
Nagham Mahmood Aljamali, Jihan Razzaq Moslim. Review on Designs for AutoCAD Programs and Its Chemical Applications, Journal of Digital Integrated Circuits in Electrical Devices, Volume-6, Issue-2 (May-August, 2021), P: 20–27.
Schmittou, Thomas; Schmittou, Faith E. (2002). "Optimal Bounds for the Predecessor Problem and Related Problems". Journal of Computer and System Sciences. 65 (1): 38–72. doi:10.1006/jcss.2002.1822.
Russell, Stuart J. (2018). Artificial intelligence a modern approach. Norvig, Peter (4th ed.). Boston: Pearson. ISBN 978-0134610993. OCLC 1021874142.
Delling, D.; Sanders, P.; Schultes, D.; Wagner, D. (2009). "Engineering Route Planning Algorithms". Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. Lecture Notes in Computer Science. 5515. Springer. pp. 11个$7–139. CiteSeerX 10.1.1.164.8916. doi:10.1007/978-3-642-02094-0_7. ISBN 978-3-642-02093–3.
Zeng, W.; Church, R. L. (2009). "Finding shortest paths on real road networks: the case for A*". International Journal of Geographical Information Science. 23 (4): 531–543. doi:10.1080/13658810801949850. S2CID 14833639.
Hart, P. E.; Nilsson, N. J.; Raphael, B. (1968). "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". IEEE Transactions on Systems Science and Cybernetics. 4 (2): 100–107. doi:10.1109/TSSC.1968.300136.
Doran, J. E.; Michie, D. (1966-09-20). "Experiments with the Graph Traverser program". Proc. R. Soc. Lond. A. 294 (1437): 235–259. Bibcode:1966RSPSA.294.235D. doi:10.1098/rspa.1966.0205. ISSN 0080-4630. S2CID 21698093.
Nilsson, Nils J. (2009-10-30). The Quest for Artificial Intelligence (PDF). Cambridge: Cambridge University Press. ISBN 9780521122931.
Edelkamp, Stefan; Jabbar, Shahid; Lluch-Lafuente, Alberto (2005). "Cost-Algebraic Heuristic Search" (PDF). Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI): 1362–1367.
Martelli, Alberto (1977). "On the Complexity of Admissible Search Algorithms". Artificial Intelligence. 8 (1): 1–13. doi:10.1016/0004-3702(77)90002–9.
Pearl, Judea (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley. ISBN 978-0-201-05594-8.
Köll, Andreas; Hermann Kaindl (August 1992). "A new approach to dynamic weighting". Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI-92). Vienna, Austria. pp. 16–17.
Pearl, Judea; Jin H. Kim (1982). "Studies in semi-admissible heuristics". IEEE Transactions on Pattern Analysis and Machine Intelligence. 4 (4): 392–399. doi:10.1109/TPAMI.1982.4767270. PMID 21869053. S2CID 3176931.
Ghallab, Malik; Dennis Allard (August 1983). "Aε–an efficient near admissible heuristic search algorithm" (PDF). Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI-83). 2. Karlsruhe, Germany. pp. 789–791. Archived from the original (PDF) on 2014-08-06.
Reese, Bjørn (1999). "AlphA*: An ε-admissible heuristic search algorithm". Archived from the original on 2016-01-31. Retrieved 2014-11-05.
Russell, Stuart; Norvig, Peter (2003) [1995]. Artificial Intelligence: A Modern Approach (2nd ed.). Prentice Hall. pp. 97–104. ISBN 978-0137903955.
Russell, Stuart; Norvig, Peter (2009) [1995]. Artificial Intelligence: A Modern Approach (3rd ed.). Prentice Hall. p. 103. ISBN 978-0-13-604259–4.
Kagan E.; Ben-Gal I. (2014). "A Group-Testing Algorithm with Online Informational Learning" (PDF). IIE Transactions. 46 (2): 164–184. doi:10.1080/0740817X.2013.803639. S2CID 18588494.
Ferguson, Dave; Likhachev, Maxim; Stentz, Anthony (2005). A Guide to Heuristic-based Path Planning (PDF). Proc. ICAPS Workshop on Planning under Uncertainty for Autonomous Systems.
Nau, Dana S.; Kumar, Vipin; Kanal, Laveen (1984). "General branch and bound, and its relation to A∗ and AO∗" (PDF). Artificial Intelligence. 23 (1): 29–58. doi:10.1016/0004-3702(84)90004–3.
Hansen, Eric A., and Rong Zhou. "Anytime Heuristic Search. Archived2016-11-05 at the Wayback Machine" J. Artif. Intell. Res. (JAIR) 28 (2007): 267–297.
Fareh, Raouf; Baziyad, Mohammed; Rahman, Mohammad H.; Rabie, Tamer; Bettayeb, Maamar (2019-05-14). "Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot". Robotica. 38 (2): 235–255. doi:10.1017/S0263574719000572. ISSN 0263–5747
Refbacks
- There are currently no refbacks.