Asako Koike
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Asako Koike has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Katsushi Tokunaga
Department of Human Genetics, Graduate School of Medicine, The University of Tokyo, Tokyo, Japan
3 shared publications - Nao Nishida
Genome Medical Science Project, National Center for Global Health and Medicine, Ichikawa, Japan
3 shared publications - Kouichi Kimura
Center for Technology Innovation - Healthcare, Hitachi Ltd., Kokubunji, Tokyo Japan
2 shared publications - Atsushi Tajima
Department of Bioinformatics and Genomics, Graduate School of Advanced Preventive Medical Sciences, Kanazawa University, Kanazawa, Ishikawa, 920-8640, Japan
1 shared publication - Daiki Yamashita
Department of Human Genetics, Graduate School of Medicine, University of Tokyo, Tokyo, Japan
1 shared publication Ituro Inoue
Department of Molecular Life Science and Molecular Medicine, Tokai University School of Medicine, Tokyo, Japan
1 shared publication
Latest Publications
- 17 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 16 (1) , 3-13
Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism
The Burrows-Wheeler transform (BWT) of shortread data has unexplored potential utilities, such as for efficient and sensitive variation analysis against multiple reference genome sequences, because it does not depend on any particular reference genome sequence, unlike conventional mappingbased methods. However, since the amount of read data is generally much larger than the size of the reference sequence, computation of the BWT of reads is not easy, and this hampers development of potential applications. For the alleviation of this problem, a new method of computing the BWT of reads in parallel is proposed. The BWT, corresponding to a sorted list of suffixes of reads, is constructed incrementally by successively including longer and longer suffixes. The working data is divided into more than ten thousand "blocks" corresponding to sublists of suffixes with the same prefixes. Thousands of groups of blocks can be processed in parallel while making exclusive writes and concurrent reads into a shared memory. Reads and writes are basically sequential, and the read concurrency is limited to two. Thus, a fine-grained parallelism, referred to as prefix parallelism, is expected to work efficiently. The time complexity for processing $n$ reads of length $l$ is $O(n^2)$. On actual biological DNA sequence data of about 100 Gbp with a read length of 100 bp (base pairs), a tentative implementation of the proposed method took less than an hour on a singlenode computer; i.e., it was about three times faster than one of the fastest programs developed so far.- 17 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 16 (1) , 3-13
Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism
The Burrows-Wheeler transform (BWT) of shortread data has unexplored potential utilities, such as for efficient and sensitive variation analysis against multiple reference genome sequences, because it does not depend on any particular reference genome sequence, unlike conventional mappingbased methods. However, since the amount of read data is generally much larger than the size of the reference sequence, computation of the BWT of reads is not easy, and this hampers development of potential applications. For the alleviation of this problem, a new method of computing the BWT of reads in parallel is proposed. The BWT, corresponding to a sorted list of suffixes of reads, is constructed incrementally by successively including longer and longer suffixes. The working data is divided into more than ten thousand "blocks" corresponding to sublists of suffixes with the same prefixes. Thousands of groups of blocks can be processed in parallel while making exclusive writes and concurrent reads into a shared memory. Reads and writes are basically sequential, and the read concurrency is limited to two. Thus, a fine-grained parallelism, referred to as prefix parallelism, is expected to work efficiently. The time complexity for processing $n$ reads of length $l$ is $O(n^2)$. On actual biological DNA sequence data of about 100 Gbp with a read length of 100 bp (base pairs), a tentative implementation of the proposed method took less than an hour on a singlenode computer; i.e., it was about three times faster than one of the fastest programs developed so far.- Open Access
- 9 December 2015
- Published by Springer Nature in BMC Bioinformatics
- Vol. 16 (S18) , S5
Analysis of genomic rearrangements by using the Burrows-Wheeler transform of short-read data
The potential utility of the Burrows-Wheeler transform (BWT) of a large amount of short-read data ("reads") has not been fully studied. The BWT basically serves as a lossless dictionary of reads, unlike the heuristic and lossy reads-to-genome mapping results conventionally obtained in the first step of sequence analysis. Thus, it is naturally expected to lead to development of sensitive methods for analysis of short-read data. Recently, one of the most active areas of research in sequence analysis is sensitive detection of rare genomic rearrangements from whole-genome sequencing (WGS) data of heterogeneous cancer samples. The application the BWT of reads to the analysis of genomic rearrangements is addressed in this study.
- 9 December 2015
- Published by Springer Nature in BMC Bioinformatics
- Vol. 16 (S18) , S5
Open AccessAnalysis of genomic rearrangements by using the Burrows-Wheeler transform of short-read data
The potential utility of the Burrows-Wheeler transform (BWT) of a large amount of short-read data ("reads") has not been fully studied. The BWT basically serves as a lossless dictionary of reads, unlike the heuristic and lossy reads-to-genome mapping results conventionally obtained in the first step of sequence analysis. Thus, it is naturally expected to lead to development of sensitive methods for analysis of short-read data. Recently, one of the most active areas of research in sequence analysis is sensitive detection of rare genomic rearrangements from whole-genome sequencing (WGS) data of heterogeneous cancer samples. The application the BWT of reads to the analysis of genomic rearrangements is addressed in this study.
- Open Access
- 12 December 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 469
SNPInterForest: A new method for detecting epistatic interactions
Multiple genetic factors and their interactive effects are speculated to contribute to complex diseases. Detecting such genetic interactive effects, i.e., epistatic interactions, however, remains a significant challenge in large-scale association studies.
- 12 December 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 469
Open AccessSNPInterForest: A new method for detecting epistatic interactions
Multiple genetic factors and their interactive effects are speculated to contribute to complex diseases. Detecting such genetic interactive effects, i.e., epistatic interactions, however, remains a significant challenge in large-scale association studies.
- Open Access
- 1 January 2011
- Published by Springer Nature in BMC Genetics
- Vol. 12 (1) , 29
Comparative analysis of copy number variation detection methods and database construction
Array-based detection of copy number variations (CNVs) is widely used for identifying disease-specific genetic variations. However, the accuracy of CNV detection is not sufficient and results differ depending on the detection programs used and their parameters. In this study, we evaluated five widely used CNV detection programs, Birdsuite (mainly consisting of the Birdseye and Canary modules), Birdseye (part of Birdsuite), PennCNV, CGHseg, and DNAcopy from the viewpoint of performance on the Affymetrix platform using HapMap data and other experimental data. Furthermore, we identified CNVs of 180 healthy Japanese individuals using parameters that showed the best performance in the HapMap data and investigated their characteristics.
- 1 January 2011
- Published by Springer Nature in BMC Genetics
- Vol. 12 (1) , 29
Open AccessComparative analysis of copy number variation detection methods and database construction
Array-based detection of copy number variations (CNVs) is widely used for identifying disease-specific genetic variations. However, the accuracy of CNV detection is not sufficient and results differ depending on the detection programs used and their parameters. In this study, we evaluated five widely used CNV detection programs, Birdsuite (mainly consisting of the Birdseye and Canary modules), Birdseye (part of Birdsuite), PennCNV, CGHseg, and DNAcopy from the viewpoint of performance on the Affymetrix platform using HapMap data and other experimental data. Furthermore, we identified CNVs of 180 healthy Japanese individuals using parameters that showed the best performance in the HapMap data and investigated their characteristics.
- 24 July 2009
- Published by Springer Nature in Journal of Human Genetics
- Vol. 54 (9) , 543-546
Genome-wide association database developed in the Japanese Integrated Database Project
The establishment of high-throughput single-nucleotide polymorphism (SNP)-typing technologies has enabled astonishing progress to be made in genome-wide association studies (GWAS), and various novel genetic factors associated with complex diseases have been discovered. Our organization has created a public repository database (DB) to achieve a continuous and intensive management of GWAS data and to facilitate data sharing among researchers. In the GWAS DB, information on study design, quality control protocols, allele frequencies, genotype frequencies and statistical genetic analysis results are stored as publicly available data and can be accessed freely, whereas individual genotyping data and raw data are stored as restricted data and can only be accessed with authorization. All data are presented by a graphic viewer, which is designed to be user friendly for researchers who are not familiar with GWAS to accelerate disease-related studies. Furthermore, the DB allows users to compare various study results obtained by different institutions and on different platforms. The same data are also managed as a distributed annotation system to call up useful data from other DBs and to superimpose them on the GWAS data for help in interpretation. The DB is accessible at https://gwas.lifesciencedb.jp/.
- 24 July 2009
- Published by Springer Nature in Journal of Human Genetics
- Vol. 54 (9) , 543-546
Genome-wide association database developed in the Japanese Integrated Database Project
The establishment of high-throughput single-nucleotide polymorphism (SNP)-typing technologies has enabled astonishing progress to be made in genome-wide association studies (GWAS), and various novel genetic factors associated with complex diseases have been discovered. Our organization has created a public repository database (DB) to achieve a continuous and intensive management of GWAS data and to facilitate data sharing among researchers. In the GWAS DB, information on study design, quality control protocols, allele frequencies, genotype frequencies and statistical genetic analysis results are stored as publicly available data and can be accessed freely, whereas individual genotyping data and raw data are stored as restricted data and can only be accessed with authorization. All data are presented by a graphic viewer, which is designed to be user friendly for researchers who are not familiar with GWAS to accelerate disease-related studies. Furthermore, the DB allows users to compare various study results obtained by different institutions and on different platforms. The same data are also managed as a distributed annotation system to call up useful data from other DBs and to superimpose them on the GWAS data for help in interpretation. The DB is accessible at https://gwas.lifesciencedb.jp/.
- 1 June 2008
- Vol. 53 (7) , 882-7
[Development of genome-wide association database].
- Open Access
- 1 January 2008
- Published by Springer Nature in BMC Genomics
- Vol. 9 (1) , 431
Evaluating the performance of Affymetrix SNP Array 6.0 platform with 400 Japanese individuals
With improvements in genotyping technologies, genome-wide association studies with hundreds of thousands of SNPs allow the identification of candidate genetic loci for multifactorial diseases in different populations. However, genotyping errors caused by genotyping platforms or genotype calling algorithms may lead to inflation of false associations between markers and phenotypes. In addition, the number of SNPs available for genome-wide association studies in the Japanese population has been investigated using only 45 samples in the HapMap project, which could lead to an inaccurate estimation of the number of SNPs with low minor allele frequencies. We genotyped 400 Japanese samples in order to estimate the number of SNPs available for genome-wide association studies in the Japanese population and to examine the performance of the current SNP Array 6.0 platform and the genotype calling algorithm "Birdseed".
- 1 January 2008
- Published by Springer Nature in BMC Genomics
- Vol. 9 (1) , 431
Open AccessEvaluating the performance of Affymetrix SNP Array 6.0 platform with 400 Japanese individuals
With improvements in genotyping technologies, genome-wide association studies with hundreds of thousands of SNPs allow the identification of candidate genetic loci for multifactorial diseases in different populations. However, genotyping errors caused by genotyping platforms or genotype calling algorithms may lead to inflation of false associations between markers and phenotypes. In addition, the number of SNPs available for genome-wide association studies in the Japanese population has been investigated using only 45 samples in the HapMap project, which could lead to an inaccurate estimation of the number of SNPs with low minor allele frequencies. We genotyped 400 Japanese samples in order to estimate the number of SNPs available for genome-wide association studies in the Japanese population and to examine the performance of the current SNP Array 6.0 platform and the genotype calling algorithm "Birdseed".
- 1 October 2006
- Published by Taylor & Francis in SAR and QSAR in Environmental Research
- Vol. 17 (5) , 497-514
Comparison of methods for chemical-compound affinity prediction
The selection of effective features from various descriptors of chemical compounds and the exploitation of the most appropriate classifier is a momentous issue in improving overall accuracies of virtual screening of chemical compounds. In this article, the performance of various feature-selection methods and various classifiers of chemical compound-protein binding affinities are compared by using six series of compounds: cytochrome P450 2C9 inhibitors, multi-drug-resistance reversal compounds, estrogen receptor ligands, inhibitors of human ether-a-go-go-related genes, and ligands of serotonin receptor 5HT1A and 5HT2A. As a result, it was found that the genetic algorithm was superior to the other feature-selection methods, and its combination with Random Forests and Adaboosts or Baggings gave almost the same performance as support-vector machines and was superior to the other classifiers. The precision and recall of these methods were almost the same or ascendant to those of previous work. The automatically selected descriptors for each protein-compound affinity prediction were plausible and would be informative to interpret the resulting model.
- 1 October 2006
- Published by Taylor & Francis in SAR and QSAR in Environmental Research
- Vol. 17 (5) , 497-514
Comparison of methods for chemical-compound affinity prediction
The selection of effective features from various descriptors of chemical compounds and the exploitation of the most appropriate classifier is a momentous issue in improving overall accuracies of virtual screening of chemical compounds. In this article, the performance of various feature-selection methods and various classifiers of chemical compound-protein binding affinities are compared by using six series of compounds: cytochrome P450 2C9 inhibitors, multi-drug-resistance reversal compounds, estrogen receptor ligands, inhibitors of human ether-a-go-go-related genes, and ligands of serotonin receptor 5HT1A and 5HT2A. As a result, it was found that the genetic algorithm was superior to the other feature-selection methods, and its combination with Random Forests and Adaboosts or Baggings gave almost the same performance as support-vector machines and was superior to the other classifiers. The precision and recall of these methods were almost the same or ascendant to those of previous work. The automatically selected descriptors for each protein-compound affinity prediction were plausible and would be informative to interpret the resulting model.