{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T10:56:30Z","timestamp":1789556190320,"version":"build-2803163510"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1186\/1748-7188-8-17","type":"journal-article","created":{"date-parts":[[2013,7,5]],"date-time":"2013-07-05T14:15:01Z","timestamp":1373033701000},"source":"Crossref","is-referenced-by-count":2,"title":["Estimating population size via line graph reconstruction"],"prefix":"10.1186","volume":"8","author":[{"given":"Bjarni V","family":"Halld\u00f3rsson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dima","family":"Blokh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roded","family":"Sharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,7,5]]},"reference":[{"key":"190_CR1","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 (LNCS 2983)","author":"BV Halld\u00f3rsson","year":"2004","unstructured":"Halld\u00f3rsson BV, Bafna V, Edwards N, Lippert R, Yooseph S, Istrail S: A survey of computational methods for determining haplotypes. Computational Methods for SNPs and Haplotype Inference (LNCS 2983). 2004, 26-47. 10.1.1.85.4196. [\n                    http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?\n                    \n                  ], Springer"},{"issue":"2","key":"190_CR2","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 J Comput. 2009, 22 (2): 195-209.","journal-title":"INFORMS J Comput"},{"issue":"3","key":"190_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1089\/cmb.2010.0288","volume":"18","author":"BV Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson BV, Aguiar D, Tarpine R, Istrail S: The Clark Phaseable sample size problem: long-range phasing and loss of heterozygosity in GWAS. J Comput Biol. 2011, 18 (3): 323-333.","journal-title":"J Comput Biol"},{"key":"190_CR4","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 Res. 2009, 19: 1254-61.","journal-title":"Genome Res"},{"key":"190_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1038\/nature09298","volume":"467","author":"The International HapMap Consortium","year":"2010","unstructured":", : Integrating common and rare genetic variation in diverse human populations. Nature. 2010, 467: 52-58.","journal-title":"Nature"},{"key":"190_CR6","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. Am J Math. 1932, 54: 150-162. 10.2307\/2371086.","journal-title":"Am J Math"},{"key":"190_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"PGH Lehot","year":"1974","unstructured":"Lehot PGH: An optimal algorithm to detect a line graph and output its root graph. J ACM. 1974, 21: 569-575. 10.1145\/321850.321853.","journal-title":"J ACM"},{"key":"190_CR8","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. Inf Process Lett. 1974, 2: 108-112.","journal-title":"Inf Process Lett"},{"key":"190_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01904834","volume":"16","author":"A Van Rooij","year":"1965","unstructured":"Van Rooij A, Wilf H: The interchange graphs of a finite graph. Acta Math Acad Sci Hungar. 1965, 16: 263-269. 10.1007\/BF01904834.","journal-title":"Acta Math Acad Sci Hungar"},{"key":"190_CR10","first-page":"111","volume":"7","author":"A Clark","year":"1990","unstructured":"Clark A: Inference of haplotypes from PCR-amplified samples of diploid populations. Mol Biol Evol. 1990, 7: 111-122.","journal-title":"Mol Biol Evol"},{"key":"190_CR11","doi-asserted-by":"crossref","unstructured":"Yannakakis M: Node-and edge-deletion NP-complete problems. Proceedings of the tenth annual ACM symposium on Theory of computing, 10.1145\/800133.804355. STOC \u201978. New York: ACM, 1978:253-264.","DOI":"10.1145\/800133.804355"},{"key":"190_CR12","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. Inf Process Lett. 1996, 58: 171-176. 10.1016\/0020-0190(96)00050-6.","journal-title":"Inf Process Lett"},{"key":"190_CR13","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. J Discrete Algorithms. 2003, 1: 89-102. 10.1016\/S1570-8667(03)00009-1.","journal-title":"J Discrete Algorithms"},{"key":"190_CR14","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/380752.380839","volume-title":"Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing","author":"L Trevisan","year":"2001","unstructured":"Trevisan L: Non-approximability results for optimization problems on bounded degree instances. Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. ACM, 2001, 453-461."},{"issue":"2","key":"190_CR15","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. J Algorithms. 1981, 2 (2): 198-203. 10.1016\/0196-6774(81)90020-1.","journal-title":"J Algorithms"},{"issue":"7","key":"190_CR16","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 Appl Math. 2008, 156 (7): 1097-1111. 10.1016\/j.dam.2007.05.058.","journal-title":"Discrete Appl Math"},{"issue":"2","key":"190_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/bioinformatics\/18.2.337","volume":"18","author":"RR Hudson","year":"2002","unstructured":"Hudson RR: Generating samples under a Wright-Fisher neutral model of genetic variation. Bioinformatics. 2002, 18 (2): 337-338.","journal-title":"Bioinformatics"},{"issue":"2","key":"190_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ajhg.2009.01.005","volume":"84","author":"BL Browning","year":"2009","unstructured":"Browning BL, Browning SR: A unified approach to genotype imputation and haplotype-phase inference for large data sets of trios and unrelated individuals. Am J Human Genet. 2009, 84 (2): 210-223. 10.1016\/j.ajhg.2009.01.005.","journal-title":"Am J Human Genet"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-17.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-8-17\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-17.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:53:45Z","timestamp":1548114825000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-8-17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-8-17","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]},"article-number":"17"}}