{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:32:54Z","timestamp":1725557574653},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_19","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"202-213","source":"Crossref","is-referenced-by-count":3,"title":["Mod\/Resc Parsimony Inference"],"prefix":"10.1007","author":[{"given":"Igor","family":"Nor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Charlat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Engelstadter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Reuter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Duron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1038\/sj.hdy.6800994","volume":"99","author":"S.R. Bordenstein","year":"2007","unstructured":"Bordenstein, S.R., Werren, J.H.: Bidirectional incompatibility among divergent wolbachia and incompatibility level differences among closely related wolbachia in nasonia. Heredity\u00a099(3), 278\u2013287 (2007)","journal-title":"Heredity"},{"issue":"1-3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/B:GENE.0000017629.31383.8f","volume":"120","author":"H. Mer\u00e7ot","year":"2004","unstructured":"Mer\u00e7ot, H., Charlat, S.: Wolbachia infections in drosophila melanogaster and d. simulans: polymorphism and levels of cytoplasmic incompatibility. Genetica\u00a0120(1-3), 51\u201359 (2004)","journal-title":"Genetica"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1603\/0022-2585-38.3.382","volume":"38","author":"S.L. Dobson","year":"2001","unstructured":"Dobson, S.L., Marsland, E.J., Rattanadechakul, W.: Wolbachia-induced cytoplasmic incompatibility in single- and superinfected aedes albopictus (diptera: Culicidae). J Med Entomol.\u00a038(3), 382\u2013387 (2001)","journal-title":"J Med Entomol."},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"10","key":"19_CR5","doi-asserted-by":"crossref","first-page":"3061","DOI":"10.1111\/j.1365-294X.2006.02996.x","volume":"15","author":"O. Duron","year":"2006","unstructured":"Duron, O., Bernard, C., Unal, S., Berthomieu, A., Berticat, C., Weill, M.: Tracking factors modulating cytoplasmic incompatibilities in the mosquito culex pipiens. Mol Ecol.\u00a015(10), 3061\u20133071 (2006)","journal-title":"Mol Ecol."},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1146\/annurev.ecolsys.110308.120206","volume":"40","author":"J. Engelstadter","year":"2009","unstructured":"Engelstadter, J., Hurst, G.D.D.: The ecology and evolution of microbes that manipulate host reproduction. Annual Review of Ecology, Evolution and Systematics\u00a0(40), 127\u2013149 (2009)","journal-title":"Annual Review of Ecology, Evolution and Systematics"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Engelstadter, J., Telschow, A.: Cytoplasmic incompatibility and host population structure. Heredity\u00a0(103), 196\u2013207 (2009)","DOI":"10.1038\/hdy.2009.53"},{"issue":"21-23","key":"19_CR8","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1016\/j.tcs.2008.12.059","volume":"410","author":"H. Fleischner","year":"2009","unstructured":"Fleischner, H., Mujuni, E., Paulusma, D., Szeider, S.: Covering graphs with few complete bipartite subgraphs. Theoretical Computer Science\u00a0410(21-23), 2045\u20132053 (2009)","journal-title":"Theoretical Computer Science"},{"key":"19_CR9","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., Huffner, F., Niedermeier, R.: Data reduction, exact, and heuristic algorithms for clique cover. In: Proceedings of the 8th ACM\/SIAM workshop on ALgorithm ENgineering and EXperiments (ALENEX), pp. 86\u201394 (2006)","DOI":"10.1137\/1.9781611972863.9"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-73208-2_21","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2007","unstructured":"Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P\u2260NP. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 205\u2013216. Springer, Heidelberg (2007)"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"issue":"1","key":"19_CR13","first-page":"24","volume":"39","author":"A.D. Korshunov","year":"1983","unstructured":"Korshunov, A.D.: Asymptotic behaviour of stirling numbers of the second kind. Diskret. Anal.\u00a039(1), 24\u201341 (1983)","journal-title":"Diskret. Anal."},{"key":"19_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"5","key":"19_CR15","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indagationes Mathematicae\u00a080(5), 406\u2013424 (1977)","journal-title":"Indagationes Mathematicae"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/bies.10234","volume":"25","author":"D. Poinsot","year":"2003","unstructured":"Poinsot, D., Charlat, S., Mer\u00e7ot, H.: On the mechanism of wolbachia-induced cytoplasmic incompatibility: confronting the models with the facts. Bioessays\u00a025(1), 259\u2013265 (2003)","journal-title":"Bioessays"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s004930070035","volume":"20","author":"E. Prisner","year":"2000","unstructured":"Prisner, E.: Bicliques in graphs I: Bounds on their number. Combinatorica\u00a020(1), 109\u2013117 (2000)","journal-title":"Combinatorica"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:11:42Z","timestamp":1558293102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}