• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.1
• /
• pp.11-16
• /
• 2006

To manipulate large video databases, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-w]so user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm to extract key frames using color histograms and to match the video sequences using edge features. To effectively match video sequences with low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with several real sequences show that the proposed video retrieval algorithm using color and edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.613-624
• /
• 2003

This paper proposes a design for efficient and accurate retrieval of similar image subsequences using the multi-dimensional time warping distance as similarity evaluation tool in image sequence database after building of two indexing structures implemented with priority queue and suffix tree respectively. Receiving query image sequence, at first step, the proposed method searches the candidate set of similar image subsequences in priory queue index structure. If it can not get satisfied results, it retrieves another candidate set in suffix tree index structure at second step. The using of the low-bound distance function can remove the dissimilar subsequence without false dismissals during similarity evaluating process between query image sequence and stored sequences in two index structures.

• Journal of Microbiology and Biotechnology
• /
• v.9 no.4
• /
• pp.404-413
• /
• 1999

Methanopyrus kandleri is a hyperthermophilic methanogen that represents one of the most heat-resistant organisms: the maximum growth temperature of M. kandleri is $110^{\circ}C$. A random sequence analysis of the genomic DNA of M. kandleri has been performed to obtain genomic information. More than 200 unique sequence tags were obtained and compared with the sequences in the GenBank and PIR databases. About 30% of the analyzed tags showed strong sequence similarity to previously identified genes involved in various cellular processes such as biosynthesis, transport, methanogenesis, or metabolism. When statistics relating to the frequency of codons were examined, the sequenced open reading frames showed highly biased codon usage and a high content of charged amino acids. Among the identified genes, a homologue of the catalytic subunit of carbon monoxide dehydrogenase (CODH) that reduces $CO_2$ to CO was cloned and sequenced in order to examine its detailed gene structure. The cloned gene includes consensus promoters. The amino acid sequence of the cloned gene shows a strong homology with the CODH genes from methanogenic Archaea, especially in the presumed binding sites for Fe-S centers.

• Journal of Microbiology and Biotechnology
• /
• v.17 no.8
• /
• pp.1330-1337
• /
• 2007

To better understand the gene expression of the cold-adapted polar diatom, we conducted a survey of the Chaetoceros neogracile transcriptome by cDNA sequencing and expression of interested cDNAs from the Antarctic diatom. A non-normalized cDNA library was constructed from the C. neogracile, and a total of 2,500 cDNAs were sequenced to generate 1,881 high-quality expressed sequence tags (ESTs) (accession numbers EL620615-EL622495). Based on their clustering, we identified 154 unique clusters comprising 342 ESTs. The remaining 1,540 ESTs did not cluster. The number of unique genes identified in the data set is thus estimated to be 1,694. Taking advantage of various tools and databases, putative functions were assigned to 939 (55.4%) of these genes. Of the remaining 540 (31.9%) unknown sequences, 215 (12.7%) appeared to be C. neogracile-specific since they lacked any significant sequence similarity to any sequence available in the public databases. C. neogracile consisted of a relatively high percentage of genes involved in metabolism, genetic information processing, cellular processes, defense or stress resistance, photosynthesis, structure, and signal transduction. From the ESTs, the expression of these putative C. neogracile genes was investigated: fucoxanthin chlorophyll (chl) a,c-binding protein (FCP), ascorbate peroxidase (ASP), and heat-shock protein 90 (HSP90). The abundance of ASP and HSP90 changed substantially in response to different culture conditions, indicating the possible regulation of these genes in C. neogracile.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1003-1010
• /
• 2004

In this paper, we address efficient processing of subsequence matching in time-series databases. We first point out the performance problems occurring in the index searching of a prior method for subsequence matching. Then, we propose a new method that resolves these problems. Our method starts with viewing the index searching of subsequence matching from a new angle, thereby regarding it as a kind of a spatial-join called a window-join. For speeding up the window-join, our method builds an R＊-tree in main memory for f query sequence at starting of sub-sequence matching. Our method also includes a novel algorithm for joining effectively one R＊-tree in disk, which is for data sequences, and another R＊-tree in main memory, which is for a query sequence. This algorithm accesses each R＊-tree page built on data sequences exactly cure without incurring any index-level false alarms. Therefore, in terms of the number of disk accesses, the proposed algorithm proves to be optimal. Also, performance evaluation through extensive experiments shows the superiority of our method quantitatively.

• Journal of the Korean Wood Science and Technology
• /
• v.18 no.2
• /
• pp.49-66
• /
• 1990

