Author:
San Segundo Pablo,Lopez Alvaro,Artieda Jorge,Pardalos Panos M.
Funder
Ministerio de Economía y Competitividad
Russell Sage Foundation
Publisher
Springer Science and Business Media LLC
Reference36 articles.
1. Karp, R.M.: Reducibility among combinatorial problems. In: Miller R.E., Thatcher J. W., (eds.) Complexity of computer computations. New York, 85–103 (1972)
2. Konc, J., Janezic, D.: ProBiS algorithm for detection of structurally similar protein binding sites by local structural alignment. Bioinformatics 26, 1160–1168 (2010)
3. Eblen, J., Phillips, C., Rogers, G., Langston, M.: The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinf. 13, S5 (2012)
4. Butenko, S., Chaovalitwongse, W., Pardalos, P. (eds.): Clustering Challenges in Biological Networks. World Scientific, Singapore (2009)
5. Segundo San, P., Artieda, J.: A novel clique formulation for the visual feature matching problem. Appl. Intell. 43(2), 325–342 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献