{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:55:27Z","timestamp":1725486927529},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72845-0_27","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:51:37Z","timestamp":1182862297000},"page":"352-364","source":"Crossref","is-referenced-by-count":0,"title":["Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data"],"prefix":"10.1007","author":[{"given":"Fei","family":"Ye","sequence":"first","affiliation":[]},{"given":"Yan","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Lawson","sequence":"additional","affiliation":[]},{"given":"Jijun","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"Computing and Combinatorics","author":"M. Blanchette","year":"1997","unstructured":"Blanchette, M., Sankoff, D.: The median problem for breakpoints in comparative genomics. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol.\u00a01276, pp. 251\u2013263. Springer, Heidelberg (1997)"},{"key":"27_CR2","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Research\u00a012, 26\u201336 (2002)","journal-title":"Genome Research"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/299432.299461","volume-title":"RECOMB\u201999","author":"A. Caprara","year":"1999","unstructured":"Caprara, A.: Formulations and hardness of multiple sorting by reversals. In: RECOMB\u201999. Proc. 3rd Int\u2019l Conf. on Comput. Mol. Biol, pp. 84\u201393. ACM Press, New York (1999)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-44696-6_19","volume-title":"Algorithms in Bioinformatics","author":"A. Caprara","year":"2001","unstructured":"Caprara, A.: On the practical solution of the reversal median problem. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 238\u2013251. Springer, Heidelberg (2001)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/biomet\/89.3.539","volume":"89","author":"N. Chopin","year":"2002","unstructured":"Chopin, N.: A sequential particle filter method for static models. Biometrika\u00a089, 539\u2013552 (2002)","journal-title":"Biometrika"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Cosner, M.E., Raubeson, L.A., Jansen, R.K.: Chloroplast DNA rearrangements in Campanulaceae: Phylogenetic utility of highly rearranged genomes. BMC Evol. Biol. 4(27) (2004)","DOI":"10.1186\/1471-2148-4-27"},{"key":"27_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3437-9","volume-title":"Sequential Monte Carlo Methods in Practice","author":"A. Doucet","year":"2001","unstructured":"Doucet, A., de Freitas, N., Gordon, N.: Sequential Monte Carlo Methods in Practice. Springer, Heidelberg (2001)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Downie, S., Palmer, J.: Use of chloroplast DNA rearrangements in reconstructing plant phylogeny. In: Soltis, P., Soltis, D., Doyle, J. (eds.) Plant Molecular Systematics, pp. 14\u201335 (1992)","DOI":"10.1007\/978-1-4615-3276-7_2"},{"issue":"2","key":"27_CR9","first-page":"217","volume":"16","author":"P.L. Erd\u0151s","year":"1997","unstructured":"Erd\u0151s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.: Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule. Computers and Artif. Intell.\u00a016(2), 217\u2013227 (1997)","journal-title":"Computers and Artif. Intell."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2307\/2412810","volume":"27","author":"J. Felsenstein","year":"1978","unstructured":"Felsenstein, J.: The number of evolutionary trees. Systematic Zoology\u00a027, 27\u201333 (1978)","journal-title":"Systematic Zoology"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Gilks, W., Berzuini, C.: Following a moving target-Monte Carlo inference for dynamic Bayesian models. J. of the Royal Statistical Society (2001)","DOI":"10.1111\/1467-9868.00280"},{"key":"27_CR12","first-page":"178","volume-title":"Proc. 27th Ann. Symp. Theory of Computing","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals. In: Proc. 27th Ann. Symp. Theory of Computing, pp. 178\u2013189. ACM Press, New York (1995)"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1089\/106652799318337","volume":"6","author":"D. Huson","year":"1999","unstructured":"Huson, D., Nettles, S., Warnow, T.: Disk-covering, a fast converging method for phylogenetic tree reconstruction. J. Comput. Biol.\u00a06(3), 369\u2013386 (1999)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1093\/molbev\/msi032","volume":"22","author":"B. Larget","year":"2005","unstructured":"Larget, B., Simon, D.L., Kadane, J.B., Sweet, D.: A Bayesian analysis of metazoan mitochondrial genome arrangements. Mol. Biol. and Evol.\u00a022(3), 486\u2013495 (2005)","journal-title":"Mol. Biol. and Evol."},{"key":"27_CR15","series-title":"Lecture Notes in Artificial Intelligence","first-page":"63","volume-title":"Autonomous Intelligent Systems: Agents and Data Mining","author":"T. Liu","year":"2005","unstructured":"Liu, T., Tang, J., Moret, B.M.E.: Quartet methods for phylogeny reconstruction from gene orders. In: Gorodetsky, V., Liu, J., Skormin, V.A. (eds.) AIS-ADM 2005. LNCS (LNAI), vol.\u00a03505, pp. 63\u201373. Springer, Heidelberg (2005)"},{"key":"27_CR16","first-page":"583","volume-title":"Proc. 6th Pacific Symp. on Biocomputing (PSB 01)","author":"B.M.E. Moret","year":"2001","unstructured":"Moret, B.M.E., Wyman, S., Bader, D.A., Warnow, T., Yan, M.: A new implementation and detailed study of breakpoint analysis. In: Proc. 6th Pacific Symp. on Biocomputing (PSB 01), pp. 583\u2013594. World Scientific Pub, Singapore (2001)"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/S0022-0000(02)00007-7","volume":"65","author":"B.M.E. Moret","year":"2002","unstructured":"Moret, B.M.E., Tang, J., Wang, L.-S., Warnow, T.: Steps toward accurate reconstructions of phylogenies from gene-order data. J. Comput. Syst. Sci.\u00a065(3), 508\u2013525 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/oso\/9780198566106.003.0012","volume-title":"Mathematics of Evolution and Phylogeny","author":"B.M.E. Moret","year":"2005","unstructured":"Moret, B.M.E., Tang, J., Warnow, T.: Reconstructing phylogenies from gene-content and gene-order data. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, pp. 321\u2013352. Oxford Univ. Press, Oxford (2005)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Mossel, E., Vigoda, E.: Limitations of Markov Chain Monte Carlo Algorithms for Bayesian Inference of Phylogeny. Quantitative Biology 4(12) (2006)","DOI":"10.1214\/105051600000000538"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.2307\/2445483","volume":"81","author":"R. Olmstead","year":"1994","unstructured":"Olmstead, R., Palmer, J.: Chloroplast DNA systematics: a review of methods and data analysis. Amer. J. Bot.\u00a081, 1205\u20131224 (1994)","journal-title":"Amer. J. Bot."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Palmer, J.: Chloroplast and mitochondria genome evolution in land plants. In: Herrmann, R. (ed.), Cell Organelles, pp. 99\u2013133 (1992)","DOI":"10.1007\/978-3-7091-9138-5_3"},{"key":"27_CR22","unstructured":"Pe\u2019er, I., Shamir, R.: The median problems for breakpoints are NP-complete. Elec. Colloq. on Comput. Complexity 71 (1998)"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1024084221803","volume":"7","author":"G. Ridgeway","year":"2002","unstructured":"Ridgeway, G., Madigan, D.: A sequential Monte Carlo method for Bayesian analysis of massive datasets. Data Mining and Knowledge Discovery\u00a07, 301\u2013319 (2002)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1126\/science.255.5052.1697","volume":"255","author":"L. Raubeson","year":"1992","unstructured":"Raubeson, L., Jansen, R.: Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science\u00a0255, 1697\u20131699 (1992)","journal-title":"Science"},{"key":"27_CR25","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol.\u00a04, 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","volume":"5","author":"D. Sankoff","year":"1998","unstructured":"Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol.\u00a05, 555\u2013570 (1998)","journal-title":"J. Comput. Biol."},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Swofford, D.L., Olson, G., Waddell, P., Hillis, D.M.: Phylogenetic inference. In: Hillis, D.M., Moritz, C., Mable, B. (eds.) Molecular Systematics, 2nd edn. chapter\u00a011 (1996)","DOI":"10.2307\/1447682"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Tang, J., Moret, B.M.E.: Scaling up accurate phylogenetic reconstruction from gene-order data. In: Proc. 11th Conf. on Intelligent Systems for Mol. Biol. ISMB\u201903, in Bioinformatics, vol. 19, pp. i305\u2013i312 (2003)","DOI":"10.1093\/bioinformatics\/btg1042"},{"key":"27_CR29","unstructured":"Tang, J.: Large-scale Phylogenetic Reconstruction from Arbitrary Gene-order Data. Ph.D. Dissertation (2004), available online at http:\/\/www.cse.sc.edu\/~jtang\/dissertation.ps"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/11496656_35","volume-title":"Combinatorial Pattern Matching","author":"J. Tang","year":"2005","unstructured":"Tang, J., Moret, B.M.E.: Linear programming for phylogenetic reconstruction based on gene rearrangements. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 406\u2013416. Springer, Heidelberg (2005)"},{"key":"27_CR31","first-page":"524","volume-title":"Proc. 7th Pacific Symp. on Biocomputing (PSB 02)","author":"L.-S. Wang","year":"2002","unstructured":"Wang, L.-S., Jansen, R., Moret, B.M.E., Raubeson, L., Warnow, T.: Fast phylogenetic methods for genome rearrangement evolution: An empirical study. In: Proc. 7th Pacific Symp. on Biocomputing (PSB 02), pp. 524\u2013535. World Scientific Pub, Singapore (2002)"}],"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-540-72845-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T13:43:42Z","timestamp":1708004622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72845-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728443"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72845-0_27","relation":{},"subject":[]}}