{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T01:25:07Z","timestamp":1759541107892},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0022-0000(02)00007-7","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T18:45:29Z","timestamp":1043174729000},"page":"508-525","source":"Crossref","is-referenced-by-count":76,"title":["Steps toward accurate reconstructions of phylogenies from gene-order data"],"prefix":"10.1016","volume":"65","author":[{"given":"Bernard M.E.","family":"Moret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jijun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-San","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2\/3","key":"10.1016\/S0022-0000(02)00007-7_BIB1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/PL00008277","article-title":"The performance of the neighbor-joining methods of phylogenetic reconstruction","volume":"25","author":"Atteson","year":"1999","journal-title":"Algorithmica"},{"issue":"47","key":"10.1016\/S0022-0000(02)00007-7_BIB2","article-title":"GRAPPA runs in record time","volume":"9","author":"Bader","year":"2000","journal-title":"HPC Wire"},{"issue":"5","key":"10.1016\/S0022-0000(02)00007-7_BIB3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1089\/106652701753216503","article-title":"A linear-time algorithm for computing inversion distance between signed permutations with an experimental study","volume":"8","author":"Bader","year":"2001","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB4","unstructured":"V. Bafna, P. Pevzner, Sorting permutations by transpositions, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA95, ACM Press, New York, 1995, pp. 614\u2013623."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB5","series-title":"Genome Informatics 1997","first-page":"25","article-title":"Breakpoint phylogenies","author":"Blanchette","year":"1997"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/PL00006542","article-title":"Gene order breakpoint evidence in animal mitochondrial phylogeny","volume":"49","author":"Blanchette","year":"1998","journal-title":"J. Mol. Evol."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB7","unstructured":"D. Bryant, The complexity of the breakpoint median problem, Centre de Recherches Math\u00e9matiques, Technical Report CRM2579, Universit\u00e9 de Montr\u00e9al, 1998."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB8","doi-asserted-by":"crossref","unstructured":"D. Bryant, A lower bound for the breakpoint phylogeny problem, in: Lecture Notes in Computer Science, Vol. 1848. Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM), Springer-Verlag, Berlin, 2000, pp. 235\u2013247.","DOI":"10.1007\/3-540-45123-4_21"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB9","doi-asserted-by":"crossref","unstructured":"A. Caprara, Formulations and hardness of multiple sorting by reversals, in: Proceedings of the Third International Conference on Research in Computational Molecular Biology, RECOMB99, ACM Press, New York, 1999, pp. 84\u201393.","DOI":"10.1145\/299432.299461"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB10","series-title":"Comparative Genomics","first-page":"171","article-title":"Experimental and statistical analysis of sorting by reversals","author":"Caprara","year":"2000"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB11","series-title":"Practical Nonparametric Statistics","author":"Conover","year":"1999"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB12","series-title":"Comparative Genomics","first-page":"99","article-title":"An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae","author":"Cosner","year":"2000"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB13","unstructured":"M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L. Wang, T. Warnow, S.K. Wyman, A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data, in: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology ISMB-2000, 2000, pp. 104\u2013115."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB14","unstructured":"Workshop on Gene Order Dynamics, Comparative Maps and Multigene Families (DCAF), Montreal, Canada, August 2000."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB15","unstructured":"DIMACS Workshop on Whole Genome Comparison, Piscataway, NJ, USA, February 2001."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB16","series-title":"Plant Molecular Systematics","first-page":"14","article-title":"Use of chloroplast DNA rearrangements in reconstructing plant phylogeny","author":"Downie","year":"1992"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB17","unstructured":"GRAPPA: Genome rearrangements analysis under parsimony and other phylogenetic algorithms, http:\/\/www.cs.unm.edu\/~moret\/GRAPPA\/."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB18","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for genomic distance problems), in: Proceedings of the 27th Symposium on the Theory of Computing, STOC95, ACM Press, New York, 1995, pp. 178\u2013189.","DOI":"10.1145\/225058.225112"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB19","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB20","unstructured":"R.K. Jansen, Personal communication, October 2000."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB21","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1093\/sysbio\/46.4.590","article-title":"Nexus","volume":"46","author":"Maddison","year":"1997","journal-title":"Sys. Biol."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB22","unstructured":"B.M.E. Moret, D.A. Bader, T. Warnow, High-performance algorithm engineering for computational phylogenetics, in: Proceedings of the 2001 International Conference on Computational Science, San Francisco, CA, Lecture Notes in Computer Science, Vol. 2073\u20132074, Springer-Verlag, Berlin, 2001."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB23","doi-asserted-by":"crossref","unstructured":"B.M.E. Moret, L.-S. Wang, T. Warnow, S. Wyman, New approaches for reconstructing phylogenies based on gene order, in: Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, ISMB 2001, Bioinformatics, Vol. 17, 2001, pp. S165\u2013S173.","DOI":"10.1093\/bioinformatics\/17.suppl_1.S165"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB24","doi-asserted-by":"crossref","unstructured":"B.M.E. Moret, S.K. Wyman, D.A. Bader, T. Warnow, M. Yan, A new implementation and detailed study of breakpoint analysis, in: Proceedings of the Sixth Pacific Symposium on Biocomputing PSB 2001, World Scientific, Singapore, 2001, pp. 583\u2013594.","DOI":"10.1142\/9789814447362_0056"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB25","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1073\/pnas.81.3.814","article-title":"Lengths of chromosome segments conserved since divergence of man and mouse","volume":"81","author":"Nadeau","year":"1984","journal-title":"Proceedings of the Academy of National Sciences USA"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB26","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.2307\/2445483","article-title":"Chloroplast DNA systematics","volume":"81","author":"Olmstead","year":"1994","journal-title":"Amer. J. Bot."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB27","series-title":"Cell Organelles","first-page":"99","article-title":"Chloroplast and mitochondrial genome evolution in land plants","author":"Palmer","year":"1992"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB28","article-title":"The median problems for breakpoints are NP-complete","volume":"71","author":"Pe'er","year":"1998","journal-title":"Electronic Colloquium Computational Complexity"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB29","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1126\/science.255.5052.1697","article-title":"Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants","volume":"255","author":"Raubeson","year":"1992","journal-title":"Science"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB30","first-page":"406","article-title":"The neighbor-joining method","volume":"4","author":"Saitou","year":"1987","journal-title":"Molecular Biology Evolution"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB31","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","article-title":"Multiple genome rearrangement and breakpoint phylogeny","volume":"5","author":"Sankoff","year":"1998","journal-title":"J. Comp. Biol."},{"key":"10.1016\/S0022-0000(02)00007-7_BIB32","doi-asserted-by":"crossref","unstructured":"D. Sankoff, M. Blanchette, Probability models for genome rearrangements and linear invariants for phylogenetic inference, in: Proceedings of the Third International Conference on Research in Computational Molecular Biology, RECOMB99, ACM Press, New York, 1999, pp. 302\u2013309.","DOI":"10.1145\/299432.299506"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB33","series-title":"Molecular Systematics","article-title":"Phylogenetic inference","author":"Swofford","year":"1996"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB34","doi-asserted-by":"crossref","unstructured":"L.-S. Wang, Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes, in: Proceedings of the First Workshop on Algorithms in Bioinformatics WABI\u201901, Lecture Notes in Computer Science, Vol. 2149, Springer-Verlag, \u00c5rhus, Denmark, Berlin, 2001, pp. 176\u2013190.","DOI":"10.1007\/3-540-44696-6_14"},{"key":"10.1016\/S0022-0000(02)00007-7_BIB35","doi-asserted-by":"crossref","unstructured":"L.-S. Wang, T. Warnow, Estimating true evolutionary distances between genomes, in: Proceedings of the 33th Annual Symposium on the Theory of Computing, STOC\u201901, ACM Press, New York, 2001, pp. 637\u2013646.","DOI":"10.1145\/380752.380861"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:04:48Z","timestamp":1583993088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0022000002000077"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00007-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}