
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai, "Efficient Parameterized Algorithms for Biopolymer StructureSequence Alignment," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 423432, OctoberDecember, 2006.  
BibTex  x  
@article{ 10.1109/TCBB.2006.52, author = {Yinglei Song and Chunmei Liu and Xiuzhen Huang and Russell L. Malmberg and Ying Xu and Liming Cai}, title = {Efficient Parameterized Algorithms for Biopolymer StructureSequence Alignment}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {3}, number = {4}, issn = {15455963}, year = {2006}, pages = {423432}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2006.52}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Efficient Parameterized Algorithms for Biopolymer StructureSequence Alignment IS  4 SN  15455963 SP423 EP432 EPD  423432 A1  Yinglei Song, A1  Chunmei Liu, A1  Xiuzhen Huang, A1  Russell L. Malmberg, A1  Ying Xu, A1  Liming Cai, PY  2006 KW  Structuresequence alignment KW  tree decomposition KW  parameterized algorithm KW  dynamic programming KW  RNA structure homology search KW  protein threading. VL  3 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] S. Arnborg and A. Proskurowski, “Linear Time Algorithms for NPHard Problems Restricted to Partial $k$ Trees,” Discrete Applied Math., vol. 23, pp. 1124, 1989.
[2] S. Arnborg, J. Lagergren, and D. Seese, “Easy Problems for TreeDecomposable Graphs,” J. Algorithms, vol. 12, pp. 308340, 1991.
[3] J. Bowie, R. Luthy, and D. Eisenberg, “A Method to Identify Protein Sequences that Fold into a Known ThreeDimensional Structure,” Science, vol. 253, pp. 164170, 1991.
[4] H.L. Bodlaender, “A Linear Time Algorithm for Finding TreeDecompositions of Small Treewidth,” SIAM J. Computing, vol. 25, pp. 13051317, 1996.
[5] S.H. Bryant and S.F. Altschul, “Statistics of SequenceStructure Threading,” Current Opinion Structural Biology, vol. 5, pp. 236244, 1995.
[6] M. Brown and C. Wilson, “RNA Pseudoknot Modeling Using Intersections of Stochastic Context Free Grammars with Applications to Database Search,” Proc. Pacific Symp. Biocomputing, pp.109125, 1995.
[7] L. Cai, R. Malmberg, and Y. Wu, “Stochastic Modeling of Pseudoknot Structures: A Grammatical Approach,” Bioinformatics, vol. 19, pp. i66i73, 2003.
[8] T. Dandekar, S. Schuster, B. Snel, M. Huynen, and P. Bork, “Pathway Alignment: Application to the Comparative Analysis of Glycolytic Enzymes,” Biochemical J., vol. 1, pp. 11524, 1999.
[9] A.T. Dandjinou, N. Lévesque, S. Larose, J. Lucier, S.A. Elela, and R.J. Wellinger, “A Phylogenetically Based Secondary Structure for the Yeast Telomerase RNA,” Current Biology, vol. 14, pp. 11481158, 2004.
[10] J.A. Doudna, “Structural Genomics of RNA,” Nature Structural Biology, vol. 7, no. 11 supp., pp. 954956, 2000.
[11] R. Downey and M. Fellows, Parameterized Complexity. Springer, 1999.
[12] R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge Univ. Press, 1998.
[13] S.R. Eddy, “Computational Genomics of NonCoding RNA Genes,” Cell, vol. 109, pp. 137140, 2002.
[14] S. Eddy and R. Durbin, “RNA Sequence Analysis Using Covariance Models,” Nucleic Acids Research, vol. 22, pp. 20792088, 1994.
[15] D. Eppstein, “Subgraph Isomorphism in Planar Graphs and Related Problems,” J. Graph Algorithms and Applications, vol. 3.3, pp. 127, 1999.
[16] S.J. Geobel, B. Hsue, T.F. Dombrowski, and P.S. Masters, “Characterization of the RNA Components of a Putative Molecular Switch in the 3' Untranslated Region of the Murine Coronavirus Genome,” J. Virology, vol. 78, pp. 669682, 2004.
[17] S. GriffithsJones, A. Bateman, M. Marshall, A. Khanna, and S.R. Eddy, “Rfam: An RNA Family Database,” Nucleic Acids Research, vol. 31, pp. 439441, 2003.
[18] R.J. Klein and S.R. Eddy, “RSEARCH: Finding Homologs of Single Structured RNA Sequences,” BMC Bioinformatics, vol. 4, p. 44, 2003.
[19] R.H. Lathrop, “The Protein Threading Problem with Sequence Amino Acid Interaction Preferences Is NPComplete,” Protein Eng., vol. 7, pp. 10691068, 1994.
[20] R.H. Lathrop, R.G. Rogers Jr, J. Bienkowska, B.K.M. Bryant, L.J. Buturovic, C. Gaitatzes, R. Nambudripad, J.V. White, and T.F. Smith, “Analysis and Algorithms for Protein SequenceStructure Alignment,” Computational Methods in Molecular Biology, S.L.Salzberg, D.B. Searls, and S. Kasif, eds., Elsevier, 1998.
[21] A. LeaverFay, B. Kuhlman, and J. Snoeyink, “An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem,” Proc. Pacific Symp. Biocomputing 10, pp. 1627, 2005.
[22] H.P. Lenhof, K. Reinert, and M. Vingron, “A Polyhedral Approach to RNA Sequence Structure Alignment,” J. Computational Biology, vol. 5, no. 3, pp. 517530, 1998.
[23] C. Liu, Y. Song, R. Malmberg, and L. Cai, “Profiling and Searching for RNA Pseudoknot Structures in Genomes,” Lecture Notes in Computer Science, vol. 3515, pp. 968975, 2005.
[24] T.M. Lowe and S.R. Eddy, “tRNAscanSE: A Program for Improved Detection of Transfer RNA Genes in Genomic Sequence,” Nucleic Acids Research, vol. 25, pp. 955964, 1997.
[25] S.B. Lyngso and C.N. Pedersen, “RNA Pseudoknot Prediction in EnergyBased Models,” J. Computational Biololgy, vol. 7, no. 3, pp.409427, 2000.
[26] J. Matousek and R. Thomas, “On the Complexity of Finding Iso and Other Morphisms for Partial $k$ Trees,” Discrete Math., vol. 108, pp. 343364, 1992.
[27] E.M. Marcotte, P. Matteo, H.L. Ng, D.W. Rice, T.O. Yeates, and D. Eisenberg, “Detecting Protein Function and ProteinProtein Interactions from Genome Sequences,” Science, vol. 285, pp. 751753, 1999.
[28] N. Nameki, B. Felden, J.F. Atkins, R.F. Gesteland, H. Himeno, and A. Muto, “Functional and Structural Analysis of a Pseudoknot Upstream of the TagEncoded Sequence in E. coli tmRNA,” J.Molecular Biology, vol. 286, no. 3, pp. 733744, 1999.
[29] D.D. Pervouchine, “IRIS: Intermolecular RNA Interaction Search,” Genome Informatics, vol. 15, no. 2, pp. 92101, 2004.
[30] K. Reinert, H.P. Lenhof, P. Mutzel, K. Mehlhorn, and J.D. Kececioglu, “A BranchandCut Algorithm for Multiple Sequence Alignment,” Proc. First Ann. Int'l Conf. Computational Molecular Biology, pp. 241250, 1997.
[31] E. Rivas and S.R. Eddy, “Noncoding RNA Gene Detection Using Comparative Sequence Analysis,” BMC Bioinformatics, vol. 2, p. 8, 2001.
[32] N. Robertson and P.D. Seymour, “Graph Minors II. Algorithmic Aspects of TreeWidth,” J. Algorithms, vol. 7, pp. 309322, 1986.
[33] Y. Song, K. Ellrott, C. Liu, J. Guo, Y. Xu, and L. Cai, “Efficient Protein Threading with Tree Decomposition,” manuscript, 2006.
[34] Y. Song, C. Liu, R. Malmberg, F. Pan, and L. Cai, “Tree Decomposition Based Fast Search of RNA Secondary Structures in Genomes,” Proc. 2005 IEEE Computational Systems Bioinformatics Conf., pp. 223234, 2005.
[35] Y. Uemura, A. Hasegawa, Y. Kobayashi, and T. Yokomori, “Tree Adjoining Grammars for RNA Structure Prediction,” Theoretical Computer Science, vol. 210, pp. 277303, 1999.
[36] G. Wang and R.L. Dunbrack Jr., “PISCES: A Protein Sequence Culling Server,” Bioinformatics, vol. 19, pp. 15891591, 2003.
[37] D. Xu, M.A. Unseren, Y. Xu, and E.C. Uberbacher, “SequenceStructure Specificity of a Knowledge Based Energy Function at the Secondary Structure Level,” Bioinformatics, vol. 16, pp. 257268, 2000.
[38] J. Xu, “Rapid SideChain Packing via Tree Decomposition,” Proc. 2005 Int'l Conf. Research in Computational Biology, pp. 423439, 2005.
[39] J. Xu, F. Jiao, and B. Berger, “A TreeDecomposition Approach to Protein Structure Prediction,” Proc. 2005 IEEE Computational Systems Bioinformatics Conf., pp. 247256, 2005.
[40] J. Xu, M. Li, D. Kim, and Y. Xu, “RAPTOR: Optimal Protein Threading by Linear Programming,” J. Bioinformatics and Computational Biology, vol. 1, no. 1, pp. 95113, 2003.
[41] Y. Xu, Z. Liu, L. Cai, and D. Xu, “Protein Structure Prediction by Protein Threading,” Computational Methods for Protein Structure Prediction and Modeling, Y. Xu, D. Xu and J. Liang, eds., Springer, 2006.
[42] Y. Xu, D. Xu, and E.C. Uberbacher, “An Efficient Computational Method for Globally Optimal Threading,” J. Computational Biology, vol. 5, no. 3, pp. 597614, 1998.