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.
Search
Skip to Search Results- 4Computational biology
- 1Approximation algorithms
- 1Chordal
- 1Constrained bipartite matching
- 1Efficient algorithm
- 1Interval scheduling
-
2005
Technical report TR05-18. Reconstruction of an evolutionary history for a set of organisms is an important research subject in computational biology. One approach motivated by graph theory constructs a relationship graph based on pairwise evolutionary closeness. The approach builds a tree...
-
2003
Jiang, Tao, Lin, Guohui, Chen, Zhi-Zhong
Technical report TR03-06. Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the...
-
Heuristics Search Project Report: Evaluation of the search algorithims in Multiple Sequence Alignment
Download2006
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...
-
2003
Chen, Zhi-Zhong, Xu, Ying, Wen, Jianjun, Lin, Guohui, Jiang, Tao, Xu, Dong, Rizzi, Romeo
Technical report TR03-07. Protein NMR peak assignment refers to the process of assigning a group of \"spin systems\" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination....