Fast global sequence alignment technique

Handle URI:
http://hdl.handle.net/10754/564456
Title:
Fast global sequence alignment technique
Authors:
Bonny, Mohamed Talal; Salama, Khaled N. ( 0000-0001-7742-1282 )
Abstract:
Bioinformatics database is growing exponentially in size. Processing these large amount of data may take hours of time even if super computers are used. One of the most important processing tool in Bioinformatics is sequence alignment. We introduce fast alignment algorithm, called 'Alignment By Scanning' (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the wellknown sequence alignment algorithms, the 'GAP' (which is heuristic) and the 'Needleman-Wunsch' (which is optimal). The proposed algorithm achieves up to 51% enhancement in alignment score when it is compared with the GAP Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.
KAUST Department:
Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Physical Sciences and Engineering (PSE) Division; Sensors Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)
Conference/Event name:
45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011
Issue Date:
Nov-2011
DOI:
10.1109/ACSSC.2011.6190171
Type:
Conference Paper
ISSN:
10586393
ISBN:
9781467303231
Appears in Collections:
Conference Papers; Physical Sciences and Engineering (PSE) Division; Electrical Engineering Program; Sensors Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorBonny, Mohamed Talalen
dc.contributor.authorSalama, Khaled N.en
dc.date.accessioned2015-08-04T07:01:27Zen
dc.date.available2015-08-04T07:01:27Zen
dc.date.issued2011-11en
dc.identifier.isbn9781467303231en
dc.identifier.issn10586393en
dc.identifier.doi10.1109/ACSSC.2011.6190171en
dc.identifier.urihttp://hdl.handle.net/10754/564456en
dc.description.abstractBioinformatics database is growing exponentially in size. Processing these large amount of data may take hours of time even if super computers are used. One of the most important processing tool in Bioinformatics is sequence alignment. We introduce fast alignment algorithm, called 'Alignment By Scanning' (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the wellknown sequence alignment algorithms, the 'GAP' (which is heuristic) and the 'Needleman-Wunsch' (which is optimal). The proposed algorithm achieves up to 51% enhancement in alignment score when it is compared with the GAP Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleFast global sequence alignment techniqueen
dc.typeConference Paperen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Divisionen
dc.contributor.departmentSensors Laben
dc.identifier.journal2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)en
dc.conference.date6 November 2011 through 9 November 2011en
dc.conference.name45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011en
dc.conference.locationPacific Grove, CAen
kaust.authorBonny, Mohamed Talalen
kaust.authorSalama, Khaled N.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.