Parallel depth first search. Part I. implementation
International Journal of Parallel Programming
Parallel depth first search. Part II. analysis
International Journal of Parallel Programming
A new approach to fragment assembly in DNA sequencing
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
MPI: The Complete Reference
Genome-Wide Alternative Splicing Events Detection through Analysis of Large Scale ESTs
BIBE '04 Proceedings of the 4th IEEE Symposium on Bioinformatics and Bioengineering
Hi-index | 0.00 |
Alternative splicing is an important mechanism for generating protein diversity from a single gene. However, standard molecular biology techniques have only identified several hundred alternative splicing variants and created a bottleneck in terms of experimental validation. In this paper, we propose models of weighted alternative splicing graphs and ways of generating all alternative splicing forms from an alternative splicing graph. By formulating linear programming models, we can deduce the quantitative distributions of various alternative splicing forms. Linear time algorithms that produce all alternative splicing variants with their corresponding probabilities are proposed. Finally, by aligning sequences of EST databases to the genomic data, locations of exons as well as the alternative splicing sites can be identified, and several sets of putative alternative splicing forms is inferred using these methods.