Computing bond orders in molecule graphs

Theoretical Computer Science

Volumn 412, Issue 12-14, 2011, Pages 1184-1195

  Bcker, S ^a,b   Bui, Q B A ^a   Truss, A ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b Jena Centre for Bioinformatics   (Germany)

Author keywords

Bioinformatics; Bond order assignment; Fixed parameter tractability; FPT; MAX SNP hard; NP hard; Tree decomposition

Indexed keywords

BOND ORDER ASSIGNMENT; FIXED-PARAMETER TRACTABILITY; FPT; MAX SNP-HARD; NP-HARD; TREE DECOMPOSITION;

ALGORITHMS; BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; MOLECULES;

TREES (MATHEMATICS);

EID: 79751533664     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.12.063     Document Type: Article

References (17)

1. S. Arnborg, D.-G. Corneil, and A. Proskurowski Complexity of finding embedding in a k-tree SIAM J. Algebra. Discr. 8 1987 277 284
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy Proof verification and the hardness of approximation problems J. ACM 45 3 1998 501 555 (Pubitemid 128506634)
3. J.C. Baber, and E.E. Hodgkin Automatic assignment of chemical connectivity to organic molecules in the Cambridge Structural Database J. Chem. Inf. Model. 32 1992 401 406
4. P. Berman, M. Karpinski, and A.D. Scott Computational complexity of some restricted instances of 3-SAT Discrete Appl. Math. 255 2007 649 653 (Pubitemid 46209326)
5. Hans L. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theor. Comput. Sci. 209 1999 1 45
6. A.K. Dehof, A. Rurainski, H.-P. Lenhof, A. Hildebrandt, Automated bond order assignment as an optimization problem, in: Proc. of German Conference in Bioinformatics (GCB 2009), in: Lecture Notes in Informatics, 2009, pp. 201210.
7. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
8. M. Froeyen, and P. Herdewijn Correct bond order assignment in a molecular framework using integer linear programming with application to molecules where only non-hydrogen atom coordinates are available J. Chem. Inf. Model. 5 2005 1267 1274 (Pubitemid 41476010)
9. T.A. Halgren MMFF VI. MMFF94s option for energy minimization studies J. Comp. Chem. 17 56 1996 490 519
10. M. Hendlich, F. Rippmann, and G. Barnickel BALI: automatic assignment of bond and atom types for protein ligands in the brookhaven protein databank J. Chem. Inf. Model. 37 1997 774 778 (Pubitemid 127603592)
11. T. Kloks Treewidth, Computation and Approximation 1994 Springer
12. P. Labute On the perception of molecules from 3D atomic coordinates J. Chem. Inf. Model. 45 2 2005 215 221 (Pubitemid 40635324)
13. R. Niedermeier Invitation to Fixed-Parameter Algorithms 2006 Oxford University Press
14. C. Papadimitriou, and M. Yannakakis Optimization, approximation, and complexity classes J. Comput. Syst. Sci. 43 3 1991 425 440
15. N. Robertson, and P. Seymour Graph minors: algorithmic aspects of tree-width J. Algorithms 7 1986 309 322
16. E.W. Sayers, T. Barrett, D.-A. Benson, E. Bolton, S.-H. Bryant, K. Canese, V. Chetvernin, D.-M. Church, M. Dicuccio, S. Federhen, M. Feolo, L.-Y. Geer, W. Helmberg, Y. Kapustin, D. Landsman, D.-J. Lipman, Z. Lu, T.-L. Madden, T. Madej, D.-R. Maglott, A. Marchler-Bauer, V. Miller, I. Mizrachi, J. Ostell, A. Panchenko, K.-D. Pruitt, G.-D. Schuler, E. Sequeira, S.-T. Sherry, M. Shumway, K. Sirotkin, D. Slotta, A. Souvorov, G. Starchenko, T.-A. Tatusova, L. Wagner, Y. Wang, W.-J. Wilbur, E. Yaschenko, and J. Ye Database resources of the national center for biotechnology information Nucleic Acids Res. 38 Database issue 2010 D516
17. J. Wang, W. Wang, P.A. Kollmann, and D.A. Case Automatic atom type and bond type perception in molecular mechanical calculations J. Mol. Graph. Model. 25 2006 247 260 (Pubitemid 44363172)