{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:50:36Z","timestamp":1742395836629},"reference-count":8,"publisher":"Oxford University Press (OUP)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,3,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: ParIS Genome Rearrangement is a web server for a Bayesian analysis of unichromosomal genome pairs. The underlying model allows inversions, transpositions and inverted transpositions. The server generates a Markov chain using a Partial Importance Sampler technique, and samples trajectories of mutations from this chain. The user can specify several marginalizations to the posterior: the posterior distribution of number of mutations needed to transform one genome into another, length distribution of mutations, number of mutations that have occurred at a given site. Both text and graphical outputs are available. We provide a limited server, a downloadable unlimited server that can be installed locally on any linux\/Unix operating system, and a database of mitochondrial gene orders.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/www.colbud.hu:8765\/paris.html and http:\/\/doob.stats.ox.ac.uk\/~miklos\/paris.html<\/jats:p>\n               <jats:p>Contact: \u00a0miklosi@ramet.elte.hu<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti060","type":"journal-article","created":{"date-parts":[[2004,10,13]],"date-time":"2004-10-13T01:32:31Z","timestamp":1097631151000},"page":"817-820","source":"Crossref","is-referenced-by-count":9,"title":["ParIS Genome Rearrangement server"],"prefix":"10.1093","volume":"21","author":[{"given":"I.","family":"Mikl\u00f3s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ittz\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Hein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2004,10,12]]},"reference":[{"key":"2023013107223445800_B1","doi-asserted-by":"crossref","unstructured":"Blanchette, M., Kunisawa, T., Sankoff, D. 1996Parametric genome rearrangement. Gene172GC11\u2013GC17","DOI":"10.1016\/0378-1119(95)00878-0"},{"key":"2023013107223445800_B2","doi-asserted-by":"crossref","unstructured":"Eriksen, N. 2001(1+\u03b5)-Approximation of sorting by reversals and transpositions. Proceedings of WABI2001 BRICS , Denmark  LNCS 2149 University of Aarhus,  pp. 227\u2013237","DOI":"10.1007\/3-540-44696-6_18"},{"key":"2023013107223445800_B3","doi-asserted-by":"crossref","unstructured":"Gu, Q.-P., Peng, S., Sudborough, I.H. 1999A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoret. Comput. Sci.210327\u2013339","DOI":"10.1016\/S0304-3975(98)00092-9"},{"key":"2023013107223445800_B4","unstructured":"Hannenhalli, S. 1996Polynomial algorithm for computing translocation distance between genomes. Proceedings of CPM1996 , CA ,  pp. 168\u2013185"},{"key":"2023013107223445800_B5","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S. and Pevzner, P.A. 1999Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM461\u201327","DOI":"10.1145\/300515.300516"},{"key":"2023013107223445800_B6","unstructured":"Larget, B., Simon, D.L., Kadane, J.B. 2002Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. R. Stat. Soc. B.64681\u2013695"},{"key":"2023013107223445800_B7","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s, I. 2003MCMC genome rearrangement. Bioinformatics19ii130\u2013ii137","DOI":"10.1093\/bioinformatics\/btg1070"},{"key":"2023013107223445800_B8","unstructured":"Tessler, G. 2002GRIMM: genome rearrangements web server. Bioinformatics18492\u2013493"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/6\/817\/48962401\/bioinformatics_21_6_817.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/6\/817\/48962401\/bioinformatics_21_6_817.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T09:47:12Z","timestamp":1675158432000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/6\/817\/199170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,12]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,3,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti060","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,3,15]]},"published":{"date-parts":[[2004,10,12]]}}}