Search Results - "graph algorithm"

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…Graphs are a pervasive data structure in computer science, and algorithms working with them are fundamental to the field. Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. …”
    Get full text
    Get full text
  2. 2
  3. 3

    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

    Published 2016
    “…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. The proposed technique is able to find a least spent travel time path between two nodes in a bus network with time-dependence.Graph algorithm is used to generate all possible paths to reveal the distances.Classification technique is then used to analysis traffic situation in different period of the time.By analysis traffic situation, date, time, week, month, location are used as a main factor for training process in classification technique.From the experimental studies, the proposed technique is able to show the best route from any given node to the final destination depending on the different period of the time.The proposed technique provides significant benefit for traveler to select the best bus route, which is short distance and fast, among generated routes…”
    Get full text
  4. 4

    Next generation sequencing-data analysis for cellulose- and xylan-degrading enzymes from POME metagenome by Benbelgacem, Farah Fadwa, Mohd Noor Mat Isa, Abdelrahim, Muhammad Alfatih Muddathir, Afidalina Tumian, Bellag, Oualid Abdelkader, Adibah Parman, Ibrahim Ali Noorbatcha, Hamzah Mohd Salleh

    Published 2018
    “…The acceptable strategy to handle metagenomic NGS-data in order to detect known and potentially unknown genes is presented and we showed the computational efficiency of de Bruijn graph algorithm of de novo assembly to 21 bioprospect genes encoding cellulose-degrading enzymes and 6 genes encoding xylan-degrading enzymes of 30.3% to 100% identity percentage.…”
    Get full text
    Get full text
  5. 5

    Real-time alert correlation with type graphs by Tedesco, Gianni, Aickelin, Uwe

    Published 2008
    “…Our work is to present a novel type-graph algorithm which unifies correlation and hypothesizing in to a single operation. …”
    Get full text
  6. 6

    Industry 5.0 and Education 5.0: Transforming Vocational Education through Intelligent Technology by Zhang, Hongli, Leong, Wai Yie

    Published 2024
    “…By analyzing the research gaps in personalized learning paths, emotion-driven learning, crossdisciplinary integration, and long-term learning behavior analysis, the paper proposes four improved algorithms: the adaptive learning path generation algorithm, the emotion-driven personalized learning algorithm, the cross-disciplinary knowledge graph algorithm, and the long-term learning behavior prediction algorithm. …”
    Get full text
    Get full text
    Get full text
  7. 7

    Next generation sequencing-data analysis for cellulose- and Xylan-degrading enzymes from POME metagenome = Analisis data-penjujukan generasi seterusnya bagi enzim selulosa dan xil... by Ben Belgacem, Farah Fadwa, Mat Isa, Mohd Nor, Abdelrahim, Muhammad Alfatih Muddathir, Tumian, Afidalina, Noorbatcha, Ibrahim Ali, Mohd. Salleh, Hamzah

    Published 2018
    “…The second step was the de novo assembly of sequences to reconstruct 2900 contigs following de Bruijn graph algorithm. Pre-assembled contigs were arranged in order, the distances between contigs were identified and oriented with SSPACE, where 2139 scaffolds have been reconstructed. 16,386 genes have been identified after gene prediction using Prodigal and putative ID assignment with Blastp vs NR protein. …”
    Get full text
    Get full text
    Get full text
    Get full text
  8. 8

    NGS-data analysis for netagenome cellulose- and Xylan- degrading enzymes finding by Ibrahim Ali, Noorbatcha, Hamzah, Mohd. Salleh

    Published 2017
    “…The second step was the de novo assembly of sequences to reconstruct 2900 contigs following de bruijn graph algorithm. Pre-assembled contigs were arranged in order, the distances between contigs were identified and oriented with SSPACE, where 2139 scaffolds have been reconstructed. 16386 genes have been identified after gene prediction using Prodigal and putative ID assignment with Blastp Vs NR protein. …”
    Get full text
    Get full text
    Get full text
    Get full text
  9. 9

    Static and dynamic graphs modeling of a boiler system / Noor Ainy Harish by Harish, Noor Ainy

    Published 2015
    “…Next, to obtain an explanation of the dynamic nature of the system, a Dynamic Autocatalytic Set Graph Algorithm (DAGA) is presented which succesfully explained the dynamics of the real processes in the boiler. …”
    Get full text
  10. 10

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
    Get full text
    Get full text
  11. 11

    Graph-based conflict rectification using stroke gesture approach in timetabling system (CORECTS) by Yong, Tien Fui, Choo, Wou Onn, Chue, Wen Yeen, Kok, Hui Meian

    Published 2010
    “…CORECTS will apply a hybrid method using annealing graph algorithm and the proposed STAR-quadrants to display the conflict detection of the entire timetable.Simple stroke gesture is used to expedite the conflict resolution process. …”
    Get full text
  12. 12

    Analyzing students’ experience in programming with computational thinking through competitive, physical, and tactile games: The quadrilateral method approach by Habib, M. A. a, Raja-Yusof, R. -J., Salim, S. S.a, Sani, A. A. a, Sofian, H., Abu Bakar, A.

    Published 2021
    “…We have conducted game activities through several algorithms that include sorting, swapping, and graph algorithms and analyzed how the game affects the student experience (SX) in understanding the CT concept in those algorithms. …”
    Get full text
    Get full text
  13. 13

    Performance analysis of bacterial genome assemblers using illumina next generation sequencing data / Nur ‘ Ain Mohd Ishak by Nur ‘ Ain , Mohd Ishak

    Published 2020
    “…In this study, the performance of four de novo assemblers (SPAdes, ABySS, Velvet and MaSuRCA) is reported, in which variants of de Brujin graph algorithms are applied, using genomic data generated by the Illumina sequencing platform. …”
    Get full text
    Get full text
    Get full text