{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:44:51Z","timestamp":1725464691051},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_22","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T01:44:33Z","timestamp":1338169473000},"page":"248-259","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data"],"prefix":"10.1007","author":[{"given":"Masashi","family":"Kiyomi","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/S0097539702406510","volume":"33","author":"I. Pe\u2019er","year":"2004","unstructured":"Pe\u2019er, I., Pupko, T., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. SIAM J. Comput.\u00a033, 590\u2013607 (2004)","journal-title":"SIAM J. Comput."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/2406441","volume":"19","author":"J.H. Camin","year":"1965","unstructured":"Camin, J.H., Sokal, R.R.: A method for deducing branching sequences in phylogeny. Evolution\u00a019, 311\u2013326 (1965)","journal-title":"Evolution"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-73545-8_8","volume-title":"Computing and Combinatorics","author":"D. Gusfield","year":"2007","unstructured":"Gusfield, D., Frid, Y., Brown, D.: Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 51\u201364. Springer, Heidelberg (2007)"},{"key":"22_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB, pp. 487\u2013499. Morgan Kaufmann (1994)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: DAC, pp. 272\u2013277. ACM Press (1993)","DOI":"10.1145\/157485.164890"},{"key":"22_CR6","volume-title":"The Art of Computer Programming Volume 4, Fascicle 1, Bitwise Tricks & Techniques, Binary Decision Diagrams","author":"D.E. Knuth","year":"2009","unstructured":"Knuth, D.E.: The Art of Computer Programming Volume 4, Fascicle 1, Bitwise Tricks & Techniques, Binary Decision Diagrams. Pearson Education, Inc., Boston (2009)"},{"key":"22_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation & Counting: A Markov Chain Approach","author":"A. Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation & Counting: A Markov Chain Approach. Birkh\u00e4user Boston, Boston Basel Berlin (1993)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms\u00a019, 449\u2013473 (1995)","journal-title":"J. Algorithms"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1016\/j.tcs.2010.03.024","volume":"411","author":"S. Kijima","year":"2010","unstructured":"Kijima, S., Kiyomi, M., Okamoto, Y., Uno, T.: On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci.\u00a0411, 2591\u20132601 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10878-010-9322-x","volume":"22","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., Mancini, F., Papadopoulos, C., Sritharan, R.: Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim.\u00a022, 438\u2013456 (2011)","journal-title":"J. Comb. Optim."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Kiyomi, M., Okamoto, Y., Saitoh, T.: Efficient enumeration of the directed binary perfect phylogenies from incomplete data, arXiv:1203.3284 (2012)","DOI":"10.1007\/978-3-642-30850-5_22"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-0-387-30162-4_112","volume-title":"Encyclopedia of Algorithms","author":"J. Jansson","year":"2008","unstructured":"Jansson, J.: Directed perfect phylogeny (binary characters). In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 246\u2013248. Springer, Heidelberg (2008)"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput.\u00a08, 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"22_CR14","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, 337\u2013338 (2002), \n                    \n                      http:\/\/home.uchicago.edu\/~rhudson1\/source\/mksamples.html","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:03:07Z","timestamp":1558314187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}