Abstract
Multiple loci analysis has become popular with the advanced development in biological experiments. A lot of studies have been focused on the biological and the statistical properties of such multiple loci analysis. In this paper, we study one of the important computational problems: solving the probabilities of haplotype classes from a large linear system Ax = b derived from the recombination events in multiple loci analysis. Since the size of the recombination matrix A increases exponentially with respect to the number of loci, fast solvers are required to deal with a large number of loci in the analysis. By exploiting the nice structure of the matrix A, we develop an efficient recursive algorithm for solving such structured linear systems. In particular, the complexity of the proposed algorithm is of O(mlogm) operations and the memory requirement is of O(m) locations where m is the size of the matrix A. Numerical examples are given to demonstrate the effectiveness of our efficient solver.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 4th Asia-Pacific Bioinformatics Conference, APBC 2006 |
| Publisher | Imperial College Press |
| Pages | 129-138 |
| Number of pages | 10 |
| ISBN (Print) | 1860946232, 9781860946233 |
| Publication status | Published - 2006 |
| Event | 4th Asia-Pacific Bioinformatics Conference, APBC 2006 - Taipei, Taiwan, Province of China Duration: 13 Feb 2006 → 16 Feb 2006 https://www.comp.nus.edu.sg/~wongls/psZ/apbc2006/ |
Publication series
| Name | Series on Advances in Bioinformatics and Computational Biology |
|---|---|
| Volume | 3 |
| ISSN (Print) | 1751-6404 |
Conference
| Conference | 4th Asia-Pacific Bioinformatics Conference, APBC 2006 |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taipei |
| Period | 13/02/06 → 16/02/06 |
| Internet address |