File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

박성훈

Park, Sunghoon
Biochemical Engineering Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 352 -
dc.citation.number 3 -
dc.citation.startPage 345 -
dc.citation.title KOREAN JOURNAL OF CHEMICAL ENGINEERING -
dc.citation.volume 22 -
dc.contributor.author Han, Sang Il -
dc.contributor.author Lee, Sung Gun -
dc.contributor.author Hou, Bo Kyeng -
dc.contributor.author Park, Sunghoon -
dc.contributor.author Kim, Young Han -
dc.contributor.author Hwang, Kyu Suk -
dc.date.accessioned 2023-12-22T10:36:34Z -
dc.date.available 2023-12-22T10:36:34Z -
dc.date.created 2017-03-04 -
dc.date.issued 2005-05 -
dc.description.abstract Multiple sequence alignment is a method for comparing two or more DNA or protein sequences. Most multiple sequence alignment methods rely on pairwise alignment and Smith-Waterman algorithm [Needleman and Wunsch, 1970; Smith and Waterman, 198 1] to generate an alignment hierarchy. Therefore, as the number of sequences increases, the runtime increases exponentially. To resolve this problem, this paper presents a multiple sequence alignment method using a parallel processing suffix tree algorithm to search for common subsequences at one time without pairwise alignment. The cross-matched subsequences among the searched common subsequences may be generated and those cause inexact-matching. So the procedure of masking cross-matching pairs was suggested in this study. The proposed method, improved STC (Suffix Tree Clustering), is summarized as follows: (1) construction of suffix tree; (2) search and overlap of common subsequences; (3) grouping of subsequence pairs; (4) masking of cross-matching pairs; and (5) clustering of gene sequences. The new method was successfully evaluated with 23 genes in Mus musculus and 22 genes in three species, clustering nine and eight clusters, respectively. -
dc.identifier.bibliographicCitation KOREAN JOURNAL OF CHEMICAL ENGINEERING, v.22, no.3, pp.345 - 352 -
dc.identifier.doi 10.1007/BF02719409 -
dc.identifier.issn 0256-1115 -
dc.identifier.scopusid 2-s2.0-23844484258 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/25382 -
dc.identifier.url https://link.springer.com/article/10.1007%2FBF02719409 -
dc.identifier.wosid 000229718100002 -
dc.language 영어 -
dc.publisher KOREAN INSTITUTE CHEMICAL ENGINEERS -
dc.title A gene clustering method with masking cross-matching fragments using modified suffix tree clustering method -
dc.type Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor multiple sequence alignment -
dc.subject.keywordAuthor clustering -
dc.subject.keywordAuthor sequence -
dc.subject.keywordAuthor gene -
dc.subject.keywordPlus MULTIPLE SEQUENCE ALIGNMENT -
dc.subject.keywordPlus CLUSTAL -
dc.subject.keywordPlus SIMILARITIES -
dc.subject.keywordPlus CONSTRUCTION -
dc.subject.keywordPlus ALGORITHM -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.