Acceleration of Binding Site Comparisons by Graph Partitioning

E-ISSN： 1868-1751|34|8|550-558

ISSN： 1868-1743

Source： MOLECULAR INFORMATICS, Vol.34, Iss.8, 2015-08, pp. : 550-558

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Partitioning a graph into vertex-disjoint paths

By Li Jianping Steiner George

Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. : 277-294

Akademiai Kiado

Access to resources Recommend Favorite

An efficient approach for large scale graph partitioning

By Zamprogno Renzo Amaral André

Journal of Combinatorial Optimization, Vol. 13, Iss. 4, 2007-05 ,pp. : 289-320

Springer Publishing Company

Access to resources Recommend Favorite

Contribution of copositive formulations to the graph partitioning problem

By Povh Janez

Optimization, Vol. 62, Iss. 1, 2013-01 ,pp. : 71-83

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

By Feige U. Langberg M.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 174-211

Elsevier

Access to resources Recommend Favorite

Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis

By Choulakian Vartan Tibeiro Jules

Journal of Classification, Vol. 30, Iss. 3, 2013-10 ,pp. : 397-427

Springer Publishing Company

Access to resources Recommend Favorite