{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:25Z","timestamp":1725550045239},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_15","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"182-195","source":"Crossref","is-referenced-by-count":0,"title":["Inapproximability Results for the Lateral Gene Transfer Problem"],"prefix":"10.1007","author":[{"given":"Bhaskar","family":"DasGupta","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Ferrarini","sequence":"additional","affiliation":[]},{"given":"Uthra","family":"Gopalakrishnan","sequence":"additional","affiliation":[]},{"given":"Nisha Raj","family":"Paryani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"key":"15_CR2","volume-title":"Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)"},{"key":"15_CR3","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results, further improvements, Technical Report TR98-065. Electronic Colloquium on Computational Complexity, ECCC (1998); available online from \n                    \n                      http:\/\/eccc.uni-trier.de\/eccc-reports\/1998\/TR98065\/index.html"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0890-5401(92)90056-L","volume":"96","author":"P. Berman","year":"1992","unstructured":"Berman, P., Schnitger, G.: On the complexity of approximating the independent set problem. Information and Computation\u00a096, 77\u201394 (1992)","journal-title":"Information and Computation"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1038\/nrg1000","volume":"4","author":"J.R. Brown","year":"2003","unstructured":"Brown, J.R.: Ancient horizontal gene transfer. Nature Reviews, Genetics\u00a04, 121\u2013132 (2003)","journal-title":"Nature Reviews, Genetics"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Hallett, M., Lagergren, J.: Efficient algorithms for lateral gene transfer problems. In: Proc. 5\n                    th\n                   Annual International Conference on Computational Molecular Biology (RECOMB), Montreal, Canada, pp. 141\u2013148 (2001)","DOI":"10.1145\/369133.369188"},{"key":"15_CR7","unstructured":"Hallett, M., Lagergren, J.: Identifying lateral gene transfer events, submitted to SIAM Journal of Computing (2004), available online from \n                    \n                      http:\/\/www.mcb.mcgill.ca\/~hallett\/Lateral.pdf"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/mpev.1996.0390","volume":"7","author":"R.D.M. Page","year":"1997","unstructured":"Page, R.D.M., Charleston, M.A.: From gene to organismal phylogeny: Reconciled tree and the gene tree\/ species tree problem. Molecular Phylogentics and Evolution\u00a07, 231\u2013240 (1997)","journal-title":"Molecular Phylogentics and Evolution"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences\u00a043(3), 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:16Z","timestamp":1619507596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11560586_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}