{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:11Z","timestamp":1759063691361},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T00:00:00Z","timestamp":1246320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00453-009-9331-2","type":"journal-article","created":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T18:43:16Z","timestamp":1246300996000},"page":"313-332","source":"Crossref","is-referenced-by-count":4,"title":["Structural Identifiability in Low-Rank Matrix Factorization"],"prefix":"10.1007","volume":"56","author":[{"given":"Epameinondas","family":"Fritzilas","sequence":"first","affiliation":[]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[]},{"given":"Yasmin A.","family":"Rios-Solis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,30]]},"reference":[{"key":"9331_CR1","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge,\u00a0C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43, 842\u2013844 (1957)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"4","key":"9331_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TCBB.2005.47","volume":"2","author":"R. Boscolo","year":"2005","unstructured":"Boscolo,\u00a0R., Sabatti,\u00a0C., Liao, J.C., Roychowdhury, V.P.: A generalized framework for network component analysis. IEEE Trans. Comput. Biol. Bioinform. 2(4), 289\u2013301 (2005)","journal-title":"IEEE Trans. Comput. Biol. Bioinform."},{"issue":"12","key":"9331_CR3","doi-asserted-by":"crossref","first-page":"4164","DOI":"10.1073\/pnas.0308531101","volume":"101","author":"J.-P. Brunet","year":"2004","unstructured":"Brunet, J.-P., Tamayo,\u00a0P., Golub, T.R., Mesirov, J.P.: Metagenes and molecular pattern discovery using matrix factorization. Proc. Natl. Acad. Sci. 101(12), 4164\u20134169 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9331_CR4","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel,\u00a0R.: Graph Theory. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (2005)"},{"key":"9331_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-69733-6_15","volume-title":"Computing and Combinatorics","author":"E. Fritzilas","year":"2008","unstructured":"Fritzilas,\u00a0E., Rahmann,\u00a0S., Rios-Solis, Y.A.: Structural identifiability in low-rank matrix factorization. In: Hu,\u00a0X., Wang,\u00a0J. (eds.) Computing and Combinatorics. LNCS, vol.\u00a05092, pp. 140\u2013148. Springer, Berlin (2008). Proceedings of the 14th International Conference COCOON 2008, Dalian, China"},{"key":"9331_CR6","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige,\u00a0S.: Submodular Functions and Optimization. Elsevier, Amsterdam (2005)"},{"key":"9331_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9331_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"9331_CR9","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D.D. Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"issue":"26","key":"9331_CR10","doi-asserted-by":"crossref","first-page":"15522","DOI":"10.1073\/pnas.2136632100","volume":"100","author":"J.C. Liao","year":"2003","unstructured":"Liao, J.C., Boscolo,\u00a0R., Yang, Y.-L., Tran, L.M., Sabatti,\u00a0C., Roychowdhury, V.P.: Network component analysis: reconstruction of regulatory signals in biological systems. Proc. Natl. Acad. Sci. 100(26), 15522\u201315527 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9331_CR11","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"C.-J. Lin","year":"2007","unstructured":"Lin, C.-J.: Projected gradient methods for non-negative matrix factorization. Neural Comput. 19, 2756\u20132779 (2007)","journal-title":"Neural Comput."},{"key":"9331_CR12","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz,\u00a0L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)"},{"key":"9331_CR13","volume-title":"Matrices and Matroids for Systems Analysis","author":"K. Murota","year":"2000","unstructured":"Murota,\u00a0K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)"},{"issue":"1","key":"9331_CR14","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/TCBB.2007.70231","volume":"6","author":"S. Narasimhan","year":"2009","unstructured":"Narasimhan,\u00a0S., Rengaswamy,\u00a0R., Vadigepalli,\u00a0R.: Structural properties of gene regulatory networks: Definitions and connections. IEEE Trans. Comput. Biol. Bioinform. 6(1), 158\u2013170 (2009)","journal-title":"IEEE Trans. Comput. Biol. Bioinform."},{"key":"9331_CR15","volume-title":"Submodular Functions and Electrical Networks","author":"H. Narayanan","year":"1997","unstructured":"Narayanan,\u00a0H.: Submodular Functions and Electrical Networks. Elsevier, Amsterdam (1997)"},{"key":"9331_CR16","volume-title":"Combinatorial Optimization","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Stieglitz,\u00a0K.: Combinatorial Optimization. Dover, New York (1998)"},{"key":"9331_CR17","doi-asserted-by":"crossref","unstructured":"Raz,\u00a0R., Safra,\u00a0S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: STOC, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"issue":"12","key":"9331_CR18","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1090\/S0002-9904-1942-07811-6","volume":"48","author":"A. Sard","year":"1942","unstructured":"Sard,\u00a0A.: The measure of the critical values of differentiable maps. Bull. Am. Math. Soc. 48(12), 883\u2013890 (1942)","journal-title":"Bull. Am. Math. Soc."},{"key":"9331_CR19","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2004","unstructured":"Schrijver,\u00a0A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2004)"},{"issue":"2","key":"9331_CR20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ipm.2004.11.005","volume":"42","author":"F. Shahnaz","year":"2006","unstructured":"Shahnaz,\u00a0F., Berry, M.W., Pauca, V.P., Plemmons, R.J.: Document clustering using nonnegative matrix factorization. Inf. Proc. Manag. 42(2), 373\u2013386 (2006)","journal-title":"Inf. Proc. Manag."},{"key":"9331_CR21","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2004","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2004)"},{"key":"9331_CR22","doi-asserted-by":"crossref","first-page":"i315","DOI":"10.1093\/bioinformatics\/btg1044","volume":"19","author":"H. Wang","year":"2003","unstructured":"Wang,\u00a0H., Hubbell,\u00a0E., Hu,\u00a0J., Mei,\u00a0G., Cline,\u00a0M., Lu,\u00a0G., Clark,\u00a0T., Siani-Rose, M.A., Ares,\u00a0M., Kulp, D.C., Haussler,\u00a0D.: Gene structure-based splice variant deconvolution using a microarray platform. Bioinformatics 19, i315\u2013i322 (2003)","journal-title":"Bioinformatics"},{"issue":"4","key":"9331_CR23","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385\u2013393 (1982)","journal-title":"Combinatorica"},{"key":"9331_CR24","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9331-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9331-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9331-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:04Z","timestamp":1559137504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9331-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,30]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9331"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9331-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,30]]}}}