scispace - formally typeset
T

Taishin Kin

Researcher at National Institute of Advanced Industrial Science and Technology

Publications -  31
Citations -  2762

Taishin Kin is an academic researcher from National Institute of Advanced Industrial Science and Technology. The author has contributed to research in topics: Peptide sequence & Aspergillus oryzae. The author has an hindex of 16, co-authored 31 publications receiving 2620 citations. Previous affiliations of Taishin Kin include National Institute of Technology and Evaluation.

Papers
More filters
Journal ArticleDOI

Genome sequencing and analysis of Aspergillus oryzae

Masayuki Machida, +64 more
- 22 Dec 2005 - 
TL;DR: Specific expansion of genes for secretory hydrolytic enzymes, amino acid metabolism and amino acid/sugar uptake transporters supports the idea that A. oryzae is an ideal microorganism for fermentation.
Journal ArticleDOI

Drosophila endogenous small RNAs bind to Argonaute 2 in somatic cells

TL;DR: These findings indicate that different types of small RNAs and Argonautes are used to repress retrotransposons in germline and somatic cells in Drosophila.
Journal ArticleDOI

Marginalized kernels for biological sequences.

TL;DR: This work proposes a reasonable way of designing a kernel when objects are generated from latent variable models (e.g., HMM), and derives several marginalized kernels useful for biological sequences.
Journal ArticleDOI

fRNAdb: a platform for mining/annotating functional RNA candidates from non-coding RNA sequences

TL;DR: The fRNAdb database as discussed by the authors provides a large collection of non-coding transcripts including annotated/non-annotated sequences from the H-inv database, NONCODE and RNAdb.
Journal ArticleDOI

A fast structural multiple alignment method for long RNA sequences.

TL;DR: A fast algorithm for structural alignment of multiple RNA sequences that is an extension of the pairwise structural alignment method (implemented in SCARNA) that is fast enough for large-scale analyses with accuracies at least comparable to those of existing algorithms.