Show simple item record

dc.contributor.authorBonny, Mohamed Talal
dc.contributor.authorSalama, Khaled N.
dc.date.accessioned2015-08-04T06:26:51Z
dc.date.available2015-08-04T06:26:51Z
dc.date.issued2011-08
dc.identifier.isbn9781424441211
dc.identifier.issn1557170X
dc.identifier.pmid22254463
dc.identifier.doi10.1109/IEMBS.2011.6090209
dc.identifier.urihttp://hdl.handle.net/10754/564415
dc.description.abstractSequence alignment is an essential tool in almost any computational biology research. It processes large database sequences and considered to be high consumers of computation time. Heuristic algorithms are used to get approximate but fast results. 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 well-known alignment algorithms, the FASTA (which is heuristic) and the 'Needleman-Wunsch' (which is optimal). The proposed algorithm achieves up to 76% enhancement in alignment score when it is compared with the FASTA Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.titleABS: Sequence alignment by scanning
dc.typeConference Paper
dc.contributor.departmentElectrical Engineering Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Division
dc.contributor.departmentSensors Lab
dc.identifier.journal2011 Annual International Conference of the IEEE Engineering in Medicine and Biology Society
dc.conference.date30 August 2011 through 3 September 2011
dc.conference.name33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS 2011
dc.conference.locationBoston, MA
kaust.personBonny, Mohamed Talal
kaust.personSalama, Khaled N.


This item appears in the following Collection(s)

Show simple item record