Alu elements undergo amplification through retroposition and integration into new locations throu... more Alu elements undergo amplification through retroposition and integration into new locations throughout primate genomes. Over 500,000 Alu elements reside in the human genome, making the identification of newly inserted Alu repeats the genomic equivalent of finding needles in the haystack. Here, we present two complementary methods for rapid detection of newly integrated Alu elements. In the first approach we employ computational biology to mine the human genomic DNA sequence databases in order to identify recently integrated Alu elements. The second method is based on an anchor-PCR technique which we term Allele-Specific Alu PCR (ASAP). In this approach, Alu elements are selectively amplified from anchored DNA generating a display or 'fingerprint' of recently integrated Alu elements. Alu insertion polymorphisms are then detected by comparison of the DNA fingerprints generated from different samples. Here, we explore the utility of these methods by applying them to the identification of members of the smallest previously identified subfamily of Alu repeats in the human genome termed Ya8. This subfamily of Alu repeats is composed of about 50 elements within the human genome. Approximately 50% of the Ya8 Alu family members have inserted in the human genome so recently that they are polymorphic, making them useful markers for the study of human evolution.
We present a hierarchical scheme for synthesis of concept approximations based on given data and ... more We present a hierarchical scheme for synthesis of concept approximations based on given data and domain knowledge. We also propose a solution, founded on rough set theory, to the problem of constructing the approximation of higher level concepts by composing the approximation of lower level concepts. We examine the effectiveness of the layered learning approach by comparing it with the standard learning approach. Experiments are carried out on artificial data sets generated by a road traffic simulator.
We propose efficient heuristics for computingfrom data table basic tools (like lowerand upper app... more We propose efficient heuristics for computingfrom data table basic tools (like lowerand upper approximations, positive regions,reducts) for rough set methods. Our heuristicsare feasible for large data tables. Weshow that the proposed tools can be appliedto discretization of real value attributes inlarge data tables.1 IntroductionRough sets theory (Pawlak 1991) can be treated asa tool for data table analysis. The most commonlyused
Alu elements undergo amplification through retroposition and integration into new locations throu... more Alu elements undergo amplification through retroposition and integration into new locations throughout primate genomes. Over 500,000 Alu elements reside in the human genome, making the identification of newly inserted Alu repeats the genomic equivalent of finding needles in the haystack. Here, we present two complementary methods for rapid detection of newly integrated Alu elements. In the first approach we employ computational biology to mine the human genomic DNA sequence databases in order to identify recently integrated Alu elements. The second method is based on an anchor-PCR technique which we term Allele-Specific Alu PCR (ASAP). In this approach, Alu elements are selectively amplified from anchored DNA generating a display or 'fingerprint' of recently integrated Alu elements. Alu insertion polymorphisms are then detected by comparison of the DNA fingerprints generated from different samples. Here, we explore the utility of these methods by applying them to the identification of members of the smallest previously identified subfamily of Alu repeats in the human genome termed Ya8. This subfamily of Alu repeats is composed of about 50 elements within the human genome. Approximately 50% of the Ya8 Alu family members have inserted in the human genome so recently that they are polymorphic, making them useful markers for the study of human evolution.
We present a hierarchical scheme for synthesis of concept approximations based on given data and ... more We present a hierarchical scheme for synthesis of concept approximations based on given data and domain knowledge. We also propose a solution, founded on rough set theory, to the problem of constructing the approximation of higher level concepts by composing the approximation of lower level concepts. We examine the effectiveness of the layered learning approach by comparing it with the standard learning approach. Experiments are carried out on artificial data sets generated by a road traffic simulator.
We propose efficient heuristics for computingfrom data table basic tools (like lowerand upper app... more We propose efficient heuristics for computingfrom data table basic tools (like lowerand upper approximations, positive regions,reducts) for rough set methods. Our heuristicsare feasible for large data tables. Weshow that the proposed tools can be appliedto discretization of real value attributes inlarge data tables.1 IntroductionRough sets theory (Pawlak 1991) can be treated asa tool for data table analysis. The most commonlyused
Uploads
Papers by Son Nguyen