{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:20:32Z","timestamp":1649006432136},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> We initiate a systematic study of the ROW DELETION(B) problem on matrices: Given an input matrix A and a fixed \"forbidden submatrix\" B, the task is to remove a minimum number of rows from A such that no row or column permutation of B occurs as a submatrix in the resulting matrix. An application of this problem can be found, for instance, in the construction of perfect phylogenies. Establishing a strong connection to variants of the NP-complete HITTING SET problem, we describe and analyze structural properties of B that make ROW DELETION(B)NP-complete. On the positive side, the close relation with HITTING SET problems yields constant-factor polynomial-time approximation algorithms and fixed-parameter tractability results. <\/jats:p>","DOI":"10.1142\/s0129054106004522","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T12:02:04Z","timestamp":1166011324000},"page":"1467-1484","source":"Crossref","is-referenced-by-count":1,"title":["THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS"],"prefix":"10.1142","volume":"17","author":[{"given":"SEBASTIAN","family":"WERNICKE","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOCHEN","family":"ALBER","sequence":"additional","affiliation":[{"name":"Digsilent GmbH, Heinrich-Hertz-Stra\u00dfe 9, D-72810 Gomaringen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JENS","family":"GRAMM","sequence":"additional","affiliation":[{"name":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, D-72076 T\u00fcbingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JIONG","family":"GUO","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ROLF","family":"NIEDERMEIER","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Complexity and Approximation\u2014 Combinatorial Optimization Problems and their Approximability Properties","author":"Ausiello Giorgio","year":"1999"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.004"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"rf6","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum Dorit S.","year":"1997"},{"key":"rf9","volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6rg","year":"2006"},{"key":"rf10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1090-5"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1178-y"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00054-H"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90060-4"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00391-7"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00009-1"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702406510"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"rf21","volume-title":"Approximation Algorithms","author":"Vazirani Vijay V.","year":"2001"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:27:48Z","timestamp":1565191668000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":18,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129054106004522"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004522","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}