DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Science Colleges >
College of Computer and Information Sciences >
College of Computer and Information Sciences >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/15189

Title: An efficient pattern matching algorithm for comparative Genome sequence analysis
Authors: Muneer Ahmad
Hassan Mathkour
Issue Date: 2008
Publisher: World Scientific and Engineering Academy and Society (WSEAS
Abstract: Sequences, meant as logic units of meaningful term successions, can be considered the backbone of data. Consider, for instance, genetic sequences, where the terms are genetic symbols, or plain natural language sentences, formed by words. To name just few examples of sequence use, consider the adoption of sentences for the description of the real world modeled in the database and their role in composing documents. Searching in sequence repositories often requires going beyond exact matching to determine the sequences which are similar or close to a given query sentence (approximate matching). The similarity involved in this process can be based either on the semantics of the sequence or just on its syntax. The former considers the meaning of the terms in the sequences, and is almost impossible to elaborate the results before the proper extraction and analysis while the later approach is sufficiently comprehensive at implementation level. It finds the number of approximate matches of the sequences for optimal results.
URI: http://hdl.handle.net/123456789/15189
Appears in Collections:College of Computer and Information Sciences

Files in This Item:

File Description SizeFormat
Dr.Hassan mathkour-12-conf.docx14.81 kBMicrosoft Word XMLView/Open

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

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback