A Novel Partial Sequence Alignment Tool for Finding Large Deletions
Author(s) -
Taner Aruk,
Duran Üstek,
Olcay Kurşun
Publication year - 2012
Publication title -
the scientific world journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.453
H-Index - 93
eISSN - 2356-6140
pISSN - 1537-744X
DOI - 10.1100/2012/694813
Subject(s) - software , computer science , sequence alignment , multiple sequence alignment , sequence (biology) , alignment free sequence analysis , dna sequencing , software package , smith–waterman algorithm , r package , computational biology , structural alignment , sequence analysis , data mining , algorithm , biology , computational science , genetics , programming language , dna , gene , peptide sequence
Finding large deletions in genome sequences has become increasingly more useful in bioinformatics, such as in clinical research and diagnosis. Although there are a number of publically available next generation sequencing mapping and sequence alignment programs, these software packages do not correctly align fragments containing deletions larger than one kb. We present a fast alignment software package, BinaryPartialAlign, that can be used by wet lab scientists to find long structural variations in their experiments. For BinaryPartialAlign, we make use of the Smith-Waterman (SW) algorithm with a binary-search-based approach for alignment with large gaps that we called partial alignment. BinaryPartialAlign implementation is compared with other straight-forward applications of SW. Simulation results on mtDNA fragments demonstrate the effectiveness (runtime and accuracy) of the proposed method.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom