• Mar 26, 2024 News!Vol.16, No. 1 has been published with online version.   [Click]
  • Jan 02, 2024 News!All papers in IJET will be publihsed article by article staring from 2024.
  • Nov 03, 2023 News!News | Vol.15, No. 4 has been published with online version.   [Click]
General Information
    • ISSN: 1793-8236 (Online)
    • Abbreviated Title Int. J. Eng. Technol.
    • Frequency:  Quarterly 
    • DOI: 10.7763/IJET
    • APC: 500 USD
    • Managing Editor: Ms. Jennifer Zeng
    • Abstracting/ Indexing: Inspec (IET), CNKI Google Scholar, EBSCO, ProQuest, Crossref, Ulrich Periodicals Directory, Chemical Abstracts Services (CAS), etc.
    • E-mail: ijet_Editor@126.com
IJET 2009 Vol.1(3): 201-203 ISSN: 1793-8236
DOI: 10.7763/IJET.2009.V1.37

Pattern Segmented Positioning For Hasty Matching Using Dynamic Size Sliding Window

Jayanthi Manicassamy and P. Dhavachelvan

Abstract—Merging computational biology with few other sciences for solving real world biological problems involves, various high throughput techniques for better decision making. Sequence analysis plays major role in identifying the type of disease suspected from the given gene expression through pattern matching. Which is also used in analyzing proteins structural differences, motif search, text mining etc… Performance plays a major role in extracting matched patterns from a given sequence or from a database independent of the size of the sequence. To extract pattern match from a large sequence from a database it takes more time in order to reduce searching time we have proposed an approach that reduces the search time with accurate retrieval and positioning of the matched pattern in the sequence. This algorithm makes use of window sliding technique in which, incorporation of segmenting the whole pattern that is to be searched is done in order to reduce the search time. Each segmentation pattern is taken for pattern match in a particular sequence starting from the first segmentation if a match found next segmentation will be checked in combination with the previous segmentation. This process takes place in multiple sequences until retrieving the exact pattern sequence or sequence related information’s from the database. Matching a pattern in a sequence or searching a sequence itself, independent of the sequence size or any number sequence that exists. This algorithm is considered to be advanced compared to that of sliding window technique, used for analyzing the exact pattern from the required sequence.

Index Terms—Algorithm, Bioinformatics, Databases, Pattern matching, Sequence Analysis, Text Mining.

Jayanthi Manicassamy and P. Dhavachelvan are from Department of Computer Science, Pondicherry University, Kalapet, Pondicherry, India. (E-mail: jmanic2@yahoo.com, dhavachelvan@gmail.com).


Cite: Jayanthi Manicassamy and P. Dhavachelvan, "Pattern Segmented Positioning For Hasty Matching Using Dynamic Size Sliding Window," International Journal of Engineering and Technology vol. 1, no. 3, pp. 201-203, 2009.

Copyright © 2008-2024. International Journal of Engineering and Technology. All rights reserved. 
E-mail: ijet_Editor@126.com