Clique-detection models in computational biochemistry and genomics-Reference-Cited by-同舟云学术

Clique-detection models in computational biochemistry and genomics

Published:2006-08 Issue:1 Volume:173 Page:1-17
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Butenko S.,Wilhelm W.E.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference61 articles.

1. Bioinformatics and management science: Some common tools and techniques;Abbas;Operations Research,2004

2. On maximum clique problems in very large graphs;Abello,1999

3. Abu-Khzam, F., Langston, M., Shanbhag, P., November 2003. Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. In: International Conference on Parallel and Distributed Computing and Systems. Los Angeles, CA, pp. 563–568.

4. Arora, S., Safra, S., 1992. Approximating clique is NP-complete. In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. Piscataway, NJ, pp. 2–13.

5. Genomic mapping by anchoring random clones: A mathematical analysis;Arratia;Genomics,1991

Cited by 116 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. How do centrality measures help to predict similarity patterns in molecular chemical structural graphs?;Artificial Intelligence Chemistry;2023-12

2. Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches;European Journal of Operational Research;2023-08

3. Maximal Defective Clique Enumeration;Proceedings of the ACM on Management of Data;2023-05-26

4. Clustering networked funded European research activities through rank-size laws;Annals of Operations Research;2023-05-05

5. On atomic cliques in temporal graphs;Optimization Letters;2023-02-07