{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T22:24:15Z","timestamp":1773354255465,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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,12]]},"DOI":"10.1186\/1748-7188-8-3","type":"journal-article","created":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T18:13:48Z","timestamp":1358964828000},"source":"Crossref","is-referenced-by-count":9,"title":["A mixed integer linear programming model to reconstruct phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion"],"prefix":"10.1186","volume":"8","author":[{"given":"Daniele","family":"Catanzaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramamoorthi","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"issue":"3","key":"176_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2008.26","volume":"5","author":"S Sridhar","year":"2008","unstructured":"Sridhar S, Lam F, Blelloch GE, Ravi R, Schwartz R: Mixed integer linear programming for maximum parsimony phylogeny inference. IEEE\/ACM Trans Comput Biol Bioinformatics. 2008, 5 (3): 323-331.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinformatics"},{"issue":"3","key":"176_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1089\/cmb.2010.0254","volume":"18","author":"N Misra","year":"2011","unstructured":"Misra N, Blelloch GE, Ravi R, Schwartz R: Generalized Buneman pruning for inferring the most parsimonious multi-state phylogeny. J Comput Biol. 2011, 18 (3): 445-457.","journal-title":"J Comput Biol"},{"key":"176_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/050632634","volume":"49","author":"L Pachter","year":"2007","unstructured":"Pachter L, Sturmfels B: The mathematics of phylogenomics. SIAM Rev. 2007, 49: 3-31. 10.1137\/050632634.","journal-title":"SIAM Rev"},{"issue":"5446","key":"176_CR4","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1126\/science.286.5446.1921","volume":"286","author":"RM Bush","year":"1999","unstructured":"Bush RM, Bender CA, Subbarao K, Cox NJ, Fitch WM: Predicting the evolution of human influenza A. Science. 1999, 286 (5446): 1921-1925.","journal-title":"Science"},{"issue":"22","key":"176_CR5","doi-asserted-by":"publisher","first-page":"11715","DOI":"10.1128\/JVI.76.22.11715-11720.2002","volume":"76","author":"HA Ross","year":"2002","unstructured":"Ross HA, Rodrigo AG: Immune-mediated positive selection drives human immunodeficency virus type 1 molecular variation and predicts disease duration. J Virol. 2002, 76 (22): 11715-11720.","journal-title":"J Virol"},{"issue":"5060","key":"176_CR6","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1126\/science.256.5060.1165","volume":"256","author":"CY Ou","year":"1992","unstructured":"Ou CY, Ciesielski CA, Myers G, Bandea CI, Luo CC, Korber BTM, Mullins JI, Schochetman G, Berkelman RL, Economou AN, Witte JJ, Furman LJ, Satten GA, Maclnnes KA, Curran JW, Jaffe HW: Molecular epidemiology of HIV transmission in a dental practice. Science. 1992, 256 (5060): 1165-1171.","journal-title":"Science"},{"issue":"5624","key":"176_CR7","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1126\/science.1085953","volume":"300","author":"MA Marra","year":"2003","unstructured":"Marra MA, Jones SJ, Astell CR, Holt RA, Brooks-Wilson A, Butterfield YS, Khattra J, Asano JK, Barber SA, Chan SY, Cloutier A, Coughlin SM, Freeman D, Girn N, Griffith OL, Leach SR, Mayo M, McDonald H, Montgomery SB, Pandoh PK, Petrescu AS, Robertson AG, Schein JE, Siddiqui A, Smailus DE, Stott JM, Yang GS, Plummer F, Andonov A, Artsob H, Bastien N, Bernard K, Booth TF, Bowness D, Czub M, Drebot M, Fernando L, Flick R, Garbutt M, Gray M, Grolla A, Jones S, Feldmann H, Meyers A, Kabani A, Li Y, Normand S, Stroher U, Tipples GA, Tyler S, Vogrig R, Ward D, Watson B, Brunham RC, Krajden M, Petric M, Skowronski DM, Upton C, Roper RL: The genome sequence of the SARS-associated coronavirus. Science. 2003, 300 (5624): 1399-1404.","journal-title":"Science"},{"issue":"3","key":"176_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0169-5347(99)01778-4","volume":"15","author":"BSW Chang","year":"2000","unstructured":"Chang BSW, Donoghue MJ: Recreating ancestral proteins. Trends Ecol Evol. 2000, 15 (3): 109-114.","journal-title":"Trends Ecol Evol"},{"key":"176_CR9","first-page":"159","volume-title":"SPIE ITCom 4528","author":"DA Bader","year":"2001","unstructured":"Bader DA, Moret BME, Vawter L: Industrial applications of high-performance computing for phylogeny reconstruction. SPIE ITCom 4528. SPIE, Denver 2001, 159-168."},{"key":"176_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198549857.001.0001","volume-title":"New Uses for New Phylogenies","author":"PH Harvey","year":"1996","unstructured":"Harvey PH, Brown AJL, Smith JM, Nee S: New Uses for New Phylogenies. Oxford University Press, Oxford 1996."},{"key":"176_CR11","volume-title":"Mathematical Approaches to Polymer Sequence Analysis and Related Problems","author":"D Catanzaro","year":"2011","unstructured":"Catanzaro D: Estimating phylogenies from molecular data. Mathematical Approaches to Polymer Sequence Analysis and Related Problems. Edited by: Bruni R. Springer, New York 2011."},{"key":"176_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0025-5564(74)90028-5","volume":"19","author":"WA Beyer","year":"1974","unstructured":"Beyer WA, Stein M, Smith T, Ulam S: A molecular sequence metric and evolutionary trees. Math Biosci. 1974, 19: 9-25. 10.1016\/0025-5564(74)90028-5.","journal-title":"Math Biosci"},{"key":"176_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0022-5193(77)90351-4","volume":"64","author":"MS Waterman","year":"1977","unstructured":"Waterman MS, Smith TF, Singh M, Beyer WA: Additive evolutionary trees. J Theor Biol. 1977, 64: 199-213.","journal-title":"J Theor Biol"},{"key":"176_CR14","volume-title":"Parsimony, Phylogeny, and Genomics","author":"VA Albert","year":"2005","unstructured":"Albert VA: Parsimony, Phylogeny, and Genomics. Oxford University Press, Oxford 2005."},{"issue":"2","key":"176_CR15","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1089\/cmb.2006.13.522","volume":"13","author":"Z Ding","year":"2006","unstructured":"Ding Z, Filkov V, Gusfield D: A linear time algorithm for Perfect Phylogeny Haplotyping (PPH) problem. J Comput Biol. 2006, 13 (2): 522-553.","journal-title":"J Comput Biol"},{"issue":"3","key":"176_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00453-007-0094-3","volume":"48","author":"P Bonizzoni","year":"2007","unstructured":"Bonizzoni P: A linear time algorithm for the Perfect Phylogeny Haplotype problem. Algorithmica. 2007, 48 (3): 267-285. 10.1007\/s00453-007-0094-3.","journal-title":"Algorithmica"},{"issue":"2","key":"176_CR17","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/net.20280","volume":"53","author":"D Catanzaro","year":"2009","unstructured":"Catanzaro D: The minimum evolution problem: Overview and classification. Networks. 2009, 53 (2): 112-125. 10.1002\/net.20280.","journal-title":"Networks"},{"key":"176_CR18","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein J: Inferring Phylogenies. Sinauer Associates, Sunderland 2004."},{"key":"176_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1089\/10665270360688048","volume":"10","author":"V Bafna","year":"2003","unstructured":"Bafna V, Gusfield D, Lancia G, Yooseph S: Haplotyping as perfect phylogeny: A direct approach. J Comput Biol. 2003, 10: 323-340.","journal-title":"J Comput Biol"},{"issue":"2a","key":"176_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S021972000700259X","volume":"5","author":"G Pennington","year":"2006","unstructured":"Pennington G, Smith CA, Shackney S, Schwartz R: Reconstructing tumor phylogenies from heterogeneous single-cell data. J Bioinformatics Comput Biol. 2006, 5 (2a): 407-427.","journal-title":"J Bioinformatics Comput Biol"},{"key":"176_CR21","doi-asserted-by":"publisher","first-page":"e100077","DOI":"10.1371\/journal.pcbi.1000777","volume":"6","author":"M Riester","year":"2010","unstructured":"Riester M, Attolini CSO, Downey RJ, Singer S, Michor F: A differentiation-based phylogeny of cancer subtypes. PLoS Comput Biol. 2010, 6: e100077.","journal-title":"PLoS Comput Biol"},{"issue":"4","key":"176_CR22","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TCBB.2007.1070","volume":"4","author":"S Sridhar","year":"2007","unstructured":"Sridhar S, Dhamdhere K, Blelloch GE, Halperin E, Ravi R, Schwartz R: Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice. IEEE\/ACM Trans Comput Biol Bioinformatics. 2007, 4 (4): 561-571.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinformatics"},{"key":"176_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"MX Goemans","year":"1993","unstructured":"Goemans MX, Myung YS: A catalog of Steiner tree formulations. Networks. 1993, 23: 19-28. 10.1002\/net.3230230104.","journal-title":"Networks"},{"key":"176_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2174\/157489306775330570","volume":"1","author":"XS Zhang","year":"2006","unstructured":"Zhang XS, Wang RS, Wu LY, Chen L: Models and algorithms for haplotyping problem. Curr Bioinformatics. 2006, 1: 105-114. 10.2174\/157489306775330570.","journal-title":"Curr Bioinformatics"},{"issue":"5","key":"176_CR25","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1111\/j.1475-3995.2009.00716.x","volume":"16","author":"D Catanzaro","year":"2009","unstructured":"Catanzaro D, Labb\u00e9 M: The pure parsimony haplotyping problem: Overview and computational advances. Int Trans Oper Res. 2009, 16 (5): 561-584. 10.1111\/j.1475-3995.2009.00716.x.","journal-title":"Int Trans Oper Res"},{"key":"176_CR26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D Gusfield","year":"1991","unstructured":"Gusfield D: Efficient algorithms for inferring evolutionary trees. Networks. 1991, 21: 19-28. 10.1002\/net.3230210104.","journal-title":"Networks"},{"key":"176_CR27","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1137\/S0097539793244587","volume":"23","author":"R Argawala","year":"1994","unstructured":"Argawala R, Fernandez-Baca D: A polynomial time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J Comput. 1994, 23: 1216-1224. 10.1137\/S0097539793244587.","journal-title":"SIAM J Comput"},{"key":"176_CR28","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1137\/S0097539794279067","volume":"26","author":"S Kannan","year":"1997","unstructured":"Kannan S, Warnow T: A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM J Comput. 1997, 26: 1749-1763. 10.1137\/S0097539794279067.","journal-title":"SIAM J Comput"},{"key":"176_CR29","volume-title":"Computers and Intractability","author":"MR Garey","year":"2003","unstructured":"Garey MR, Johnson DS: Computers and Intractability. 2003, Freeman, New York,"},{"key":"176_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3171-2","volume-title":"Advances in Steiner trees","author":"DZ Du","year":"2000","unstructured":"Du DZ, Smith JM, Rubinstein JH: Advances in Steiner trees. Kluwer Academic Publisher, Boston 2000."},{"key":"176_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner Trees in Industry","author":"X Cheng","year":"2001","unstructured":"Cheng X, Du DZ: Steiner Trees in Industry. 2001, Kluwer Academic Publishers, Boston,"},{"issue":"30","key":"176_CR32","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti M, Salazar-Gonz\u00e1les JJ, Toth P: A branch and cut algorithm for the symmetric generalized traveling salesman problem. Oper Res. 1997, 45 (30): 378-395.","journal-title":"Oper Res"},{"key":"176_CR33","first-page":"26","volume-title":"Discrete Mathematics and Theoretical Computer Science, Volume 2731 of Lecture Note in Computer Science","author":"BV Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson BV, Bafna V, Edwards N, Lippert R: Combinatorial problems arising in SNP and haplotype analysis. Discrete Mathematics and Theoretical Computer Science, Volume 2731 of Lecture Note in Computer Science. Edited by: Calude CS. Springer-Verlag, Berlin 2003, 26-47."},{"key":"176_CR34","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G Robins","year":"2005","unstructured":"Robins G, Zelikovsky A: Tighter bounds for graph Steiner tree approximation. SIAM J Discrete Math. 2005, 19: 122-134. 10.1137\/S0895480101393155.","journal-title":"SIAM J Discrete Math"},{"issue":"18","key":"176_CR35","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1038\/nature02168","volume":"426","author":"The International HapMap Consortium","year":"2003","unstructured":", : The international hapmap project. Nature. 2003, 426 (18): 789-796.","journal-title":"Nature"},{"issue":"1-3","key":"176_CR36","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01582573","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra S, Rao MR: The Steiner tree problem I: Formulations, compositions and extension of facets. Math Programming. 1994, 64 (1-3): 209-229. 10.1007\/BF01582573.","journal-title":"Math Programming"},{"issue":"1-3","key":"176_CR37","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01582574","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra S, Rao MR: The Steiner tree problem II: Properties and classes of facets. Math Programming. 1994, 64 (1-3): 231-246. 10.1007\/BF01582574.","journal-title":"Math Programming"},{"key":"176_CR38","unstructured":"Koch T, Martin A, Vo\u00df S: SteinLib: An Updated Library on Steiner Tree Problems in Graphs. Berlin: Tech. Rep. ZIB-Report 00-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7; 2000. [ http:\/\/elib.zib.de\/steinlib ], Berlin: Tech. Rep. ZIB-Report 00-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7; 2000. []"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-8-3\/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-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T04:09:03Z","timestamp":1714882143000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-8-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-8-3","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,23]]},"article-number":"3"}}