A BLAST-Based Algorithm to Find Evenly Distributed Unique Subsequences
Maciej Kulawik , Robert Marek Nowak
AbstractGenomics 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.
|Publication size in sheets||0.5|
|Book||Agre Gennady, van Genabith Josef, Declerck Thierry (eds.): Artificial Intelligence: Methodology, Systems, and Applications. 18th International Conference, AIMSA 2018, Proceedings, Lecture Notes in Artificial Intelligence, vol. 11089, 2018, Springer International Publishing, ISBN 978-3-319-99343-0, [978-3-319-99344-7], 292 p., DOI:10.1007/978-3-319-99344-7|
|Keywords in English||Bioinformatics · Genomics rearrangements detection Computer program · Marker · BLAST|
|Score|| = 15.0, 04-09-2018, BookChapterSeriesAndMatConf|
= 15.0, 04-09-2018, BookChapterSeriesAndMatConf
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.