{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:44Z","timestamp":1740140624025,"version":"3.37.3"},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2015,1,1]]},"DOI":"10.1109\/tcbb.2014.2352031","type":"journal-article","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T14:25:12Z","timestamp":1409063112000},"page":"234-247","source":"Crossref","is-referenced-by-count":1,"title":["Tractable Cases of <inline-formula><tex-math notation=\"LaTeX\">$(*,2)$<\/tex-math><alternatives> <inline-graphic xlink:type=\"simple\" xlink:href=\"oosterwijk-ieq1-2352031.gif\"\/><\/alternatives><\/inline-formula>-Bounded Parsimony Haplotyping"],"prefix":"10.1109","volume":"12","author":[{"given":"Judith","family":"Keijsper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8509-7002","authenticated-orcid":false,"given":"Tim","family":"Oosterwijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.70232"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.05.007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.40"},{"article-title":"Models for solving minimum parsimony haplotyping","year":"2007","author":"stef\u00e1nsd\u00f3ttir","key":"ref13"},{"key":"ref4","first-page":"128","article-title":"On the complexity of several haplotyping problems","author":"cilibrasi","year":"0","journal-title":"Algorithms in Bioinformatics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.01.016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2010.72"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1038\/nature02168","article-title":"The international hapmap project","volume":"426","year":"2003","journal-title":"Nature"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1201\/9781420036275.ch18"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13509-5_20"},{"article-title":"On parsimony haplotyping","year":"2008","author":"cicalese","key":"ref2"},{"year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-44888-8_11","article-title":"Haplotype inference by pure parsimony","volume":"2676","author":"gusfield","year":"0","journal-title":"Combinatorial Pattern Matching"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/7035191\/06883135.pdf?arnumber=6883135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:27Z","timestamp":1641987687000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6883135\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":13,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2014.2352031","relation":{},"ISSN":["1545-5963"],"issn-type":[{"type":"print","value":"1545-5963"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}