| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MSS, CAS, SIP, VLD | 2023-07-07 11:20 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Enhancing Glycan Recognition Pattern Learning with Tree-Structured Data Mining Kento Totsuka, Norihiko Shinomiya, Kiyoko Kinoshita, Masae Hosoda (Soka Univ.)  CAS2023-20 VLD2023-20 SIP2023-36 MSS2023-20 |
In recent times, the rapid proliferation of semi-structured data has been primarily fueled by the emergence of the World... [more] | CAS2023-20 VLD2023-20 SIP2023-36 MSS2023-20 pp.97-101 |
| CPSY, DC, IPSJ-ARC [detail] | 2019-07-25 13:25 |
Hokkaido | Kitami Civic Hall | Acceleration of Human Genome Phenotypic Analysis using Bit-Parallel Search and Multiprocessing Yuichiro Miyamoto, Masao Okita, Fumihiko Ino (Osaka Univ.) CPSY2019-25 DC2019-25 |
In this paper, we propose a combined method of a bit-parallel search in a base sequence and multiprocessing of t-tests f... [more] | CPSY2019-25 DC2019-25 pp.117-122 |
| IBISML | 2018-11-05 15:10 |
Hokkaido | Hokkaido Citizens Activites Center (Kaderu 2.7) | [Poster Presentation]
Tensor decomposition based unsupervised feature extraction applied to bioinformatics Y-h. Taguchi (Chuo Univ.) IBISML2018-90 |
Although supervised and reinforcement learning including deap learning performs excellent achievements, it is not applic... [more] | IBISML2018-90 pp.345-352 |
| SS, MSS | 2018-01-19 15:55 |
Hiroshima | Common Sub-Graph Extraction from Idiom Networks of Amino Acid Short Constituent Sequences Kentaro Maeshiro (Ryukyu Univ), Takeshi Tengan (Meio Univ), Morikazu Nakamura (Ryukyu Univ) MSS2017-73 SS2017-60 |
We proposed and developed in our previous works a way to analyze the primal protein structure based on occurrence probab... [more] | MSS2017-73 SS2017-60 pp.149-153 |
|
| IBISML | 2016-11-16 15:00 |
Kyoto | Kyoto Univ. | [Poster Presentation]
Principal Component Analysis based unsupervised Feature Extraction applied to Bioinformatics Y-h. Taguchi (Chuo Univ.) IBISML2016-47 |
Recently, numerous researches were performed for the machine/statisitical learning. Among those, deep learning is especi... [more] | IBISML2016-47 pp.17-24 |
| NC, IPSJ-BIO, IBISML, IPSJ-MPS (Joint) [detail] |
2015-06-23 09:30 |
Okinawa | Okinawa Institute of Science and Technology | Principal component analysis-based unsupervised feature extraction applied to in silico drug discovery for posttraumatic stress disorder-mediated heart disease Y-h. Taguchi, Mitsuo Iwadate, Hideaki Umeyama (Chuo Univ) IBISML2015-1 |
Background Feature extraction (FE) is difficult, particularly if there are more features than samples, as small sample ... [more] |
IBISML2015-1 pp.1-8 |
| SC | 2015-06-05 13:55 |
Tokyo | National Institute of Informatics 12F 1210/1208 | Applications of Docker Containers and Cloud Systems to Next Generation Sequencing Data Analysis Osamu Ogasawara (Nat. Inst. Genet.), Tazro Ohta (DBCLS) SC2015-3 |
Reproducibility of the results of research papers is one of the most fundamental requirement for scientific researches. ... [more] | SC2015-3 pp.13-18 |
| SSS | 2014-12-16 14:20 |
Tokyo | Shibaura Institute of Technology | Of personalized medicine and gene personal information by DNA chip Security Tousaku Kojima (YNU) SSS2014-20 |
The genome, I refer to all the genetic information of the organism. Constituents of the genome is the NDA. Is a genome a... [more] | SSS2014-20 pp.9-12 |
| IBISML | 2014-11-17 17:00 |
Aichi | Nagoya Univ. | [Poster Presentation]
Heuristic principal component analysis based unsupervised feature extraction and its application to bioinformatics Y-h. Taguchi (Chuo Univ) IBISML2014-46 |
: Feature extraction (FE) is a difficult task when the number of features is much larger than the number of samples, a... [more] |
IBISML2014-46 pp.87-94 |
| IA | 2014-10-07 13:40 |
Osaka | Grand Front OSAKA Tower-B 10F | Network environments of the NIG supercomputer and International Nucleotide Sequence Database (INSD) Osamu Ogasawara (NIG) IA2014-26 |
The supercomputer system of the National Institute of Genetics (NIG) has as its purpose (1) construction of the Interna... [more] |
IA2014-26 pp.13-18 |
| RECONF | 2013-05-20 15:00 |
Kochi | Kochi Prefectural Culture Hall | An FPGA Implementation of the Progressive Tree Neighborhood Algorithm
-- Phylogenetic Tree Reconstruction with Maximum Parsimony -- Henry Block, Tsutomu Maruyama (Univ. of Tsukuba) RECONF2013-2 |
In this paper, we present an FPGA-hardware implementation for the progressive tree neighborhood algorithm applied to phy... [more] | RECONF2013-2 pp.7-12 |
| RECONF | 2013-05-20 15:50 |
Kochi | Kochi Prefectural Culture Hall | FPGA Acceleration of Short Read Mapping Yoko Sogabe, Tsutomu Maruyama (Univ. of Tsukuba) RECONF2013-4 |
The rapid development of Next Generation Sequencing has enabled to generate more than 100 billion base pairs per day fro... [more] | RECONF2013-4 pp.19-24 |
| COMP | 2012-10-31 11:00 |
Miyagi | Tohoku University | [Invited Talk]
Data-driven bioinformatics in the Biological Information Big bang Kengo Kinoshita (Tohoku Univ.) COMP2012-36 |
According to the rapid growth of biological data in the past decade, biological science is becoming one of the targets o... [more] | COMP2012-36 p.15 |
| SIS | 2010-12-02 16:10 |
Nara | [Invited Talk]
Species-metabolte Database KNApSAcK
-- towards systematization of medicinal/edible plants around the world -- Shigehiko Kanaya, Aki Hirai, Hiroki Takahashi, Altaf Ul-Amin, Kensuke Nakamura (NAIST) SIS2010-47 |
In a metabolomics research, assignment of measured spectra to a specific metabolite is one of the most fundamental proce... [more] | SIS2010-47 pp.71-76 |
|
| IBISML | 2010-06-15 10:25 |
Tokyo | Takeda Hall, Univ. Tokyo | [Invited Talk]
Statistical testing with large multiplicity Shigeyuki Oba (Kyoto Univ./JST) IBISML2010-15 |
Statistical hypothesis testing is a basic tool in broad areas of scientific studies and guarantees that an assertion... [more] |
IBISML2010-15 pp.95-102 |
| VLD, CPSY, RECONF, IPSJ-SLDM | 2009-01-30 16:35 |
Kanagawa | An FPGA implementation of Gibbs sampling method towards high-speed motif search Yuka Sato, Junko Tazawa, Toshiaki Miyazaki (Univ. of Aizu) VLD2008-124 CPSY2008-86 RECONF2008-88 |
It is very important to detect a common motif, i.e., partial base sequence, from DNA sequences in bioinformatics researc... [more] | VLD2008-124 CPSY2008-86 RECONF2008-88 pp.195-199 |
|
| CAS, NLP | 2007-10-19 10:10 |
Tokyo | Musashi Institute of Technology | Influence of Refractory Effects of Chaotic Motif Sampler for Motif Extraction Problems Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) CAS2007-55 NLP2007-83 |
An algorithm for solving combinatorial optimization problems by a chaotic neurodynamics has already been proposed and e... [more] |
CAS2007-55 NLP2007-83 pp.19-24 |
| COMP | 2007-05-25 13:20 |
Fukuoka | Kyushu University | An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes Takeyuki Tamura, Tatsuya Akutsu (Kyoto Univ.) COMP2007-13 |
The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor i... [more] | COMP2007-13 pp.13-18 |
| COMP | 2005-09-15 14:35 |
Osaka | Osaka Univ., Toyonaka Campus | A Polynomial Space Polynomial Delay Algorithm for Enumerating Maximal Motifs in a Sequence Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII) |
In this paper, we consider the problem of finding all maximal motifs in an input string for the class of repeated motifs... [more] | COMP2005-32 pp.31-38 |
| MSS | 2005-08-22 13:50 |
Aichi | Aichi Prefectural University | Distributed and parallel genetic algorithms in OBIGrid Masakazu Ohba, Jerome Ochieng, Morikazu Nakamura (Univ. of the Ryukyus) |
This paper evaluates a parallel distribution evolutionary computation technique using the remote computing resource envi... [more] | CST2005-16 pp.13-17 |
[Return to Top Page]