This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
- 208 views
- 384 downloads
Heuristics Search Project Report: Evaluation of the search algorithims in Multiple Sequence Alignment
-
- Author(s) / Creator(s)
-
Technical report TR06-02. Multiple sequence alignment (MSA) is a controversial problem in computational biology. This particular problem computes the similarity based on the biological properties of nuclei acid (or amino acid) among the DNA strands (or protein sequences). In this project, we study several algorithms in artificial intelligence to solve the multiple sequence alignment, a problem from the computational biology, and we implement two interesting algorithms published in 2000, divide and conquer frontier search and A* with partial expansion. Our final conclusion is that DCFA* can solve the problem in a general area while PEA* may perform better when similar data are used. | TRID-ID TR06-02
-
- Date created
- 2006
-
- Subjects / Keywords
-
- Type of Item
- Report
-
- License
- Attribution 3.0 International