Stojanov, Done (2019) Algorithms for genomic similarity search: a review. Annals of West University of Timisoara, Series of Biology, 21 (2). pp. 185-192. ISSN 2285-7044
Preview |
Text
AWUTSerBio_December2018_185-192_final_STOYANOV.pdf Download (200kB) | Preview |
Official URL: https://www.cbg.uvt.ro/wp-content/uploads/2014/07/...
Abstract
In this paper we consider the properties of the most popular algorithms for genomic similarity search. All these methods use some type of heuristics to improve the speed of
search that has negative impact upon the accuracy.
Some of these methods split the content into small pieces of data, some of them use hashing, while some of them utilize the computational benefits of suffix tree. In many cases the output depends of the user-provided parameters that define the sensitivity and the range of search.
Item Type: | Article |
---|---|
Subjects: | Natural sciences > Biological sciences Natural sciences > Computer and information sciences |
Divisions: | Faculty of Computer Science |
Depositing User: | Done Stojanov |
Date Deposited: | 30 Jan 2019 06:59 |
Last Modified: | 30 Jan 2019 06:59 |
URI: | https://eprints.ugd.edu.mk/id/eprint/21284 |
Actions (login required)
![]() |
View Item |