Type
Conference PaperKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionElectrical Engineering Program
Physical Science and Engineering (PSE) Division
Sensors Lab
Date
2011-11Permanent link to this record
http://hdl.handle.net/10754/564456
Metadata
Show full item recordAbstract
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.Citation
Bonny, T., & Salama, K. N. (2011). Fast global sequence alignment technique. 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR). doi:10.1109/acssc.2011.6190171Conference/Event name
45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011ISBN
9781467303231ae974a485f413a2113503eed53cd6c53
10.1109/ACSSC.2011.6190171