Cited By
View all- Besser BPoloczek M(2017)Greedy MatchingAlgorithmica10.1007/s00453-015-0062-277:1(201-234)Online publication date: 1-Jan-2017
Graph algorithms for biological systems analysis
Pages 142 - 151
Abstract
The post-genomic era has witnessed an explosion in the quality, quantity and variety of biological data---sequence, structure, and networks. However, when building computational models on these data, some abstractions recur often. In particular, graph-based computational models are a powerful, flexible and efficient way of modeling many biological systems. Graph models are used in systems biology where the goal is to understand relationships among biological entities, and in structural bioinformatics where a graph is used to represent the amino acid (or atom) interaction relationships in a protein or the secondary structure base-pairing relationships in RNA. For many of these problems, we can develop algorithms that explore the fact that certain key parameters have complexity dependent on the treewidth of the system, which is typically very small for a variety of biological systems. When treewidth is large, we can still use spectral methods to find biologically sound solutions in an efficient manner.
References
[1]
T. Akutsu. NP-hardness results for protein side-chain packing. In S. Miyano and T. Takagi, editors, Genome Informatics 8, pages 180--186. 1997.
[2]
T. Akutsu and S. Miyano. On the approximation of protein threading. Theoretical Computer Science, 210:261--275, 1999.
[3]
N. Alexandrov. SARFing the PDB. Protein Engineering, 9:727--732, 1996.
[4]
S. Balev. Solving the protein threading problem by lagrangian relaxation. In WABI, pages 182--193, 2004.
[5]
S. Bandyopadhyay, R. Sharan, and T. Ideker. Systematic identification of functional orthologs based on protein network comparison. Genome Research, 16(3):428--35, 2006.
[6]
S. Bandyopadhyay, R. Sharan, and T. Ideker. Systematic identification of functional orthologs based on protein network comparison. Genome Research, 16(3):428--435, 2006.
[7]
F. C. Bernstein, T. F. Koetzle, G. J. Williams, E. F. Meyer, M. D. Brice, J. R. Rodgers, O. Kennard, T. Shimanouchi, and M. Tasumi. The protein data bank: a computer-based archival file for macromolecular structures. Journal of Molecular Biology, 112(3):535--542, May 1977.
[8]
S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1--7):107--117, 1998.
[9]
S. Bryant and C. Lawrence. An empirical energy function for threading protein sequence through folding motif. Proteins: Structure, Function and Genetics, 16:92--112, 1993.
[10]
A. Canutescu, A. Shelenkov, and R. Dunbrack. A graph-theory algorithm for rapid protein side-chain prediction. Protein Science, 12:2001--2014, 2003.
[11]
F. Chung, L. Lu, and V. Vu. Spectra of random graphs with given expected degrees. Proceedings of National Academy of Sciences (PNAS), 100(11):6313--6318, May 2003.
[12]
B. Dost, T. Shlomi, N. Gupta, E. Ruppin, V. Bafna, and R. Sharan. Qnet: A tool for querying protein interaction networks. In Proceedings of the Eleventh Annual International Conference On Research in Computational Molecular Biology (RECOMB), pages 1--15, 2007.
[13]
M. A. Erdmann and G. S. Rule. Rapid protein structure detection and assignment using residual dipolar coupling. Technical report, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, December 2002.
[14]
J. Flannick, A. Novak, B. S. Srinivasan, H. H. McAdams, and S. Batzoglou. Graemlin: general and robust alignment of multiple large interaction networks. Genome Research, 16(9):1169--81, 2006.
[15]
B. Fu and Z. Chen. Sublinear time width-bounded separators and their application to the protein side-chain packing problem. In The Second International Conference on Algorithmic Aspects in Information and Management (AAIM06), pages 149--160, Hong Kong, China, June 2006.
[16]
I. Gat-Viks, A. Tanay, D. Raijman, and R. Shamir. A probabilistic methodology for integrating knowledge and experiments on biological networks. Journal of Computational Biology, 13(2):165--181, 2006.
[17]
A. Godzik. The structural alignment between two proteins: is there a unique answer? Protein Science, 5(7):1325--1338, July 1996.
[18]
A. Godzik, A. Kolinski, and J. Skolnick. A topology fingerprint approach to inverse protein folding problem. Journal of Molecular Biology, 227:227--238, 1992.
[19]
D. Goldman, S. Istrail, and C. Papadimitriou. Algorithmic aspects of protein structure similarity. In Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS'99), pages 512--522, 1999.
[20]
G. Golub and C. Van Loan. Matrix computations. Johns Hopkins University Press, 2006.
[21]
L. Holm and C. Sander. Protein structure comparison by alignment of distance matrices. Journal of Molecular Biology, 233:123--138, 1993.
[22]
T. Ito, T. Chiba, R. Ozawa, M. Yoshida, M. Hattori, and Y. Sakaki. A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proceedings of National Academy of Sciences, 98(8):4569--4574, 2001.
[23]
N. Krogan and et al. Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature, 440(7084):637--43, 2006.
[24]
G. Lancia, R. Carr, B. Walenz, and S. Istrail. 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. In Proceedings of the Fifth Annual International Conference On Research in Computational Molecular Biology (RECOMB), pages 193--202. ACM Press, 2001.
[25]
R. Lathrop. The protein threading problem with sequence amino acid interaction preferences is NP-complete. Protein Engineering, 7:1059--1068, 1994.
[26]
R. Lathrop and T. Smith. Global optimum protein threading with gapped alignment and empirical pair score functions. Journal of Molecular Biology, 255:641--665, 1996.
[27]
C. Liu, Y. Song, B. Yan, Y. Xu, and L. Cai. Fast de novo peptide sequencing and spectral alignment via tree decomposition. In Proceedings of Pacific Symposium on Biocomputing (PSB), pages 255--266, 2006.
[28]
T. Madej, J. Gibrat, and S. Bryant. Threading a database of protein cores. Proteins: Structure, Function and Genetics, 23:356, 1995.
[29]
J. Meiler, W. Peti, and C. Griesinger. Dipocoup: A versatile program for 3D-structure homology comparison based on residual dipolar couplings and pseudocontact shifts. Journal of Biomolecular NMR, 17(4):283--294, August 2000.
[30]
G. L. Miller, S. Teng, W. Thurston, and S. A. Vavasis. Separators for sphere-packings and nearest neighbor graphs. Journal of ACM, 44(1):1--29, 1997.
[31]
J. P. Miller, R. S. Lo, A. Ben-Hur, C. Desmarais, I. Stagljar, W. S. Noble, and S. Fields. Large-scale identification of yeast integral membrane protein interactions. Proceedings of the National Academy of Sciences, 102(34):12123--12128, 2005.
[32]
C. Papadimitriou and K. Steiglitz. Combinatorial optimization: algorithms and complexity. Dover, 1998.
[33]
N. Pierce and E. Winfree. Protein design is NP-hard. Protein Engineering, 15(10):779--782, 2002.
[34]
Y. Qi, J. Klein-Seetharaman, and Z. Bar-Joseph. Random forest similarity for protein-protein interaction prediction from multiple sources. In Proceedings of Pacific Symposium on Biocomputing (PSB), volume 10, pages 531--542, 2005.
[35]
Y. Qu, J. Guo, V. Olman, and Y. Xu. Protein structure prediction using sparse dipolar coupling data. Nucleic Acids Research, 32(2):551--561, 2004.
[36]
N. Robertson and P. Seymour. Graph minors. II. algorithmic aspects of tree-width. Journal of Algorithms, 7:309--322, 1986.
[37]
R. Singh, J. Xu, and B. Berger. Struct2Net: Integrating structure into protein-protein interaction prediction. Proceedings of Pacific Symposium on Biocomputing (PSB), 11:403--414, 2006.
[38]
R. Singh, J. Xu, and B. Berger. Pairwise global alignment of protein interaction networks by matching neighborhood topology. In Proceedings of the Eleventh Annual International Conference On Research in Computational Molecular Biology (RECOMB), pages 16--31, 2007.
[39]
R. Singh, J. Xu, and B. Berger. Global alignment of multiple protein interaction networks. In Proceedings of Pacific Symposium on Biocomputing (PSB), Jan 2008.
[40]
Y. Song, C. Liu, R. L. Malmberg, F. Pan, and L. Cai. Tree decomposition based fast search of rna structures including pseudoknots in genomes. In Proceedings of Computational Systems Bioinformatics (CSB), pages 223--234, 2005.
[41]
D. Sontag, R. Singh, and B. Berger. Probabilistic modeling of systematic errors in two-hybrid experiments. In Proceedings of Pacific Symposium on Biocomputing (PSB), pages 445--457, 2007.
[42]
B. Srinivasan, A. Novak, J. Flannick, S. Batzoglou, and H. McAdams. Integrated protein interaction networks for 11 microbes. Proceedings of the 10th International Conference on Research in Computational Molecular Biology (RECOMB), pages 1--14, 2006.
[43]
P. Uetz, L. Giot, G. Cagney, T. A. Mansfield, R. S. Judson, J. R. Knight, D. Lockshon, V. Narayan, M. Srinivasan, P. Pochart, A. Qureshi-Emili, Y. Li, B. Godwin, D. Conover, T. Kalbfleisch, G. Vijayadamodar, M. Yang, M. Johnston, S. Fields, and J. M. Rothberg. A comprehensive analysis of protein-protein interactions in saccharomyces cerevisiae. Nature, 403(6770):623--7, 2000.
[44]
C. von Mering, R. Krause, B. Snel, M. Cornell, S. G. Oliver, S. Fields, and P. Bork. Comparative assessment of large-scale data sets of protein-protein interactions. Nature, 417(6887):399--403, 2002.
[45]
J. Xu. Rapid side-chain packing via tree decomposition. In Proceedings of the Ninth Annual International Conference On Research in Computational Molecular Biology (RECOMB), volume 3500 of Lecture Notes in Bioinformatics, pages 423--439. Springer, May 2005.
[46]
J. Xu. Solving the contact map overlap problem via tree decomposition and a dee-like pruning strategy. In Proceedings of the 46th IEEE Conference on Decision and Control (CDC), New Orleans, December 2007.
[47]
J. Xu and B. Berger. Fast and accurate algorithms for protein side-chain packing. Journal of the ACM, 53:533--557, July 2006.
[48]
J. Xu, F. Jiao, and B. Berger. A tree-decomposition approach to protein structure prediction. In Proceedings of Computational Systems Bioinformatics (CSB), pages 247--256, 2005.
[49]
J. Xu, F. Jiao, and B. Berger. A parameterized algorithm for protein structure alignment. In Proceedings of the Tenth Annual Internaional Conference On Research in Computational Molecular Biology (RECOMB), pages 488--499. Springer, April 2006.
[50]
J. Xu, M. Li, D. Kim, and Y. Xu. RAPTOR: Optimal protein threading by linear programming. Journal of Bioinformatics and Computational Biology, 1(1):95--117, April 2003.
[51]
Y. Xu. A computational method for NMR-constrained protein threading. Journal of Computational Biology, 7(3-4):449--467, 2000.
[52]
Y. Xu, D. Xu, and E. Uberbacher. An efficient computational method for globally optimal threadings. Journal of Computational Biology, 5(3):597--614, 1998.
[53]
C. Yeang and M. Vingron. A joint model of regulatory and metabolic networks. BMC bioinformatics, 7:332, 2006.
[54]
X. Yuan and C. Bystroff. Non-sequential structure-based alignments reveal topology-independent core packing arrangements in proteins. Bioinformatics, 27:1010--1019, 2005.
[55]
J. Zhao, R. L. Malmberg, and L. Cai. Rapid ab initio RNA folding including pseudoknots via graph tree decomposition. In Proceedings of Workshop on Algorithm in Bioinformatics (WABI), pages 262--273, 2006.
Index Terms
- Graph algorithms for biological systems analysis
Recommendations
Graph theoretic methods for the analysis of structural relationships in biological macromolecules: Research Articles
BioinformaticsSubgraph isomorphism and maximum common subgraph isomorphism algorithms from graph theory provide an effective and an efficient way of identifying structural relationships between biological macromolecules. They thus provide a natural complement to the ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIAM Activity Group on Discrete Mathematics
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 20 January 2008
Check for updates
Qualifiers
- Research-article
Conference
SODA08
Sponsor:
SODA08: 19th ACM-SIAM Symposium on Discrete Algorithms
January 20 - 22, 2008
California, San Francisco
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 832Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)1
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
Cited By
View all- Besser BPoloczek M(2017)Greedy MatchingAlgorithmica10.1007/s00453-015-0062-277:1(201-234)Online publication date: 1-Jan-2017
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in