KAUST DepartmentElectrical Engineering Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Physical Sciences and Engineering (PSE) Division
Permanent link to this recordhttp://hdl.handle.net/10754/564415
MetadataShow full item record
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.
Journal2011 Annual International Conference of the IEEE Engineering in Medicine and Biology Society
Conference/Event name33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS 2011
- FOGSAA: Fast Optimal Global Sequence Alignment Algorithm.
- Authors: Chakraborty A, Bandyopadhyay S
- Issue date: 2013
- Sigma: multiple alignment of weakly-conserved non-coding DNA sequence.
- Authors: Siddharthan R
- Issue date: 2006 Mar 16
- Quaternionic periodicity transform: an algebraic solution to the tandem repeat detection problem.
- Authors: Brodzik AK
- Issue date: 2007 Mar 15
- A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.
- Authors: Ben Nsira N, Lecroq T, Elloumi M
- Issue date: 2015
- How does DNA sequence motif discovery work?
- Authors: D'haeseleer P
- Issue date: 2006 Aug