Abstract
It has been demonstrated that the use of additional information such as ESTs and protein homology can significantly improve accuracy of gene prediction. However, many sources of external information are still being omitted from consideration. Here, we investigate the use of product lengths from RT-PCR experiments in gene finding. We present hardness results and practical algorithms for several variants of the problem and apply our methods to a real RT-PCR data set in the Drosophila genome. We conclude that the use of RT-PCR data can improve the sensitivity of gene prediction and locate novel splicing variants.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Stormo, G.D.: Using mRNAs lengths to accurately predict the alternatively spliced gene products in Caenorhabditis elegans. Bioinformatics 22(10), 1239–1244 (2006)
Biedl, T., Brejova, B., Demaine, E., Hamel, A., Lopez-Ortiz, A., Vinar, T.: Finding hidden independent sets in interval graphs. Theoretical Computer Science 310(1-3), 287–307 (2004)
Brent, M., Langton, L., Comstock, C.L., van Baren, J.: Exhaustive RT-PCR and sequencing of all novel NSCAN predictions in Drosophila melanogaster. Personal communication (2007)
Burge, C., Karlin, S.: Prediction of complete gene structures in human genomic DNA. Journal of Molecular Biology 268(1), 78–94 (1997)
Chen, T., Kao, M.Y., Tepel, M., Rush, J., Church, G.M.: A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. Journal of Computational Biology 8(3), 325–327 (2001)
Gabow, H.N., Maheswari, S.N., Osterweil, L.J.: On two problems in the generation of program test paths. IEEE Trans. Soft. Eng. 2(3), 227–231 (1976)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Gross, S.S., Do, C.B., Sirota, M., Batzoglou, S.: CONTRAST: a discriminative, phylogeny-free approach to multiple informant de novo gene prediction. Genome Biology 8(12), R269 (2007)
Guigo, R., et al.: EGASP: the human ENCODE genome annotation assessment project. Genome Biology 7(suppl. 1), S2 (2006)
Heber, S., Alekseyev, M., Sze, S.H., Tang, H., Pevzner, P.A.: Splicing graphs and EST assembly problem. Bioinformatics 18(suppl. 1), S181–S188 (2002)
Kolman, P., Pankrác, O.: On the complexity of paths avoiding forbidden pairs. Discrete Applied Mathematics 157(13), 2871–2876 (2009)
Krause, K.W., Smith, R.W., Goodwin, M.A.: Optional software test planning through automated network analysis. In: Proceedings 1973 IEEE Symposium on Computer Software Reliability, pp. 18–22 (1973)
Siepel, A., Diekhans, M., Brejova, B., Langton, L., Stevens, M., Comstock, C.L., Davis, C., Ewing, B., Oommen, S., Lau, C., Yu, H.C., Li, J., Roe, B.A., Green, P., Gerhard, D.S., Temple, G., Haussler, D., Brent, M.R.: Targeted discovery of novel human exons by comparative genomics. Genome Research 17(12), 1763–1763 (2007)
Srimani, P.K., Sinha, B.P.: Impossible pair constrained test path generation in a program. Information Sciences 28(2), 87–103 (1982)
Stanke, M., Diekhans, M., Baertsch, R., Haussler, D.: Using native and syntenically mapped cDNA alignments to improve de novo gene finding. Bioinformatics 24(5), 637–644 (2008)
Stanke, M., Keller, O., Gunduz, I., Hayes, A., Waack, S., Morgenstern, B.: AUGUSTUS: ab initio prediction of alternative transcripts. Nucleic Acids Research 34(Web Server issue), W435–W439 (2006)
Wei, C., Brent, M.R.: Using ESTs to improve the accuracy of de novo gene prediction. BMC Bioinformatics 7, 327 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kováč, J., Vinař, T., Brejová, B. (2009). Predicting Gene Structures from Multiple RT-PCR Tests. In: Salzberg, S.L., Warnow, T. (eds) Algorithms in Bioinformatics. WABI 2009. Lecture Notes in Computer Science(), vol 5724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04241-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-04241-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04240-9
Online ISBN: 978-3-642-04241-6
eBook Packages: Computer ScienceComputer Science (R0)