Filters

2000 - 20092
Reset filters

Settings

Subject: Computer Science

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    PublicationMetadata only
    Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
    (2009-11-10) Areerat Trongratsameethong; Jarernsri L. Mitrpanont; Mahidol University
    , if memory size is not big enough, secondary storage will be needed. This paper proposes the Exhaustive Greedy (EG) algorithm to optimize the intermediate result sizes of join queries. Exhaustive search and greedy algorithm are combined and modified... are comparable to the results estimated by the Exhaustive Search algorithm that is modified to update join graphs, we name it ESU algorithm. © 2009 IEEE.
  • No Thumbnail Available
    PublicationMetadata only
    An omnibus permutation test on ensembles of two-locus analyses for the detection of purely epistatic multi-locus interactions
    (2009-12-01) Waranyu Wongseree; Anunchai Assawamakin; Theera Piroonratana; Saravudh Sinsomros; Chanin Limwongse; Nachol Chaiyaratana; King Mongkut's University of Technology North Bangkok; Mahidol University
    for the epistasis detection. However, exhaustive multi-locus analysis requires prohibitively large computational efforts when problems involve large-scale or genome-wide data. Furthermore, there is no explicit proof that a combination of multiple two-locus analyses... can lead to the correct identification of multi-locus interactions. 2LOmb which performs an omnibus permutation test on ensembles of two-locus analyses is proposed. The algorithm consists of four main steps: two-locus analysis, a permutation test