Search Results - (( java implementation path algorithm ) OR ( using a binding algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Soap performance enhancement for high volume messaging / Ali Baba Dauda by Ali Baba , Dauda

    Published 2018
    “…To achieve this aim, LZ77 compression algorithm is modified to encode more symbols. The algorithm is then integrated into two Web services with HTTP and JMS bindings. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Computer aided design of efficient phytases by Noorbatcha, Ibrahim Ali, Samsudin, Nurhusna, Hamzah, Mohd. Salleh, Syed Osman Idid, Syed Zahir Idid

    Published 2009
    “…It is found that mutation at position M216R and E219R leads to improvement in the binding strength while mutation at position H17A shows decrease in binding and mutation at A116T have no effect in the binding strength.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  7. 7

    A bioinformatics approach to analyse a fatty acid and retinol binding protein secreted by ancylostoma caninum: an approach tow ards hookworms vaccine discovery / Normalisa Mohd Sap... by Mohd Sapian, Normalisa

    Published 2009
    “…In this research, we are about to use the bioinformatics to analyze a fatty acid and retinol binding protein secreted by adult Ancylostoma caninum. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Molecular docking studies of Pyranose-2-oxidase from trametes multicolor by Noorbatcha, Ibrahim Ali, Nuge, Tamrin, Yusof, Amirulakmal, Othman, Raihan, Mohd. Salleh, Hamzah

    Published 2013
    “…Then this active site is validated by automated docking of the substrates and comparing the docking score with the experimental results. Lamarckian genetic algorithm (LGA) is used to search for active sites and potential mean force (PMF) scoring method is used to evaluate different binding sites. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  9. 9
  10. 10

    Computer Aided Design of Polygalacturonase II from Aspergillus niger by Noorbatcha, Ibrahim Ali, Ismail, Nur Izzah, Mohd. Salleh, Hamzah

    Published 2011
    “…The mutations R256Q, K258N and E252A show improvement of the binding score while N186E reduces the binding strength. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  11. 11

    SOMEA: self-organizing map based extraction algorithm for DNA motif identification with heterogeneous model by Lee, Nung Kion, Wang, Dianhui

    Published 2011
    “…Results: This paper aims to develop a Self-Organizing Map (SOM) based clustering algorithm for extracting binding sites in DNA sequences. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Prediction of novel doping agent through the integration of chemical and biological data using in silico method by Mohd Rosman, Nurul Ain

    Published 2016
    “…In this study, an in silica method that integrates chemical and biological data was used to predict potential doping agents. The in silica method, also known as in silica target prediction, first analyse patterns of protein-ligand binding from chemical and biological data through the use of machine learning algorithm. …”
    Get full text
    Get full text
    Student Project
  13. 13

    Enhanced chaotic image encryption algorithm based on Baker's map by Salleh, Mazleena, Ibrahim, Subariah, lsnin, Fauz

    Published 2003
    “…From the analysis done, it shows that the security level is high even though keys that are found to be weak keys for Baker’s map algorithm are being used in the algorithm. …”
    Get full text
    Get full text
    Article
  14. 14

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Molecular docking of cellobiose and cellotetraose into an endoglucanase from fusarium oxysporum by Ibrahim Ali, Noorbatcha, Hamzah, Mohd. Salleh

    Published 2014
    “…The docking of ligands into active site was carried out using Lamarkian Genetic Algorithm with a fast, simplified potential of mean force (PMF) to evaluate the docking efficiency. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    AnkPlex: algorithmic structure for refinement of near-native ankyrin-protein docking by Wisitponchai, Tanchanok, Shoombuatong, Watshara, Lee, Vannajan Sanghiran, Kitidee, Kuntida, Tayapiwatana, Chatchai

    Published 2017
    “…The dataset was composed of 669 and 44,334 near-native and non-near-native poses, respectively, and it was used to generate eleven informative features. Subsequently, a re-scoring rank was generated by AnkPlex using a combination of a decision tree algorithm and logistic regression. …”
    Get full text
    Get full text
    Article
  17. 17

    Modification and characterization of phytase for animal feed production by Noorbatcha, Ibrahim Ali, Samsudin, Nurhusna, Mohd. Salleh, Hamzah

    Published 2009
    “…Automated docking based on genetic algorithm is used to dock the phytate in the active site and Partial Mean Force (PMF) scoring is used to calculate the strength of the binding before and after mutation.…”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Computer Aided Design of Polygalacturonase II from aspergillus niger by Noorbatcha, Ibrahim Ali, Ismail, Nur Izzah, Mohd. Salleh, Hamzah

    Published 2011
    “…In this project we have designed a novel polygalacturonase enzyme using computer aided design approaches. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Rational drug design using genetic algorithm: case of malaria disease by Al-Safi, Hassen Mohammed, Alshaikhli, Imad Fakhri Taha

    Published 2012
    “…Drug Diocopeltine A was found as the best lowest binding energy with the value of -8.64 Kcal/mol. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Computer Aided Design of potential inhibitors for Gaucher disease by Noorbatcha, Ibrahim Ali, Mohd. Salleh, Hamzah

    Published 2010
    “…Lamarckian genetic algorithm is used to locate the potential inhibitor sites in the acid β- glucosidase and strength of the binding is evaluated using potential mean force (PMF) scores. …”
    Get full text
    Get full text
    Proceeding Paper