Maximum common subgraph: Some upper bound and lower bound results

BMC Bioinformatics

Volumn 7, Issue SUPPL.4, 2006, Pages

  Huang, Xiuzhen ^a   Lai, Jing ^b   Jennings, Steven F ^b  

^a ARKANSAS STATE UNIVERSITY   (United States)

^b University of Arkansas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL STRUCTURES; EXACT ALGORITHMS; GRAPHICAL REPRESENTATIONS; INDUCED SUBGRAPHS; MAXIMUM COMMON SUBGRAPH; PARAMETERIZED COMPUTATION; REAL APPLICATIONS; STRUCTURE MATCHING;

PRODUCT DESIGN;

BIOINFORMATICS;

ALGORITHM; ARTICLE; BIOINFORMATICS; CALCULATION; CONTROLLED STUDY; GENETIC ANALYSIS; PLOTS AND CURVES; PROCESS DESIGN; PROCESS DEVELOPMENT; PROTEIN ANALYSIS; RESEARCH; STRUCTURE ANALYSIS; CHEMICAL MODEL; CHEMICAL STRUCTURE; CHEMISTRY; COMPUTER SIMULATION; PROCEDURES; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

BIOPOLYMER;

ALGORITHMS; BIOPOLYMERS; COMPUTER SIMULATION; MODELS, CHEMICAL; MODELS, MOLECULAR; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

EID: 33947414055     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-7-S4-S6     Document Type: Article

References (40)

1. Raymond JW, Willett P: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-aided Molecular Design 2002, 16:521-533.
2. Horaud R, Skordas T: Stereo correspondence through feature grouping and maximal cliques. IEEE Trans Pattern Anal Mach Intell 1989, 11(11):1168-1180.
3. Shearer K, Bunke H, Venkatesh S: Video indexing and similarity retrieval by largest common subgraph detection using decision trees. No. IDIAP-RR 00-15, Dalle Molle Institute for Perceptual Artificial Intelligence, Martigny, Valais, Switzerland 2000.
4. Bowie J, Luthy R, Eisenberg D: A method to identify protein sequences that fold into a known three-dimensional structure. Science 1991, 253:164-170.
5. Bryant SH, Altschul SF: Statistics of sequence-structure threading. Curr Opin Struct Biol 1995, 5:236-244.
6. Xu Y, Xu D, Uberbacher EC: An efficient computational method for globally optimal threading. Journal of Computational Biology 1998, 5(3):597-614.
7. Lathrop RH, Rogers RG Jr, Bienkowska J, Bryant BMK, Buturovic LJ, Gaitatzes C, Nambudripad R, White JV, Smith TF: Analysis and algorithms for protein sequencestructure alignment. In Computational Methods in Molecular Biology, Salzberg, Searls Edited by: Kasif. Elsevier; 1998.
8. XuOJ, Li M, Kim D, Xu Y: RAPTOR: optimal protein threading by linear programming. J Bioinform Comput Biol 2003, 1(1):95-117.
9. Doudna JA: Structural genomics of RNA. Nature Structural Biology 2000, 7(11 supp):954-956.
10. Eddy SR: Computational genomics of non-coding RNA genes. Cell 2002, 109:137-140.
11. Rivas E, Eddy SR: Noncoding RNA gene detection using comparative sequence analysis. BMC Bioinformatics 2001, 2:8.
12. Lowe TM, Eddy SR: TRNAscan-SE: A Program for improved detection of transfer RNA genes in genomic sequence. Nucleic Acids Research 1997, 25:955-964.
13. Song Y, Liu C, Huang X, Malmberg R, Xu Y, Cai L: Efficient parameterized algorithm for biopolymer structure-sequence alignment. Proceedings of 5th Workshop on Algorithms in BioInformatics (WABI 2005), Lecture Notes in Bioinformatics 2005, 3692:376-388.
14. Gary MR, Johnson DS, Computers and Intractability: A Guide to the Theory of NP-Completeness WH. Freeman and Co; 1979.
15. Kann V: On the approximability of the maximum common subgraph problem. In Proc 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 577 Springer-Verlag; 1992:377-388.
16. Cheetham J, Dehne F, Rau-Chaplin A, Stege U, Taillon PJ: Solving large FPT problems on coarse-grained parallel machines. JCSS 2003, 67:691.
17. Downey R, Fellows M: Parameterized Complexity Springer; 1999.
18. Lanctot JK, Li M, Ma B, Wang S, Zhang L: Distinguishing string selection problems. Inf Comput 2003, 185:41.
19. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M: Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties New York: Springer-Verlag; 1999.
20. Deng X, Li G, Li Z, Ma B, Wang L: A PTAS for distinguishing (sub)string selection. LNCS 2002, 2380:740.
21. Deng X, Li G, Li Z, Ma B, Wang L: Genetic design of drugs without side-effects. SIAM Journal on Computing 2003, 32:1073.
22. Jiang T, Li M: On the Approximation of shortest common Supersequences and longest Common subsequences. SIAM J Comput 1995, 24:1122.
23. Li M, Ma B, Wang L: On the closest string and substring problems. Journal of the ACM 2002, 49:157.
24. Chen J, Fanj I, Jia W: Vertex cover: further observations and further improvements. Journal of Algorithms 2001, 41:280-301.
25. Papadimitriou C, Yannakakis M: On the complexity of database queries. JCSS 1999, 58:.
26. Bodlaender HL, Downey RG, Fellows MR, Hallett MT, Wareham HT: Parameterized complexity analysis in computational biology. Comput Appl Biosci 1995, 11:49-57.
27. Bodlaender H, Downey R, Fellows M, Wareham M: The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 1995, 147:31.
28. Fellows M, Gramm J, Niedermeier R: Parameterized intractability of motif search problems. LNCS 2002, 2285:262.
29. Hallett M: An Integrated Complexity Analysis of Problems for Computational Biology Ph.D. Thesis, University of Victoria; 1996.
30. Papadimitriou C, Yannakakis M: On limited nondeterminism and the complexity of VC dimension. JCSS 1996, 53:161.
31. Pietrzak K: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. JCSS 2003, 67:757.
32. Chen J, Chor B, Fellows M, Huang X, Juedes D, Kanj I, Xia G: Tight lower bounds for parameterized NP-hard problems. Proc of the 19th Annual IEEE Conference on Computational Complexity 2004:150-160.
33. Chen J, Huang X, Kanj I, Xia G: Linear FPT reductions and computational lower bounds. Proc of the 36th ACM Symposium on Theory of Computing 2004:212-221.
34. Huang X: Parameterized Complexity and Polynomial-time Approximation Schemes Ph.D. Dissertation, Texas A&M University; 2004.
35. Cai L, Chen J: On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. J Comput Syst Sci 1997, 54:465-474.
36. Chen J, Huang X, Kanj I, Xia G: W-hardness linear FPT-reductions: structural properties and further applications. Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON 2005), Lecture Notes in Computer Science 2005, 3595:975-984.
37. Downey R, Estivill-Castro V, Fellows M, Prieto E, Rosamond F: Cutting up is hard to do: The parameterized complexity of k-Cut and related Problems. Electr Notes Theor Comput Sci 2003, 78:.
38. Sze S-H, Lu S, Chen J: Integrating sample-driven and patterndriven approaches in motif finding. WABI2004 2004:438-449.
39. Sze S-H: Lectures notes of Special Topics in Computational Biology, Fall 2002.
40. Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms 2nd edition. MIT Press; 2001.