In order to identify an unknown wood sample native to Korea. the softwood databases(KSWCHUN; Korean SoftWood CHUN) and the hardwood databases(KHWCHUN; Korean HardWood CHUN) had been built. and the new computer searching programs(IDINEX; IDentification INformation EXpress) has been written in Turbo Pascal(V.5.0) and in Macro Assembly(V.5.0). The characters of the data were based on the 74 features of softwood and on the 148 features of hardwood which are a part of new "IAWA list of microscopic features for hardwood identification" published in 1989. For the purpose of this investigation the wood anatomical nature of 25 species of softwood(13 genera of 5 families) and of 112 species of hardwood(57 genera of 31 families) were observed under a scanning electron microscope and light microscope. and a lot of literature used. The IDINEX programs are based on edge-punched card keys. with several improvements. The maximum number of features in the IDINEX is 229. but that is fixed for a given database. Large numbers of taxa are handled efficiently and new taxa easily added. A search may be based on sequence numbers of features. Comparisons are made sequentially by feature and taxon using the entire suite of features specified to produce the list of possible matching taxa. The results are followings. (1) The databases of Korean wood and the searching programs(IDINEX) had been built. (2) The databases of Korean wood could be an information to search an unknown wood. (3) The databases would be valuable. for the new features, which were not mentioned in Korean wood up to the present. were observed in details. (4) The ultrastructures of the cell walls(warty layer) and crystals observed under a scanning electron microscope will be helpful to search an unknown wood in particular. (5) The searching process is more quick and accurate than the others. 6) We can obtain the information on the differences of a species from the other and search an unknown wood using probability. in IDINEX, (7) The IDINEX will be utilized to identify and classify an animal life, vegetable world, mineral kingdom, and so on.

• Journal of Microbiology and Biotechnology
• /
• v.30 no.9
• /
• pp.1335-1342
• /
• 2020

The identification of bacterial pathogens to humans is critical for environmental microbial risk assessment. However, current methods for identifying pathogens in environmental samples are limited in their ability to detect highly diverse bacterial communities and accurately differentiate pathogens from commensal bacteria. In the present study, we suggest an improved approach using a combination of identification results obtained from multiple databases, including the multilocus sequence typing (MLST) database, virulence factor database (VFDB), and pathosystems resource integration center (PATRIC) databases to resolve current challenges. By integrating the identification results from multiple databases, potential bacterial pathogens in metagenomes were identified and classified into eight different groups. Based on the distribution of genes in each group, we proposed an equation to calculate the metagenomic pathogen identification index (MPII) of each metagenome based on the weighted abundance of identified sequences in each database. We found that the accuracy of pathogen identification was improved by using combinations of multiple databases compared to that of individual databases. When the approach was applied to environmental metagenomes, metagenomes associated with activated sludge were estimated with higher MPII than other environments (i.e., drinking water, ocean water, ocean sediment, and freshwater sediment). The calculated MPII values were statistically distinguishable among different environments (p < 0.05). These results demonstrate that the suggested approach allows more for more accurate identification of the pathogens associated with metagenomes.

• Journal of Microbiology and Biotechnology
• /
• v.24 no.10
• /
• pp.1301-1307
• /
• 2014

White-rot fungi of the genus Bjerkandera are cosmopolitan and have shown potential for industrial application and bioremediation. When distinguishing morphological characters are no longer present (e.g., cultures or dried specimen fragments), characterizing true sequences of Bjerkandera is crucial for accurate identification and application of the species. To build a framework for molecular identification of Bjerkandera, we carefully identified specimens of B. adusta and B. fumosa from Korea based on morphological characters, followed by sequencing the internal transcribed spacer region and 28S nuclear ribosomal large subunit. The phylogenetic analysis of Korean Bjerkandera specimens showed clear genetic differentiation between the two species. Using this phylogeny as a framework, we examined the identification accuracy of sequences available in GenBank. Analyses revealed that many Bjerkandera sequences in the database are either misidentified or unidentified. This study provides robust reference sequences for sequence-based identification of Bjerkandera, and further demonstrates the presence and dangers of incorrect sequences in GenBank.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.99-102
• /
• 2004

Recently according to developing of bioinformatics techniques, there are a lot of researches about large amount of biological data. And a variety of files and databases are being used to manage these data efficiently. However, because of the deficiency of standardization there are a lot of problems to manage the data and transform one into the other among heterogeneous formats. We are interested in integrating. saving, and managing gene and protein sequence data generated through sequencing. Accordingly, in this paper the goal of our research is to implement the system to manage sequence data and transform a sequence file format into other format. To satisfy these requirements, we adopt BSML (Bioinformatics Sequence Markup Language) as the standard to manage the bioinformatics data. And then we integrate and store the heterogeneous 리at file formats using BSML schema based DTD. And we developed the system to apply the characteristics of object-oriented database and to process XPath query, one of the efficient structural query. that saves and manages XML documents easily.