HMM sampling and applications to gene finding and alternative splicing

Bioinformatics

Volumn 19, Issue SUPPL. 2, 2003, Pages

  Cawley, Simon L ^a   Pachter, Lior ^b  

^a CIS Enterprise Data Group   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Conserved alternative splicing; Hidden Markov model; Sampling; Suboptimal parses

Indexed keywords

ALGORITHM; ALTERNATIVE RNA SPLICING; CODON; CONFERENCE PAPER; DNA SEQUENCE; EXON; GENE STRUCTURE; HUMAN; MATHEMATICAL ANALYSIS; NONHUMAN; PRIORITY JOURNAL; PROBABILITY; SEQUENCE ALIGNMENT;

EID: 2942610553     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btg1057     Document Type: Conference Paper

References (34)

1. Alexandersson, M., Cawley, S. and Pachter, L. (2003) SLAM - Cross-species genefinding and alignment wihth a generalized pair hidden Markov model. Genome Res., 13, 496-502.
2. Bellman, R. and Kalaba, R. (1960) On Kth best policies. J. SIAM, 8(4), 582-588.
3. Clarke, S., Krikorian, A. and Rausen, J. (1963) Computing the N best loopless paths in a network. J. SIAM., 11(4), 1096-1102.
4. Durbin, R., Eddy, S., Krogh, A. and Mitchison, G. (1998) Biological Sequence Analysis. Cambridge UP.
5. Eddy, S. R. (1995) Multiple alignment using hidden Markov models. In ISMB-95. 3, pp. 114-120.
6. Fox, B. (1973) Calculating the Kth shortest paths. Can. J. Oper. Res. Inf. Process., 11, 66-70.
7. Gusfield, D., Balasubramanian, K. and Naor, D. (1992) Parametric optimization of sequence alignment. In Proceedings of the third annual ACM-SIAM Joint Symposium Discrete Algorithms. Orlando Florida.
8. Hirschberg, D. S. (1975) A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18(6), 341-343.
9. Hoffman, W. and Pavley, R. (1959) A method for the solution of the Nth best path problem. J. ACM, 6, 506-514.
10. Horn, R.A. and Johnson, C.R. (1985) Matrix Analysis. Cambridge Universtiy Press, Cambridge.
11. Kan, Z., Rouchka, E.C., Gis, W.R. and States, D.J. (2001) Gene structure prediction and alternative splicing analysis using genomically aligned ESTs. Genome Res., 11, 889-900.
12. Lawler, E. L. (1972) A Procedure for computing the K-best solutions to discrete optimization problems and its appplications to the shortest paths problem. Manage. Sci., 18, 401-405.
13. Modrek, B. and Lee, C. (2002) A genomic view of alternative splicing. Nat. Genet, 30, 13-19.
14. Naor, D. and Brutlag, D.L. (1993) On suboptimal alignments of biological sequences. In Fourth International Symposium on Combinatorial Pattern Matching. Springer-Verlag, Padova, Italy, pp. 179-196.
15. Naor, D. and Brutlag, D.L. (1994) On near-optimal alignments of biological sequences. J. Comput. Biol., 1(4), 349-366.
16. Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
17. Okazaki, Y. et al. (2002) Analysis of the mouse transcriptome based on functional annotation of 60770 full-length cDNAs. Nature, 420, 563-573.
18. Pachter, L., Alexandersson, M. and Cawley, S. (2001) In RECOMB 2001: Proceedings of the Fifth International Conference on Computational Molecular Biology.
19. Perko, A. (1986) Implementation of algorithms for K shortest loopless paths. Networks, 16, 149-160.
20. Pollack, M. (1961) The kth best route through a network. Oper. Res., 9(4), 578-580.
21. Reese, M.G., Kulp, D., Tammana, H. and Haussler, D. (2000) Genie-gene finding in Drosophila melanogaster. Genome Res., 10(4), 529-538.
22. Saqi, M.A.S. and Sternberg, M. (1991) A simple method to generate non-trivial alternate alignments of protein sequences. J. Mol. Biol., 219, 727-732.
23. Saqi, M.A.S., Bates, P. and Sternberg, M.J.E. (1992) Towards an automatic method of predicting protein structure by homology: an evaluation of suboptimal sequence alignments. Protein Eng., 5(4), 305-311.
24. Shier, D.R. (1979) On algorithms for finding the K shortest paths in a network. Networks, 9, 195-214.
25. Thiele, R., Zimmer, R. and Lengauer, T. (1995) Recursive dynamic programming for adaptive sequence and structure alignment. In ISMB-95. 3, pp. 384-392.
26. Vingron, M. and Argos, P. (1990) Determination of reliable regions in protein sequence alignments. Protein Eng., 3, 565-569.
27. Waterman, M.S. (1983) Sequence alignments in the neighborhood of the optimum with general application to dynamic programming. Proc. Natl Acad. Sci. USA, 80, 3123-3124.
28. Waterman, M.S. and Eggert, M. (1987) A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons. J. Mol. Biol., 197, 723-728.
29. Waterman, M.S. and Byers, T.H. (1985) A dynamic programming algorithm to find all solutions in a neighborhood of the optimum. Math. Biosci., 77, 179-188.
30. Waterman, M.S., Eggert, M. and Lander, E. (1992) Parametric sequence comparisons. Proc. Natl Acad. Sci. USA, 89(13), 6090-6093.
31. Waterman, M.S. (1994) Parametric and ensemble sequence alignment algorithms. Bull. Math. Biol., 56(4), 743-767.
32. Waterston, R.H. et al. (2002) Initial sequencing and comparative analysis of the mouse genome. Nature, 420, 520-562.
33. Zhu, J., Liu, J.S. and Lawrence, C.E. (1998) Bayesian adaptive sequence alignment algorithms. Bioinformatics, 14, 25-39.
34. Zuker, M. (1991) Suboptimal sequence alignment in molecular biology: alignment with error analysis. J. Mol. Biol., 221, 403-420.