A BLAST-Based Algorithm to Find Evenly Distributed Unique Subsequences
Genomics rearrangements detection involves processing of large amounts of DNA data and therefore efficiency of the used algorithms is crucial. We propose the algorithm based on evenly distributed unique subsequences. In this paper BLAST-based pattern matching is examined in terms of computation time and detection quality. The experiments were carried out both on real sequence with artificially introduced random rearrangements. The algorithm extension was implemented as part of genomecmp web application which provides graphical user interface for ease and convenience of use.
KeywordsBioinformatics Genomics rearrangements detection Computer program Marker BLAST
- 1.Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403–410 (1990). https://doi.org/10.1016/S0022-2836(05)80360-2. http://www.sciencedirect.com/science/article/pii/S0022283605803602CrossRefGoogle Scholar
- 4.Kulawik, M., Nowak, R.M.: Genomecmp: computer software to detect genomic rearrangements using markers (2017). https://doi.org/10.1117/12.2280483