{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"76 - 90","main_file_link":[{"url":"https://doi.org/10.1016/j.jsc.2016.03.008","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"publist_id":"5765","quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","id":"10894","status":"public"}]},"intvolume":"        78","project":[{"call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000384396000005"]},"_id":"1433","volume":78,"author":[{"last_name":"Bauer","full_name":"Bauer, Ulrich","first_name":"Ulrich"},{"first_name":"Michael","full_name":"Kerber, Michael","last_name":"Kerber"},{"last_name":"Reininghaus","full_name":"Reininghaus, Jan","first_name":"Jan"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"doi":"10.1016/j.jsc.2016.03.008","publication_status":"published","day":"01","publication":"Journal of Symbolic Computation","date_published":"2017-01-01T00:00:00Z","ec_funded":1,"status":"public","article_type":"original","department":[{"_id":"HeEd"}],"oa_version":"Published Version","publication_identifier":{"issn":[" 07477171"]},"abstract":[{"text":"Phat is an open-source C. ++ library for the computation of persistent homology by matrix reduction, targeted towards developers of software for topological data analysis. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. We provide numerous different reduction strategies as well as data types to store and manipulate the boundary matrix. We compare the different combinations through extensive experimental evaluation and identify optimization techniques that work well in practical situations. We also compare our software with various other publicly available libraries for persistent homology.","lang":"eng"}],"year":"2017","publisher":"Academic Press","scopus_import":"1","article_processing_charge":"No","isi":1,"date_updated":"2023-09-20T09:42:40Z","month":"01","title":"Phat - Persistent homology algorithms toolbox","type":"journal_article","citation":{"apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2017). Phat - Persistent homology algorithms toolbox. <i>Journal of Symbolic Computation</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">https://doi.org/10.1016/j.jsc.2016.03.008</a>","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “Phat - Persistent Homology Algorithms Toolbox.” <i>Journal of Symbolic Computation</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">https://doi.org/10.1016/j.jsc.2016.03.008</a>.","mla":"Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.” <i>Journal of Symbolic Computation</i>, vol. 78, Academic Press, 2017, pp. 76–90, doi:<a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">10.1016/j.jsc.2016.03.008</a>.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 78, 76–90.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90.","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. Phat - Persistent homology algorithms toolbox. <i>Journal of Symbolic Computation</i>. 2017;78:76-90. doi:<a href=\"https://doi.org/10.1016/j.jsc.2016.03.008\">10.1016/j.jsc.2016.03.008</a>","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology algorithms toolbox,” <i>Journal of Symbolic Computation</i>, vol. 78. Academic Press, pp. 76–90, 2017."},"date_created":"2018-12-11T11:51:59Z"}