{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T05:55:53Z","timestamp":1717653353992},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"S15","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1186\/1471-2105-14-s15-s9","type":"journal-article","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T05:02:47Z","timestamp":1381813367000},"source":"Crossref","is-referenced-by-count":13,"title":["Sorting genomes with rearrangements and segmental duplications through trajectory graphs"],"prefix":"10.1186","volume":"14","author":[{"given":"Mingfu","family":"Shao","sequence":"first","affiliation":[]},{"given":"Yu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Moret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"6104_CR1","first-page":"163","volume-title":"Proc 6th Workshop Algs in Bioinf (WABI'06), Volume 4175 of Lecture Notes in Comp Sci","author":"A Bergeron","year":"2006","unstructured":"Bergeron A, Mixtacki J, Stoye J: A unifying view of genome rearrangements. Proc 6th Workshop Algs in Bioinf (WABI'06), Volume 4175 of Lecture Notes in Comp Sci. 2006, Springer Verlag, Berlin, 163-173."},{"issue":"16","key":"6104_CR2","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos S, Attie O, Friedberg R: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005, 21 (16): 3340-3346. 10.1093\/bioinformatics\/bti535.","journal-title":"Bioinformatics"},{"issue":"51","key":"6104_CR3","doi-asserted-by":"publisher","first-page":"5300","DOI":"10.1016\/j.tcs.2009.09.008","volume":"410","author":"A Bergeron","year":"2009","unstructured":"Bergeron A, Mixtacki J, Stoye J: A new linear-time algorithm to compute the genomic distance via the double cut and join distance. Theor Comput Sci. 2009, 410 (51): 5300-5316. 10.1016\/j.tcs.2009.09.008.","journal-title":"Theor Comput Sci"},{"key":"6104_CR4","first-page":"439","volume-title":"Proc 16th Conf Computing and Combinatorics (COCOON'10), Volume 6196 of Lecture Notes in Comp Sci","author":"X Chen","year":"2010","unstructured":"Chen X: On sorting permutations by double-cut-and-joins. Proc 16th Conf Computing and Combinatorics (COCOON'10), Volume 6196 of Lecture Notes in Comp Sci. 2010, Springer Verlag, Berlin, 439-448."},{"issue":"Suppl 9","key":"6104_CR5","doi-asserted-by":"publisher","first-page":"S17","DOI":"10.1186\/1471-2105-12-S9-S17","volume":"12","author":"X Chen","year":"2011","unstructured":"Chen X, Sun R, Yu J: Approximating the double-cut-and-join distance between unsigned genomes. BMC Bioinformatics. 2011, 12 (Suppl 9): S17-10.1186\/1471-2105-12-S9-S17.","journal-title":"BMC Bioinformatics"},{"key":"6104_CR6","first-page":"170","volume-title":"Proc 6th RECOMB Work on Comp Genomics (RECOMBCG'08). Lecture Notes in Computer Science 5267, Volume 5267 of Lecture Notes in Comp Sci","author":"S Yancopoulos","year":"2008","unstructured":"Yancopoulos S, Friedberg R: Sorting genomes with insertions, deletions and duplications by DCJ. Proc 6th RECOMB Work on Comp Genomics (RECOMBCG'08). Lecture Notes in Computer Science 5267, Volume 5267 of Lecture Notes in Comp Sci. 2008, Springer Verlag, Berlin, 170-183."},{"key":"6104_CR7","first-page":"148","volume-title":"Proc 34th Ann IEEE Symp Foundations of Comput Sci (FOCS'93)","author":"V Bafna","year":"1993","unstructured":"Bafna V, Pevzner P: Genome rearrangements and sorting by reversals. Proc 34th Ann IEEE Symp Foundations of Comput Sci (FOCS'93). 1993, 148-157."},{"key":"6104_CR8","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna V, Pevzner P: Genome rearrangements and sorting by reversals. SIAM J on Computing. 1996, 25: 272-289. 10.1137\/S0097539793250627.","journal-title":"SIAM J on Computing"},{"key":"6104_CR9","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/225058.225112","volume-title":"Proc 27th Ann ACM Symp Theory of Comput (STOC'95)","author":"S Hannenhalli","year":"1995","unstructured":"Hannenhalli S, Pevzner P: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc 27th Ann ACM Symp Theory of Comput (STOC'95). 1995, ACM Press, New York, 178-189."},{"issue":"5","key":"6104_CR10","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D Bader","year":"2001","unstructured":"Bader D, Moret B, Yan M: A fast linear-time algorithm for inversion distance with an experimental comparison. J Comput Biol. 2001, 8 (5): 483-491. 10.1089\/106652701753216503.","journal-title":"J Comput Biol"},{"key":"6104_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2007.04.011","volume":"104","author":"G Jean","year":"2007","unstructured":"Jean G, Nikolski M: Genome rearrangements: a correct algorithm for optimal capping. Inf Proc Letters. 2007, 104: 14-20. 10.1016\/j.ipl.2007.04.011.","journal-title":"Inf Proc Letters"},{"key":"6104_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0219720003000198","volume":"1","author":"M Ozery-Flato","year":"2003","unstructured":"Ozery-Flato M, Shamir R: Two notes on genome rearrangement. J Bioinf Comp Bio. 2003, 1: 71-94. 10.1142\/S0219720003000198.","journal-title":"J Bioinf Comp Bio"},{"issue":"3","key":"6104_CR13","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G Tesler","year":"2002","unstructured":"Tesler G: Efficient algorithms for multichromosomal genome rearrangements. J Comput Syst Sci. 2002, 65 (3): 587-609. 10.1016\/S0022-0000(02)00011-9.","journal-title":"J Comput Syst Sci"},{"key":"6104_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-15294-8_8","volume-title":"Algorithms in Bioinformatics","author":"M Braga","year":"2010","unstructured":"Braga M, Willing E, Stoye J: Genomic distance with DCJ and indels. Algorithms in Bioinformatics. 2010, 90-101."},{"key":"6104_CR15","first-page":"222","volume-title":"Proc 11th Ann Symp Combin Pattern Matching (CPM'00), Volume 1848 of Lecture Notes in Comp Sci","author":"N El-Mabrouk","year":"2000","unstructured":"El-Mabrouk N: Genome rearrangement by reversals and insertions\/deletions of contiguous segments. Proc 11th Ann Symp Combin Pattern Matching (CPM'00), Volume 1848 of Lecture Notes in Comp Sci. 2000, Springer Verlag, Berlin, 222-234."},{"issue":"6","key":"6104_CR16","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1137\/05064727X","volume":"36","author":"M Alekseyev","year":"2007","unstructured":"Alekseyev M, Pevzner P: Whole genome duplications and contracted breakpoint graphs. SIAM J on Computing. 2007, 36 (6): 1748-1763. 10.1137\/05064727X.","journal-title":"SIAM J on Computing"},{"issue":"3","key":"6104_CR17","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1137\/S0097539700377177","volume":"32","author":"N El-Mabrouk","year":"2003","unstructured":"El-Mabrouk N, Sankoff D: The Reconstruction of Doubled Genomes. SIAM J Computing. 2003, 32 (3): 754-792. 10.1137\/S0097539700377177.","journal-title":"SIAM J Computing"},{"issue":"3","key":"6104_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1089\/cmb.2010.0252","volume":"18","author":"B Paten","year":"2011","unstructured":"Paten B, Diekhans M, Earl D, John J, Ma J, Suh B, Haussler D: Cactus graphs for genome comparisons. J Comput Biol. 2011, 18 (3): 469-481. 10.1089\/cmb.2010.0252.","journal-title":"J Comput Biol"},{"issue":"7","key":"6104_CR19","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1038\/nrg1895","volume":"7","author":"J Bailey","year":"2006","unstructured":"Bailey J, Eichler E: Primate segmental duplications: crucibles of evolution, diversity and disease. Nature Reviews Genetics. 2006, 7 (7): 552-564. 10.1038\/nrg1895.","journal-title":"Nature Reviews Genetics"},{"key":"6104_CR20","volume-title":"The Origins of Genome Architecture","author":"M Lynch","year":"2007","unstructured":"Lynch M: The Origins of Genome Architecture. 2007, Sinauer"},{"issue":"11","key":"6104_CR21","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1038\/ng.2007.9","volume":"39","author":"Z Jiang","year":"2007","unstructured":"Jiang Z, Tang H, Ventura M, Cardone M, Marques-Bonet T, She X, Pevzner P, Eichler E: Ancestral reconstruction of segmental duplications reveals punctuated cores of human genome evolution. Nature Genetics. 2007, 39 (11): 1361-1368. 10.1038\/ng.2007.9.","journal-title":"Nature Genetics"},{"issue":"16","key":"6104_CR22","doi-asserted-by":"publisher","first-page":"i133","DOI":"10.1093\/bioinformatics\/btn292","volume":"24","author":"C Kahn","year":"2008","unstructured":"Kahn C, Raphael B: Analysis of segmental duplications via duplication distance. Bioinformatics. 2008, 24 (16): i133-i138. 10.1093\/bioinformatics\/btn292.","journal-title":"Bioinformatics"},{"issue":"18","key":"6104_CR23","doi-asserted-by":"publisher","first-page":"i446","DOI":"10.1093\/bioinformatics\/btq368","volume":"26","author":"C Kahn","year":"2010","unstructured":"Kahn C, Hristov B, Raphael B: Parsimony and likelihood reconstruction of human segmental duplications. Bioinformatics. 2010, 26 (18): i446-i452. 10.1093\/bioinformatics\/btq368.","journal-title":"Bioinformatics"},{"key":"6104_CR24","first-page":"105","volume":"1","author":"N El-Mabrouk","year":"2001","unstructured":"El-Mabrouk N: Sorting signed permutations by reversals and insertions\/deletions of contiguous segments. Journal of Discrete Algorithms. 2001, 1: 105-122.","journal-title":"Journal of Discrete Algorithms"},{"key":"6104_CR25","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45071-8_54","volume-title":"Proc 9th Conf Computing and Combinatorics (COCOON'03)","author":"M Marron","year":"2003","unstructured":"Marron M, Swenson K, Moret B: Genomic distances under deletions and insertions. Proc 9th Conf Computing and Combinatorics (COCOON'03). 2003, Springer, 537-547."},{"issue":"9","key":"6104_CR26","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1089\/cmb.2011.0098","volume":"18","author":"Y Lin","year":"2011","unstructured":"Lin Y, Moret B: A new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes. J Comput Biol. 2011, 18 (9): 1055-1064. 10.1089\/cmb.2011.0098.","journal-title":"J Comput Biol"},{"issue":"Suppl 19","key":"6104_CR27","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-13-S19-S13","volume":"13","author":"M Shao","year":"2012","unstructured":"Shao M, Lin Y: Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. BMC Bioinformatics. 2012, 13 (Suppl 19): S13-10.1186\/1471-2105-13-S19-S13.","journal-title":"BMC Bioinformatics"},{"key":"6104_CR28","first-page":"285","volume-title":"Proc 18th Pacific Symp on Biocomputing (PSB'13)","author":"Y Lin","year":"2013","unstructured":"Lin Y, Hu F, Tang J, Moret B: Maximum likelihood phylogenetic reconstruction from high-resolution whole-genome data and a tree of 68 eukaryotes. Proc 18th Pacific Symp on Biocomputing (PSB'13). 2013, 285-296."},{"issue":"12","key":"6104_CR29","doi-asserted-by":"publisher","first-page":"e29477","DOI":"10.1371\/journal.pone.0029477","volume":"6","author":"K Fujimura","year":"2011","unstructured":"Fujimura K, Conte M, Kocher T: Circular DNA Intermediate in the Duplication of Nile Tilapia vasa Genes. PLoS ONE. 2011, 6 (12): e29477-10.1371\/journal.pone.0029477.","journal-title":"PLoS ONE"},{"key":"6104_CR30","first-page":"99","volume-title":"Proceedings of JOBIM, Volume 2","author":"A Bergeron","year":"2002","unstructured":"Bergeron A, Chauve C, Hartman T, St-Onge K: On the properties of sequences of reversals that sort a signed permutation. Proceedings of JOBIM, Volume 2. 2002, Citeseer, 99-108."},{"issue":"3","key":"6104_CR31","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TCBB.2008.16","volume":"5","author":"M Braga","year":"2008","unstructured":"Braga M, Sagot MF, Scornavacca C, Tannier E: Exploring the solution space of sorting by reversals, with experiments and an application to evolution. ACM\/IEEE Trans on Comput Bio & Bioinf. 2008, 5 (3): 348-356.","journal-title":"ACM\/IEEE Trans on Comput Bio & Bioinf"},{"issue":"9","key":"6104_CR32","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"M Braga","year":"2010","unstructured":"Braga M, Stoye J: The solution space of sorting by DCJ. J Comput Biol. 2010, 17 (9): 1145-1165. 10.1089\/cmb.2010.0109.","journal-title":"J Comput Biol"},{"issue":"7383","key":"6104_CR33","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1038\/nature10757","volume":"482","author":"K Durkin","year":"2012","unstructured":"Durkin K: Serial translocation by means of circular intermediates underlies colour sidedness in cattle. Nature. 2012, 482 (7383): 81-84. 10.1038\/nature10757.","journal-title":"Nature"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S15-S9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-14-S15-S9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S15-S9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T06:21:12Z","timestamp":1548138072000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-14-S15-S9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":33,"journal-issue":{"issue":"S15","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["6104"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-14-s15-s9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]},"article-number":"S9"}}