Towards efficient searching on the secondary structure of protein sequences

Minkoo Seo, Sanghyun Park, Jung Im Won

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Approximate searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, because proteins distant in an evolutionary history do not conserve amino acid residue arrangements, approximate searching on proteins' secondary structure is quite important in finding out distant homology. In this paper, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. According to the experimental results, the proposed method was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

Original languageEnglish
Pages (from-to)525-542
Number of pages18
JournalFundamenta Informaticae
Volume78
Issue number4
Publication statusPublished - 2007 Sep 18

Fingerprint

Protein Sequence
Secondary Structure
Indexing
Proteins
Amino Acids
Arrangement
Protein
Look-ahead
Conserve
Protein Structure
Range of data
Amino acids
Homology
Clustering
Query
Evaluate
Experimental Results
Experiment
History
Experiments

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Cite this

@article{2023c4f1f74245ba8ad45b7a46bb6a37,
title = "Towards efficient searching on the secondary structure of protein sequences",
abstract = "Approximate searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, because proteins distant in an evolutionary history do not conserve amino acid residue arrangements, approximate searching on proteins' secondary structure is quite important in finding out distant homology. In this paper, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. According to the experimental results, the proposed method was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.",
author = "Minkoo Seo and Sanghyun Park and Won, {Jung Im}",
year = "2007",
month = "9",
day = "18",
language = "English",
volume = "78",
pages = "525--542",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "4",

}

Towards efficient searching on the secondary structure of protein sequences. / Seo, Minkoo; Park, Sanghyun; Won, Jung Im.

In: Fundamenta Informaticae, Vol. 78, No. 4, 18.09.2007, p. 525-542.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Towards efficient searching on the secondary structure of protein sequences

AU - Seo, Minkoo

AU - Park, Sanghyun

AU - Won, Jung Im

PY - 2007/9/18

Y1 - 2007/9/18

N2 - Approximate searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, because proteins distant in an evolutionary history do not conserve amino acid residue arrangements, approximate searching on proteins' secondary structure is quite important in finding out distant homology. In this paper, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. According to the experimental results, the proposed method was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

AB - Approximate searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, because proteins distant in an evolutionary history do not conserve amino acid residue arrangements, approximate searching on proteins' secondary structure is quite important in finding out distant homology. In this paper, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. According to the experimental results, the proposed method was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

UR - http://www.scopus.com/inward/record.url?scp=34548582029&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548582029&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:34548582029

VL - 78

SP - 525

EP - 542

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 4

ER -