Computing Optimal Cycles of Homology Groups

Chapter
Part of the Mathematics for Industry book series (MFI, volume 5)

Abstract

This is a brief survey concerning the problem of computing optimal cycles of homology groups through linear optimization. While homology groups encode information about the presence of topological features such as holes and voids of some geometrical structure, optimal cycles tighten the representatives of the homology classes. This allows us to infer additional information concerning the location of those topological features. Moreover, by a slight modification of the original problem, we extend it to the case where we have multiple nonhomologous cycles. By considering a more general class of combinatorial structures called complexes, we recast this multiple nonhomologous cycles problem as a single cycle optimization problem in a modified complex. Finally, as a numerical example, we apply the optimal cycles problem to the 3D structure of human deoxyhemoglobin.

Keywords

Computational topology Homology groups Optimal cycles 

Notes

Acknowledgments

The authors would like to thank Hayato Waki for valuable comments and discussions and for introducing optimization software.

References

  1. 1.
    H.M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T.N. Bhat, H. Weissig, I.N. Shindyalov, P.E. Bourne, The protein data bank. Nucleic Acids Res. 28(1), 235–242 (2000)CrossRefGoogle Scholar
  2. 2.
    Cgal, Computational geometry algorithms library. http://www.cgal.org
  3. 3.
    C. Chen, D. Freedman, Quantifying homology classes, in Symposium on Theoretical Aspects of Computer, Science, 169–180 (2008)Google Scholar
  4. 4.
    C. Chen, D. Freedman, Measuring and computing natural generators for homology groups. Comput. Geom. 43(2), 169–181 (2010)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    CHomP homology software. http://chomp.rutgers.edu/
  6. 6.
    T.K. Dey, A.N. Hirani, B. Krishnamoorthy, Optimal homologous cycles, total unimodularity, and linear programming. SIAM J. Comput. 40(4), 1026–1044 (2011)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    H. Edelsbrunner, Weighted alpha shapes. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 1992Google Scholar
  8. 8.
    G. Fermi, M.F. Perutz, B. Shaanan, R. Fourme, The crystal structure of human deoxyhaemoglobin at 1.74 a resolution. J. Mol. Biol. 175(2), 159–174 (1984)CrossRefGoogle Scholar
  9. 9.
    M. Gameiro, Y. Hiraoka, S. Izumi, M. Kramar, K. Mischaikow, V. Nanda, Topological Measurement of Protein Compressibility via Persistence Diagrams, MI Preprint Series, 6 (2012)Google Scholar
  10. 10.
    International Business Machines Corp, IBM ILOG CPLEX optimization studio. http://www-03.ibm.com/software/products/en/ibmilogcpleoptistud/
  11. 11.
    T. Kaczynski, K. Mischaikow, M. Mrozek, Computational Homology (Springer, New York, 2004)CrossRefMATHGoogle Scholar
  12. 12.
    J. Munkres, Elements of Algebraic Topology (The Benjamin/Cummings Publishing Company Inc, Menlo Park, 1984)MATHGoogle Scholar
  13. 13.
    A. Schrijver, in Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimzation (Wiley, New York, 2000)Google Scholar
  14. 14.
    A.F. Veinott Jr, G.B. Dantzig, Integral extreme points. SIAM Rev. 10(3), 371–372 (1968)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    A. Zomorodian, G. Carlsson, Computing persistent homology. Discrete Comput. Geom. 33, 249–274 (2004)MathSciNetCrossRefGoogle Scholar
  16. 16.
    A. Zomorodian, G. Carlsson, Localized Homology. Comput. Geom. 41(3), 126–148 (2008)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Japan 2014

Authors and Affiliations

  1. 1.Graduate School of Mathematics Kyushu UniversityNishi-kuJapan
  2. 2.Institute of Mathematics for IndustryKyushu UniversityNishi-kuJapan

Personalised recommendations