{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:25Z","timestamp":1725455785701},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_6","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"69-80","source":"Crossref","is-referenced-by-count":0,"title":["Estimating Population Size via Line Graph Reconstruction"],"prefix":"10.1007","author":[{"given":"Bjarni V.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dima","family":"Blokh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roded","family":"Sharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ajhg.2009.01.005","volume":"84","author":"B.L. Browning","year":"2009","unstructured":"Browning, B.L., Browning, S.R.: A unified approach to genotype imputation and haplotype-phase inference for large data sets of trios and unrelated individuals. American Journal of Human Genetics\u00a084(2), 210\u2013223 (2009)","journal-title":"American Journal of Human Genetics"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters\u00a058, 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"issue":"7","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/j.dam.2007.05.058","volume":"156","author":"M. Campelo","year":"2008","unstructured":"Campelo, M., Campos, V., Correa, R.: On the asymmetric representatives formulation for the vertex coloring problem. Discrete Applied Mathematics\u00a0156(7), 1097\u20131111 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1287\/ijoc.1090.0333","volume":"22","author":"D. Catanzaro","year":"2009","unstructured":"Catanzaro, D., Godi, A., Labb\u00e9, M.: A class representative model for pure parsimony haplotyping. Informs Journal of Computing\u00a022(2), 195\u2013209 (2009)","journal-title":"Informs Journal of Computing"},{"key":"6_CR5","first-page":"111","volume":"7","author":"A. Clark","year":"1990","unstructured":"Clark, A.: Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology and Evolution\u00a07, 111\u2013122 (1990)","journal-title":"Molecular Biology and Evolution"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"S. Even","year":"1981","unstructured":"Even, S., Bar-Yehuda, R.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms\u00a02(2), 198\u2013203 (1981)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1089\/cmb.2010.0288","volume":"18","author":"B.V. Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, B.V., Aguiar, D., Tarpine, R., Istrail, S.: The Clark Phaseable Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS. Journal of Computational Biology\u00a018(3), 323\u2013333 (2011)","journal-title":"Journal of Computational Biology"},{"key":"6_CR8","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-24719-7_3","volume-title":"Computational Methods for SNPs and Haplotype Inference","author":"B.V. Halld\u00f3rsson","year":"2004","unstructured":"Halld\u00f3rsson, B.V., Bafna, V., Edwards, N., Lippert, R., Yooseph, S., Istrail, S.: A Survey of Computational Methods for Determining Haplotypes. In: Istrail, S., Waterman, M.S., Clark, A. (eds.) DIMACS\/RECOMB Satellite Workshop 2002. LNCS (LNBI), vol.\u00a02983, pp. 26\u201347. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/bioinformatics\/18.2.337","volume":"18","author":"R.R. Hudson","year":"2002","unstructured":"Hudson, R.R.: Generating samples under a Wright-Fisher neutral model of genetic variation. Bioinformatics\u00a018(2), 337\u2013338 (2002)","journal-title":"Bioinformatics"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"P.G.H. Lehot","year":"1974","unstructured":"Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. ACM\u00a021, 569\u2013575 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. Journal of Discrete Algorithms\u00a01(1), 89\u2013102 (2003)","journal-title":"Journal of Discrete Algorithms"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1101\/gr.088559.108","volume":"19","author":"S. Prabhu","year":"2009","unstructured":"Prabhu, S., Pe\u2019er, I.: Overlapping pools for high-throughput targeted resequencing. Genome Research\u00a019, 1254\u20131261 (2009)","journal-title":"Genome Research"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N. Roussopoulos","year":"1974","unstructured":"Roussopoulos, N.: A max(m, n) algorithm for determining the graph H from its line graph G. Information Processing Letters\u00a02, 108\u2013112 (1974)","journal-title":"Information Processing Letters"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 453\u2013461. ACM (2001)","DOI":"10.1145\/380752.380839"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01904834","volume":"16","author":"A. Rooij Van","year":"1965","unstructured":"Van Rooij, A., Wilf, H.: The interchange graphs of a finite graph. Acta Math. Acad. Sci. Hungar.\u00a016, 263\u2013269 (1965)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. American Journal of Mathematics\u00a054, 150\u2013162 (1932)","journal-title":"American Journal of Mathematics"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/800133.804355","volume-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 253\u2013264. ACM, New York (1978)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:05Z","timestamp":1620129365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}