Naslov
Pattern Searching in Genome

Autori
Markić, Ivan ; Štula, Maja ; Jukić, Marija

Izvornik
International Journal of Advancements in Computing Technology (2005-8039) 10 (2018), 1; 36-46

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
string pattern matching, genome, DNA, biological data, exact and approximate string matching

Sažetak
The pattern search is one of the oldest problems in computer science. It plays an important process applied in almost all other branches of science. Finding a sequence pattern poses a big challenge for scientists such as geneticists, biologists and physicians who can better understand the structure of DNA and enable improvement of treatments for many disorders and illnesses by identifying the appropriate specimen. Pattern searching algorithms in sequences are used in areas such as bioinformatics, information security, text mining etc. In the context of continuous increase of data in data large era (Big data), efficient algorithms are necessary to ensure that one can find pattern in a sequence in a fast and accurate manner. Pattern searching can be seen as the problem of finding a pattern exhibiting certain properties within a given sequence of symbols. The aim of this article is to presents algorithms for searching pattern in sequences and their application in bioinformatics.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo, Biotehnologija

POVEZANOST RADA