With increasing size of sequence databases heuristic search approaches have become necessary. Hidden Markov models are the best performing search methods known today with respect to discriminative power, but are too time complex to be practical when searching in large sequence databases. In this report, heuristic algorithms that reduce the search space before searching with traditional search algorithms of hidden Markov models are presented and experimentally validated. The results of the validation show that the heuristic search algorithms will speed up the searches without decreasing their discriminative power.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:his-530 |
| Date | January 2001 |
| Creators | Jochumsson, Thorvaldur |
| Publisher | Högskolan i Skövde, Institutionen för datavetenskap, Skövde : Institutionen för datavetenskap |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/postscript |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0017 seconds